./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:33:33,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:33:33,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:33:33,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:33:33,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:33:33,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:33:33,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:33:33,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:33:33,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:33:33,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:33:33,290 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:33:33,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:33:33,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:33:33,291 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:33:33,291 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:33:33,291 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:33:33,291 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:33:33,291 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:33:33,291 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:33:33,291 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:33:33,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:33:33,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:33:33,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:33:33,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:33:33,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:33:33,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:33:33,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:33:33,292 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:33:33,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:33:33,292 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:33:33,292 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:33:33,292 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:33:33,292 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:33:33,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:33:33,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:33:33,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:33:33,293 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:33:33,293 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2025-03-04 15:33:33,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:33:33,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:33:33,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:33:33,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:33:33,534 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:33:33,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2025-03-04 15:33:34,647 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72be73102/92b918ed0c2e4df4915e21e3d24a6fc1/FLAG247765ea3 [2025-03-04 15:33:34,892 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:33:34,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2025-03-04 15:33:34,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72be73102/92b918ed0c2e4df4915e21e3d24a6fc1/FLAG247765ea3 [2025-03-04 15:33:35,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72be73102/92b918ed0c2e4df4915e21e3d24a6fc1 [2025-03-04 15:33:35,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:33:35,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:33:35,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:33:35,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:33:35,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:33:35,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1719a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35, skipping insertion in model container [2025-03-04 15:33:35,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:33:35,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:33:35,346 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:33:35,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:33:35,366 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:33:35,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35 WrapperNode [2025-03-04 15:33:35,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:33:35,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:33:35,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:33:35,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:33:35,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,389 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-03-04 15:33:35,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:33:35,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:33:35,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:33:35,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:33:35,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,414 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [4, 4, 4, 3]. 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, 3, 3, 2]. [2025-03-04 15:33:35,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:33:35,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:33:35,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:33:35,426 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:33:35,430 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (1/1) ... [2025-03-04 15:33:35,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:33:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:33:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:33:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:33:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:33:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:33:35,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:33:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:33:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:33:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:33:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:33:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:33:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:33:35,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:33:35,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:33:35,660 INFO L1325 $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-03-04 15:33:35,666 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-04 15:33:35,667 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:33:35,672 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:33:35,673 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:33:35,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:35 BoogieIcfgContainer [2025-03-04 15:33:35,673 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:33:35,674 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:33:35,674 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:33:35,679 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:33:35,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:35,680 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:33:35" (1/3) ... [2025-03-04 15:33:35,681 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67c2cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:33:35, skipping insertion in model container [2025-03-04 15:33:35,681 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:35,681 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:35" (2/3) ... [2025-03-04 15:33:35,681 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67c2cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:33:35, skipping insertion in model container [2025-03-04 15:33:35,681 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:35,681 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:35" (3/3) ... [2025-03-04 15:33:35,682 INFO L363 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2025-03-04 15:33:35,716 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:33:35,717 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:33:35,717 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:33:35,717 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:33:35,717 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:33:35,717 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:33:35,717 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:33:35,718 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:33:35,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:35,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:35,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:35,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:35,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:33:35,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:35,737 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:33:35,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:35,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:35,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:35,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:35,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:33:35,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:35,742 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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-03-04 15:33:35,742 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(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-03-04 15:33:35,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2025-03-04 15:33:35,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:35,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460818698] [2025-03-04 15:33:35,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:35,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:35,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:35,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:35,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:35,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:35,887 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:35,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:35,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:35,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:35,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:35,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:35,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 1 times [2025-03-04 15:33:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:35,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927186852] [2025-03-04 15:33:35,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:35,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:35,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:35,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:35,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:35,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:35,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:35,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:35,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:35,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:35,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:35,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:35,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:35,950 INFO L85 PathProgramCache]: Analyzing trace with hash 44819525, now seen corresponding path program 1 times [2025-03-04 15:33:35,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:35,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986850528] [2025-03-04 15:33:35,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:35,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:35,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:36,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:36,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:36,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:36,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:36,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:36,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:36,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:36,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:36,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:36,774 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:36,775 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:36,775 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:36,775 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:36,775 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:36,775 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:36,775 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:36,775 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:36,776 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2025-03-04 15:33:36,776 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:36,776 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:36,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:36,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:36,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:36,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:36,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:37,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:37,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:37,561 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:37,564 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:37,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:33:37,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:37,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:37,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:37,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:33:37,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:33:37,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:37,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:37,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:37,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:33:37,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:37,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:37,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:37,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:33:37,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:37,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:37,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:33:37,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:37,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:37,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,713 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:33:37,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:37,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:37,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:33:37,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:37,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:37,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,769 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:33:37,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:37,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:37,794 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,803 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:33:37,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:37,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:37,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,831 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:33:37,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:37,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:37,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,868 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:33:37,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-03-04 15:33:37,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:37,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:37,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,893 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:33:37,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:37,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:37,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:37,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 15:33:37,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,920 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:33:37,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:37,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:37,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:37,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:37,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:37,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:37,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:37,947 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:37,964 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-04 15:33:37,966 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-04 15:33:37,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,970 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:33:37,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:37,985 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:33:37,985 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:37,985 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-03-04 15:33:37,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:38,060 INFO L156 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2025-03-04 15:33:38,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:33:38,065 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:33:38,066 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2025-03-04 15:33:38,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:38,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:38,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:38,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:38,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:38,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:38,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:38,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:38,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:38,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:33:38,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:38,150 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:33:38,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:38,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 33 transitions. Complement of second has 8 states. [2025-03-04 15:33:38,188 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-03-04 15:33:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-03-04 15:33:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2025-03-04 15:33:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-04 15:33:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-04 15:33:38,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:38,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2025-03-04 15:33:38,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:38,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 13 states and 18 transitions. [2025-03-04 15:33:38,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:33:38,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:33:38,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-03-04 15:33:38,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:38,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-04 15:33:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-03-04 15:33:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-04 15:33:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-03-04 15:33:38,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-04 15:33:38,216 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-04 15:33:38,216 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:33:38,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2025-03-04 15:33:38,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:38,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:38,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:38,218 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:33:38,218 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:33:38,218 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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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-03-04 15:33:38,218 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#3(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-03-04 15:33:38,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash 44819530, now seen corresponding path program 1 times [2025-03-04 15:33:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917040330] [2025-03-04 15:33:38,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:38,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:38,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:38,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:38,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917040330] [2025-03-04 15:33:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917040330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:38,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:38,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:33:38,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832148489] [2025-03-04 15:33:38,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:38,396 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:33:38,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:38,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1086342, now seen corresponding path program 1 times [2025-03-04 15:33:38,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:38,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739096252] [2025-03-04 15:33:38,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:38,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:38,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:38,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:38,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:38,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:38,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:38,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:38,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:38,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:38,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 15:33:38,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:38,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:33:38,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:33:38,563 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:38,589 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-03-04 15:33:38,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2025-03-04 15:33:38,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:33:38,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2025-03-04 15:33:38,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:33:38,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:33:38,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2025-03-04 15:33:38,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:38,590 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-04 15:33:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2025-03-04 15:33:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-04 15:33:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-04 15:33:38,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-04 15:33:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:33:38,592 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-04 15:33:38,592 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:33:38,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2025-03-04 15:33:38,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:33:38,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:38,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:38,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-03-04 15:33:38,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2025-03-04 15:33:38,596 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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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-03-04 15:33:38,596 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#3(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#3(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-03-04 15:33:38,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash -516345915, now seen corresponding path program 1 times [2025-03-04 15:33:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:38,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444841482] [2025-03-04 15:33:38,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:38,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:33:38,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:38,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:38,624 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:38,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:33:38,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:38,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:38,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:38,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:38,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1996658935, now seen corresponding path program 1 times [2025-03-04 15:33:38,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:38,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514335791] [2025-03-04 15:33:38,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:38,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:38,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:38,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:38,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:38,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:38,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:38,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:38,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:38,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:38,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197637, now seen corresponding path program 1 times [2025-03-04 15:33:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:38,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054601339] [2025-03-04 15:33:38,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:38,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:33:38,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:33:38,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:38,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:38,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:33:38,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:33:38,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:38,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:38,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:39,792 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:39,792 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:39,792 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:39,792 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:39,792 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:39,792 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:39,792 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:39,792 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:39,792 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2025-03-04 15:33:39,792 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:39,792 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:39,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:39,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:39,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:39,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:40,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:40,501 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:40,501 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:40,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,503 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:33:40,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:40,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:40,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:40,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:40,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,524 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:33:40,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:40,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:40,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:40,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 15:33:40,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,544 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:33:40,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:40,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:40,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:40,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-04 15:33:40,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,563 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:33:40,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 15:33:40,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,588 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 15:33:40,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 15:33:40,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,611 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 15:33:40,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 15:33:40,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,638 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 15:33:40,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 15:33:40,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,660 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:33:40,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 15:33:40,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,686 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:33:40,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:40,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,714 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:33:40,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:40,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,741 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 15:33:40,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:40,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,768 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 15:33:40,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 15:33:40,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,795 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 15:33:40,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:40,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,823 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 15:33:40,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-04 15:33:40,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,851 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 15:33:40,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:33:40,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,874 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 15:33:40,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:40,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 15:33:40,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,901 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 15:33:40,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:40,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:40,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:40,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:40,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:40,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:40,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:40,921 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:40,938 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-04 15:33:40,938 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 15:33:40,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,940 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 15:33:40,942 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:40,952 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:33:40,953 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:40,953 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-03-04 15:33:40,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 15:33:41,044 INFO L156 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2025-03-04 15:33:41,046 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2025-03-04 15:33:41,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:41,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:33:41,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:41,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:41,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:41,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:41,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:41,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:41,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:41,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:41,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:41,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:33:41,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:41,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:33:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:33:41,152 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:33:41,152 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:41,163 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 5 states. [2025-03-04 15:33:41,163 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-03-04 15:33:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-04 15:33:41,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 7 letters. [2025-03-04 15:33:41,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:41,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 7 letters. [2025-03-04 15:33:41,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:41,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 14 letters. [2025-03-04 15:33:41,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:41,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2025-03-04 15:33:41,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-04 15:33:41,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2025-03-04 15:33:41,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-04 15:33:41,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-04 15:33:41,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2025-03-04 15:33:41,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:41,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-04 15:33:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2025-03-04 15:33:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-03-04 15:33:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2025-03-04 15:33:41,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-03-04 15:33:41,168 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-03-04 15:33:41,168 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:33:41,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2025-03-04 15:33:41,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-04 15:33:41,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:41,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:41,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:33:41,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:41,169 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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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-03-04 15:33:41,170 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(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-03-04 15:33:41,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1173145824, now seen corresponding path program 2 times [2025-03-04 15:33:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:41,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655469102] [2025-03-04 15:33:41,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:41,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-04 15:33:41,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:41,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:41,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:41,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:41,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:41,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:41,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:41,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:41,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:41,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 2 times [2025-03-04 15:33:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880838572] [2025-03-04 15:33:41,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:41,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:41,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:41,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:41,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:33:41,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:41,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:41,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:41,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:41,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:41,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:41,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:41,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1038369093, now seen corresponding path program 3 times [2025-03-04 15:33:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035741667] [2025-03-04 15:33:41,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:41,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 3 equivalence classes. [2025-03-04 15:33:41,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:33:41,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:33:41,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:41,236 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:41,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:33:41,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:33:41,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:41,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:41,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:42,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:33:42,464 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:42,464 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:42,464 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:42,464 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:42,464 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:42,464 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,464 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:42,464 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:42,464 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2025-03-04 15:33:42,464 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:42,464 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:42,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:43,050 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:43,050 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:43,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,052 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 15:33:43,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-03-04 15:33:43,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:43,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:43,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:43,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 15:33:43,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,072 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 15:33:43,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:43,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:43,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:43,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 15:33:43,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,092 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 15:33:43,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:43,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:43,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:43,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 15:33:43,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,112 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 15:33:43,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:43,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:43,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:43,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 15:33:43,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,134 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 15:33:43,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:43,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:43,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:43,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:43,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,157 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 15:33:43,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:43,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,184 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 15:33:43,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,215 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 15:33:43,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 15:33:43,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,236 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 15:33:43,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 15:33:43,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,260 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 15:33:43,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:43,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,281 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 15:33:43,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 15:33:43,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,308 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 15:33:43,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:43,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,329 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 15:33:43,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,349 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 15:33:43,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-04 15:33:43,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,373 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 15:33:43,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-04 15:33:43,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,394 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 15:33:43,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:43,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:43,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,417 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 15:33:43,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:43,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:43,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:43,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:43,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:43,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:43,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:43,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:43,434 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:43,434 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:33:43,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:43,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:43,436 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:43,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 15:33:43,437 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:43,447 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:33:43,448 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:43,448 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-03-04 15:33:43,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 15:33:43,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-04 15:33:43,526 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2025-03-04 15:33:43,527 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 15:33:43,527 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 15:33:43,527 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2025-03-04 15:33:43,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:43,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:43,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:43,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:43,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:43,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:43,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:43,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:43,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:43,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:43,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:43,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:33:43,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:43,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:43,588 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:33:43,588 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:43,604 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 76 transitions. Complement of second has 7 states. [2025-03-04 15:33:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-03-04 15:33:43,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-04 15:33:43,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:43,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-04 15:33:43,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:43,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2025-03-04 15:33:43,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:43,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2025-03-04 15:33:43,607 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2025-03-04 15:33:43,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 64 transitions. [2025-03-04 15:33:43,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-04 15:33:43,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-04 15:33:43,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2025-03-04 15:33:43,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:43,608 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-03-04 15:33:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2025-03-04 15:33:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-03-04 15:33:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 46 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2025-03-04 15:33:43,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-03-04 15:33:43,614 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-03-04 15:33:43,614 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:33:43,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2025-03-04 15:33:43,614 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2025-03-04 15:33:43,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:43,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:43,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:33:43,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2025-03-04 15:33:43,615 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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-03-04 15:33:43,615 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-03-04 15:33:43,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1173145827, now seen corresponding path program 1 times [2025-03-04 15:33:43,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:43,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717963895] [2025-03-04 15:33:43,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:43,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:43,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:43,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:43,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:43,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:33:43,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717963895] [2025-03-04 15:33:43,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717963895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:43,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:43,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:33:43,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812539665] [2025-03-04 15:33:43,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:43,713 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:33:43,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash -24074498, now seen corresponding path program 1 times [2025-03-04 15:33:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:43,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426655770] [2025-03-04 15:33:43,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:43,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:33:43,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:43,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:43,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:43,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:43,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:33:43,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:43,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:43,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:43,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:43,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:43,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:33:43,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:33:43,949 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:43,964 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-03-04 15:33:43,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2025-03-04 15:33:43,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-04 15:33:43,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2025-03-04 15:33:43,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-04 15:33:43,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-04 15:33:43,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2025-03-04 15:33:43,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:43,965 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-04 15:33:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2025-03-04 15:33:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-04 15:33:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-03-04 15:33:43,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-04 15:33:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:33:43,970 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-04 15:33:43,970 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:33:43,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2025-03-04 15:33:43,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-04 15:33:43,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:43,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:43,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1] [2025-03-04 15:33:43,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:43,971 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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#3(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#3(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-03-04 15:33:43,971 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(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-03-04 15:33:43,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1135519200, now seen corresponding path program 4 times [2025-03-04 15:33:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:43,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942706917] [2025-03-04 15:33:43,971 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:43,981 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:33:43,989 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:33:43,989 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:33:43,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:33:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942706917] [2025-03-04 15:33:44,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942706917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:33:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657341322] [2025-03-04 15:33:44,090 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:33:44,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:44,092 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:33:44,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-03-04 15:33:44,131 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:33:44,148 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:33:44,148 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:33:44,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:44,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:33:44,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:44,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:33:44,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:33:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:33:44,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:33:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657341322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:33:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-04 15:33:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906368819] [2025-03-04 15:33:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:44,175 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:33:44,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 3 times [2025-03-04 15:33:44,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:44,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431442555] [2025-03-04 15:33:44,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:44,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:44,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:44,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:33:44,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:44,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:44,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:44,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:44,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:44,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:44,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:44,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:44,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:33:44,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:33:44,224 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 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-03-04 15:33:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:44,237 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-04 15:33:44,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2025-03-04 15:33:44,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-04 15:33:44,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2025-03-04 15:33:44,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-04 15:33:44,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-04 15:33:44,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2025-03-04 15:33:44,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:44,238 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-04 15:33:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2025-03-04 15:33:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-04 15:33:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 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-03-04 15:33:44,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-04 15:33:44,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-04 15:33:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:33:44,240 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-04 15:33:44,240 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:33:44,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2025-03-04 15:33:44,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-04 15:33:44,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:44,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:44,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1] [2025-03-04 15:33:44,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2025-03-04 15:33:44,241 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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#3(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#3(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-03-04 15:33:44,241 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#1(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#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#3(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#3(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-03-04 15:33:44,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:44,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197637, now seen corresponding path program 5 times [2025-03-04 15:33:44,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:44,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043914080] [2025-03-04 15:33:44,241 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:33:44,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:44,249 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 4 equivalence classes. [2025-03-04 15:33:44,264 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:33:44,264 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 15:33:44,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:44,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:44,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:33:44,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:33:44,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:44,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:44,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:44,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:44,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1776752198, now seen corresponding path program 1 times [2025-03-04 15:33:44,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:44,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112695317] [2025-03-04 15:33:44,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:44,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:44,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:33:44,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:33:44,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:44,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:44,280 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:44,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:33:44,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:33:44,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:44,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:44,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:44,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:44,285 INFO L85 PathProgramCache]: Analyzing trace with hash 229835522, now seen corresponding path program 1 times [2025-03-04 15:33:44,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:44,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142487291] [2025-03-04 15:33:44,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:44,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:33:44,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:33:44,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:44,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:44,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:44,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:33:44,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:33:44,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:44,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:44,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:45,880 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:45,880 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:45,880 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:45,880 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:45,880 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:45,880 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:45,880 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:45,880 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:45,880 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2025-03-04 15:33:45,880 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:45,880 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:45,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:45,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:45,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:45,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:46,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:46,575 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:46,575 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:46,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,577 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 15:33:46,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:46,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:46,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:46,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 15:33:46,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,598 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 15:33:46,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:46,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:46,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:46,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 15:33:46,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,618 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 15:33:46,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:46,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:46,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:46,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-04 15:33:46,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,638 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 15:33:46,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 15:33:46,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,662 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 15:33:46,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-04 15:33:46,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,687 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 15:33:46,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,698 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:33:46,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,704 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-04 15:33:46,704 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:33:46,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 15:33:46,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,723 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 15:33:46,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 15:33:46,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,751 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 15:33:46,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 15:33:46,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,776 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 15:33:46,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:46,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,798 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 15:33:46,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 15:33:46,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,820 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 15:33:46,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:46,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,844 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 15:33:46,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 15:33:46,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,868 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 15:33:46,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 15:33:46,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,893 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 15:33:46,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 15:33:46,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,916 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-04 15:33:46,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-04 15:33:46,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,942 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-04 15:33:46,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:46,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-04 15:33:46,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,964 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-04 15:33:46,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:46,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:46,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:46,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:46,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:46,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:46,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:46,980 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:46,982 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 15:33:46,982 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:33:46,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:46,984 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:46,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-04 15:33:46,986 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:46,996 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:33:46,996 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:46,996 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2025-03-04 15:33:47,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-04 15:33:47,071 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2025-03-04 15:33:47,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 15:33:47,073 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 15:33:47,073 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2025-03-04 15:33:47,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:33:47,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:33:47,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:47,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:47,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:47,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:33:47,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:33:47,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:47,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:33:47,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:47,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-04 15:33:47,169 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-03-04 15:33:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 15:33:47,213 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:47,213 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:47,227 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 77 transitions. Complement of second has 7 states. [2025-03-04 15:33:47,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-03-04 15:33:47,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 15 letters. [2025-03-04 15:33:47,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:47,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 30 letters. Loop has 15 letters. [2025-03-04 15:33:47,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:47,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 30 letters. [2025-03-04 15:33:47,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:47,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2025-03-04 15:33:47,230 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-03-04 15:33:47,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2025-03-04 15:33:47,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-04 15:33:47,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-03-04 15:33:47,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2025-03-04 15:33:47,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:47,230 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-04 15:33:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2025-03-04 15:33:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 15:33:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-03-04 15:33:47,233 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-04 15:33:47,233 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-04 15:33:47,233 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:33:47,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2025-03-04 15:33:47,234 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-03-04 15:33:47,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:47,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:47,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:33:47,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2025-03-04 15:33:47,234 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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#3(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#3(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#1(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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-03-04 15:33:47,234 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#3(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#3(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#1(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#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-03-04 15:33:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash 841356932, now seen corresponding path program 1 times [2025-03-04 15:33:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659064991] [2025-03-04 15:33:47,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:33:47,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:33:47,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 15:33:47,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:47,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659064991] [2025-03-04 15:33:47,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659064991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:47,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:47,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:33:47,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032174484] [2025-03-04 15:33:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:47,311 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:33:47,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash -624921022, now seen corresponding path program 2 times [2025-03-04 15:33:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505426299] [2025-03-04 15:33:47,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:47,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:33:47,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:33:47,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:47,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:47,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:33:47,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:33:47,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:47,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:33:47,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:33:47,664 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. cyclomatic complexity: 19 Second operand has 4 states, 3 states have (on average 3.0) 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-03-04 15:33:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:47,677 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2025-03-04 15:33:47,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 97 transitions. [2025-03-04 15:33:47,678 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-03-04 15:33:47,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 76 states and 88 transitions. [2025-03-04 15:33:47,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-04 15:33:47,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-03-04 15:33:47,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 88 transitions. [2025-03-04 15:33:47,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:47,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2025-03-04 15:33:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 88 transitions. [2025-03-04 15:33:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-04 15:33:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.162162162162162) internal successors, (86), 73 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2025-03-04 15:33:47,681 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2025-03-04 15:33:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:33:47,682 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2025-03-04 15:33:47,682 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:33:47,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2025-03-04 15:33:47,683 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-03-04 15:33:47,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:47,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:47,684 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 15:33:47,684 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:47,684 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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#3(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#3(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#1(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#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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-03-04 15:33:47,684 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(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-03-04 15:33:47,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash -564794174, now seen corresponding path program 2 times [2025-03-04 15:33:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309621874] [2025-03-04 15:33:47,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 15:33:47,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:33:47,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:47,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:47,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:33:47,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:33:47,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:47,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 4 times [2025-03-04 15:33:47,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098005606] [2025-03-04 15:33:47,712 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,716 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 15:33:47,717 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:47,717 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:33:47,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:47,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:47,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:47,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:47,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1898641955, now seen corresponding path program 3 times [2025-03-04 15:33:47,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307914714] [2025-03-04 15:33:47,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:47,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-03-04 15:33:47,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 23 statements. [2025-03-04 15:33:47,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:33:47,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 15:33:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307914714] [2025-03-04 15:33:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307914714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:47,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:47,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:33:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520627988] [2025-03-04 15:33:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:47,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:33:47,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:33:47,829 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 18 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:47,842 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2025-03-04 15:33:47,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 80 transitions. [2025-03-04 15:33:47,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-03-04 15:33:47,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 76 transitions. [2025-03-04 15:33:47,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-04 15:33:47,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-03-04 15:33:47,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2025-03-04 15:33:47,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:47,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-03-04 15:33:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2025-03-04 15:33:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-03-04 15:33:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 67 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2025-03-04 15:33:47,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-03-04 15:33:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:33:47,846 INFO L432 stractBuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-03-04 15:33:47,846 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:33:47,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2025-03-04 15:33:47,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-03-04 15:33:47,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:47,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:47,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 1, 1, 1, 1] [2025-03-04 15:33:47,849 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 4, 4, 2, 2, 1, 1] [2025-03-04 15:33:47,849 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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#3(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#3(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#1(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#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#3(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#3(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#1(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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-03-04 15:33:47,849 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#3(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#3(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#1(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#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#3(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#3(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#3(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#3(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#1(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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-03-04 15:33:47,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1828604801, now seen corresponding path program 1 times [2025-03-04 15:33:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474062807] [2025-03-04 15:33:47,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:47,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:33:47,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:33:47,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:47,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:33:47,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:33:47,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:47,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1437690398, now seen corresponding path program 1 times [2025-03-04 15:33:47,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12145646] [2025-03-04 15:33:47,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:33:47,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:33:47,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:47,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:33:47,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:33:47,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:47,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1843118434, now seen corresponding path program 2 times [2025-03-04 15:33:47,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567734263] [2025-03-04 15:33:47,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:47,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-04 15:33:47,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:33:47,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:47,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-04 15:33:48,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:48,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567734263] [2025-03-04 15:33:48,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567734263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:33:48,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39360947] [2025-03-04 15:33:48,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:48,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:33:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,197 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-03-04 15:33:48,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-04 15:33:48,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:33:48,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:48,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:48,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:33:48,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:48,332 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-03-04 15:33:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-04 15:33:48,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:33:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-04 15:33:48,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39360947] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:33:48,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:33:48,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-04 15:33:48,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204406830] [2025-03-04 15:33:48,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:33:50,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:50,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:33:50,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:33:50,216 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:50,231 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2025-03-04 15:33:50,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 40 transitions. [2025-03-04 15:33:50,231 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:33:50,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2025-03-04 15:33:50,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:33:50,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:33:50,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:33:50,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:33:50,231 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:50,232 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:33:50,232 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:50,232 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:33:50,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:33:50,232 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:33:50,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:33:50,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:33:50 BoogieIcfgContainer [2025-03-04 15:33:50,237 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:33:50,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:33:50,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:33:50,238 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:33:50,238 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:35" (3/4) ... [2025-03-04 15:33:50,240 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:33:50,240 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:33:50,240 INFO L158 Benchmark]: Toolchain (without parser) took 15013.44ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 112.4MB in the beginning and 136.7MB in the end (delta: -24.2MB). Peak memory consumption was 207.7MB. Max. memory is 16.1GB. [2025-03-04 15:33:50,241 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:50,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.23ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 101.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:33:50,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.16ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:50,241 INFO L158 Benchmark]: Boogie Preprocessor took 35.52ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:50,241 INFO L158 Benchmark]: IcfgBuilder took 247.21ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 86.3MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:33:50,241 INFO L158 Benchmark]: BuchiAutomizer took 14563.62ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 85.2MB in the beginning and 136.7MB in the end (delta: -51.6MB). Peak memory consumption was 182.5MB. Max. memory is 16.1GB. [2025-03-04 15:33:50,241 INFO L158 Benchmark]: Witness Printer took 2.31ms. Allocated memory is still 377.5MB. Free memory was 136.7MB in the beginning and 136.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:50,242 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.23ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 101.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.16ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.52ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 247.21ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 86.3MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 14563.62ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 85.2MB in the beginning and 136.7MB in the end (delta: -51.6MB). Peak memory consumption was 182.5MB. Max. memory is 16.1GB. * Witness Printer took 2.31ms. Allocated memory is still 377.5MB. Free memory was 136.7MB in the beginning and 136.7MB in the end (delta: 92.3kB). 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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~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 14.5s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 13.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. 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, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 93 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: 30ms 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-03-04 15:33:50,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-03-04 15:33:50,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:50,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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