./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:43:17,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:43:17,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:43:17,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:43:17,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:43:17,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:43:17,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:43:17,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:43:17,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:43:17,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:43:17,521 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:43:17,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:43:17,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:43:17,521 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:43:17,521 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:43:17,521 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:43:17,521 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:43:17,521 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:43:17,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:43:17,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:43:17,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:43:17,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:43:17,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:43:17,523 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:43:17,523 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2025-03-04 15:43:17,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:43:17,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:43:17,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:43:17,767 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:43:17,767 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:43:17,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-03-04 15:43:18,831 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d669977/922ba0b35a454cf68c65bafd066957c4/FLAG684923b03 [2025-03-04 15:43:19,055 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:43:19,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2025-03-04 15:43:19,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d669977/922ba0b35a454cf68c65bafd066957c4/FLAG684923b03 [2025-03-04 15:43:19,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d669977/922ba0b35a454cf68c65bafd066957c4 [2025-03-04 15:43:19,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:43:19,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:43:19,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:43:19,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:43:19,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:43:19,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc81530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19, skipping insertion in model container [2025-03-04 15:43:19,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:43:19,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:43:19,516 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:43:19,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:43:19,541 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:43:19,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19 WrapperNode [2025-03-04 15:43:19,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:43:19,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:43:19,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:43:19,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:43:19,547 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:43:19" (1/1) ... [2025-03-04 15:43:19,554 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:43:19" (1/1) ... [2025-03-04 15:43:19,571 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 146 [2025-03-04 15:43:19,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:43:19,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:43:19,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:43:19,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:43:19,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,593 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-04 15:43:19,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:43:19,602 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:43:19,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:43:19,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:43:19,602 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (1/1) ... [2025-03-04 15:43:19,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:19,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:19,634 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:43:19,637 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:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:43:19,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:43:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:43:19,717 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:43:19,719 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:43:19,910 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29: call ULTIMATE.dealloc(main_~#set~0#1.base, main_~#set~0#1.offset);havoc main_~#set~0#1.base, main_~#set~0#1.offset;call ULTIMATE.dealloc(main_~#values~0#1.base, main_~#values~0#1.offset);havoc main_~#values~0#1.base, main_~#values~0#1.offset; [2025-03-04 15:43:19,928 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-04 15:43:19,928 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:43:19,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:43:19,936 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:43:19,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:43:19 BoogieIcfgContainer [2025-03-04 15:43:19,936 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:43:19,937 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:43:19,937 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:43:19,943 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:43:19,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:43:19,943 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:43:19" (1/3) ... [2025-03-04 15:43:19,945 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d7a5786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:43:19, skipping insertion in model container [2025-03-04 15:43:19,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:43:19,946 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:19" (2/3) ... [2025-03-04 15:43:19,946 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d7a5786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:43:19, skipping insertion in model container [2025-03-04 15:43:19,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:43:19,947 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:43:19" (3/3) ... [2025-03-04 15:43:19,948 INFO L363 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2025-03-04 15:43:19,987 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:43:19,987 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:43:19,987 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:43:19,987 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:43:19,987 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:43:19,988 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:43:19,988 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:43:19,988 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:43:19,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 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:43:20,007 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2025-03-04 15:43:20,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:20,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:20,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:43:20,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:20,011 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:43:20,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 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:43:20,013 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 30 [2025-03-04 15:43:20,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:20,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:20,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:43:20,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:20,018 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" [2025-03-04 15:43:20,018 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-03-04 15:43:20,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2784, now seen corresponding path program 1 times [2025-03-04 15:43:20,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:20,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148424888] [2025-03-04 15:43:20,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:20,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:20,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:20,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:20,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:20,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:20,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:20,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:20,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:20,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:20,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:20,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:20,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash 86, now seen corresponding path program 1 times [2025-03-04 15:43:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568129488] [2025-03-04 15:43:20,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:20,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:20,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:20,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:20,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:20,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:20,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:20,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:20,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:20,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:20,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:20,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash 86359, now seen corresponding path program 1 times [2025-03-04 15:43:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:20,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392563429] [2025-03-04 15:43:20,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:20,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:20,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:20,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:20,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:20,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:20,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:20,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:20,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:20,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:20,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:20,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:20,438 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:43:20,439 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:43:20,439 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:43:20,439 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:43:20,439 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:43:20,439 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:20,439 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:43:20,439 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:43:20,440 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2025-03-04 15:43:20,440 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:43:20,441 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:43:20,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:20,888 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:43:20,890 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:43:20,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:20,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:20,893 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:43:20,895 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:43:20,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:20,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:20,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:20,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:20,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:20,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:20,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:20,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:20,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:20,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:20,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:20,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:20,926 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:43:20,928 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:43:20,930 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:43:20,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:20,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:20,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:20,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:20,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:20,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:20,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:20,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:20,949 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:43:20,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:20,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:20,951 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:43:20,952 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:43:20,953 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:43:20,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:20,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:20,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:20,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:20,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:20,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:20,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:20,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:20,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 15:43:20,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:20,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:20,973 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:43:20,975 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:43:20,979 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:43:20,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:20,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:20,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:20,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:20,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:20,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:20,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:20,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:20,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:43:20,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:20,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:20,998 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:43:20,999 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:43:21,001 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:43:21,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 15:43:21,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,020 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:43:21,021 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:43:21,022 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:43:21,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 15:43:21,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,044 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:43:21,045 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:43:21,047 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:43:21,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 15:43:21,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,066 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:43:21,066 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:43:21,067 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:43:21,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:43:21,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,086 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:43:21,086 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:43:21,087 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:43:21,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 15:43:21,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,107 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:43:21,108 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:43:21,109 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:43:21,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:43:21,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,131 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:43:21,132 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:43:21,133 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:43:21,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,150 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:43:21,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,152 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:43:21,153 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:43:21,154 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:43:21,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:21,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,174 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:43:21,176 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:43:21,177 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:43:21,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:21,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:21,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,197 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:43:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,199 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:43:21,200 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:43:21,202 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:43:21,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:21,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:21,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:21,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,226 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:43:21,226 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:43:21,227 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:43:21,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:43:21,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,247 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:43:21,248 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:43:21,249 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:43:21,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,266 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:43:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,269 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:43:21,270 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:43:21,272 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:43:21,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:21,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,293 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:43:21,294 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:43:21,296 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:43:21,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:21,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,314 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:43:21,315 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:43:21,316 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:43:21,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:21,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:21,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,336 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:43:21,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,338 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:43:21,339 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:43:21,340 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:43:21,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:21,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:21,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:21,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,364 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:43:21,365 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:43:21,366 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:43:21,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:21,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:21,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:21,391 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:43:21,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,394 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:43:21,396 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:43:21,396 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:43:21,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:21,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:21,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:43:21,432 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-04 15:43:21,435 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 15:43:21,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,439 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:43:21,440 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:43:21,441 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:43:21,456 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:43:21,456 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:43:21,456 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1) = -8*ULTIMATE.start_main_~x~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1 Supporting invariants [] [2025-03-04 15:43:21,463 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:43:21,491 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-04 15:43:21,500 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:43:21,501 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:43:21,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:21,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:21,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:21,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:21,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:21,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:21,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:21,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:21,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:21,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:21,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:21,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:43:21,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:21,546 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:43:21,564 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 15:43:21,565 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:43:21,585 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 56 transitions. Complement of second has 3 states. [2025-03-04 15:43:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:43:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:43:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-04 15:43:21,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-04 15:43:21,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:21,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-04 15:43:21,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:21,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 15:43:21,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:21,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 56 transitions. [2025-03-04 15:43:21,595 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2025-03-04 15:43:21,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 34 states and 53 transitions. [2025-03-04 15:43:21,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-03-04 15:43:21,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-03-04 15:43:21,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 53 transitions. [2025-03-04 15:43:21,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:21,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 53 transitions. [2025-03-04 15:43:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 53 transitions. [2025-03-04 15:43:21,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-03-04 15:43:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 32 states have internal predecessors, (51), 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:43:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2025-03-04 15:43:21,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 51 transitions. [2025-03-04 15:43:21,614 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 51 transitions. [2025-03-04 15:43:21,614 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:43:21,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 51 transitions. [2025-03-04 15:43:21,615 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2025-03-04 15:43:21,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:21,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:21,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:43:21,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:43:21,617 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" [2025-03-04 15:43:21,617 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 < main_~n~0#1;main_~y~0#1 := 1 + main_~x~0#1;" "assume !(main_~y~0#1 < main_~n~0#1);main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2025-03-04 15:43:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash 86358, now seen corresponding path program 1 times [2025-03-04 15:43:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837602762] [2025-03-04 15:43:21,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:21,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:21,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:21,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:21,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:21,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:21,653 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:43:21,674 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:43:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837602762] [2025-03-04 15:43:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837602762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:43:21,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:43:21,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:43:21,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695980639] [2025-03-04 15:43:21,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:43:21,676 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2648, now seen corresponding path program 1 times [2025-03-04 15:43:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500606031] [2025-03-04 15:43:21,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:21,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:21,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:21,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:21,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:21,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:21,682 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:21,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:21,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:21,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:21,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:21,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:21,716 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:43:21,717 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:43:21,717 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:43:21,717 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:43:21,717 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:43:21,717 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,717 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:43:21,717 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:43:21,717 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration2_Loop [2025-03-04 15:43:21,717 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:43:21,717 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:43:21,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:21,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:21,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:21,743 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:43:21,744 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:43:21,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,747 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:43:21,747 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:43:21,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:43:21,748 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:43:21,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:43:21,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,766 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:43:21,767 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:43:21,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:43:21,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:43:21,844 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:43:21,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 15:43:21,849 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:43:21,849 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:43:21,849 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:43:21,849 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:43:21,849 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:43:21,849 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,849 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:43:21,849 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:43:21,849 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration2_Loop [2025-03-04 15:43:21,849 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:43:21,849 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:43:21,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:21,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:21,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:21,875 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:43:21,875 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:43:21,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,877 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:43:21,878 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:43:21,879 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:43:21,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:21,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:21,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:21,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:21,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:21,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:21,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:21,894 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:43:21,896 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:43:21,896 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:43:21,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:21,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:21,899 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:43:21,900 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:43:21,900 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:43:21,900 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:43:21,900 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:43:21,900 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-04 15:43:21,906 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:43:21,907 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:43:21,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:21,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:21,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:21,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:21,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:21,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:21,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:21,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:21,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:21,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:21,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:21,933 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:43:21,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:21,943 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:43:21,944 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:43:21,944 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 51 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:43:21,964 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 51 transitions. cyclomatic complexity: 23. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 69 states and 107 transitions. Complement of second has 6 states. [2025-03-04 15:43:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:43:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:43:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-03-04 15:43:21,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-04 15:43:21,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:21,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 15:43:21,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:21,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 4 letters. [2025-03-04 15:43:21,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:21,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 107 transitions. [2025-03-04 15:43:21,967 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2025-03-04 15:43:21,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 36 states and 56 transitions. [2025-03-04 15:43:21,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-04 15:43:21,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-04 15:43:21,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 56 transitions. [2025-03-04 15:43:21,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:43:21,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 56 transitions. [2025-03-04 15:43:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 56 transitions. [2025-03-04 15:43:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-04 15:43:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 53 transitions. [2025-03-04 15:43:21,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 53 transitions. [2025-03-04 15:43:21,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:21,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:43:21,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:43:21,971 INFO L87 Difference]: Start difference. First operand 34 states and 53 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:43:22,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:22,003 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2025-03-04 15:43:22,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2025-03-04 15:43:22,004 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 29 [2025-03-04 15:43:22,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 60 transitions. [2025-03-04 15:43:22,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-03-04 15:43:22,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-03-04 15:43:22,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 60 transitions. [2025-03-04 15:43:22,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:43:22,004 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 60 transitions. [2025-03-04 15:43:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 60 transitions. [2025-03-04 15:43:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2025-03-04 15:43:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5) internal successors, (42), 27 states have internal predecessors, (42), 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:43:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2025-03-04 15:43:22,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2025-03-04 15:43:22,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:43:22,006 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2025-03-04 15:43:22,006 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:43:22,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2025-03-04 15:43:22,007 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2025-03-04 15:43:22,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:22,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:22,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:43:22,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:22,007 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume main_~x~0#1 < main_~n~0#1;main_~y~0#1 := 1 + main_~x~0#1;" [2025-03-04 15:43:22,007 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~y~0#1 < main_~n~0#1;call main_#t~mem5#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2025-03-04 15:43:22,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash 82992726, now seen corresponding path program 1 times [2025-03-04 15:43:22,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:22,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16385699] [2025-03-04 15:43:22,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:22,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:22,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:43:22,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:43:22,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:22,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:22,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16385699] [2025-03-04 15:43:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16385699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529820290] [2025-03-04 15:43:22,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:22,050 INFO L229 MonitoredProcess]: Starting monitored process 29 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:43:22,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 15:43:22,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:43:22,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:43:22,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:22,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:22,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:43:22,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:22,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:22,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529820290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:22,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:22,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 15:43:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693824732] [2025-03-04 15:43:22,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:22,121 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:22,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:22,121 INFO L85 PathProgramCache]: Analyzing trace with hash 81389, now seen corresponding path program 1 times [2025-03-04 15:43:22,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:22,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256729511] [2025-03-04 15:43:22,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:22,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:22,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:22,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:22,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:22,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:22,128 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:22,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:22,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:22,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:22,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:22,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:22,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:43:22,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:43:22,196 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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:43:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:22,308 INFO L93 Difference]: Finished difference Result 90 states and 126 transitions. [2025-03-04 15:43:22,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 126 transitions. [2025-03-04 15:43:22,309 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 59 [2025-03-04 15:43:22,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 126 transitions. [2025-03-04 15:43:22,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-03-04 15:43:22,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-03-04 15:43:22,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 126 transitions. [2025-03-04 15:43:22,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:43:22,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-03-04 15:43:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 126 transitions. [2025-03-04 15:43:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 31. [2025-03-04 15:43:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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:43:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2025-03-04 15:43:22,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-03-04 15:43:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:43:22,314 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-03-04 15:43:22,314 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:43:22,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2025-03-04 15:43:22,315 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2025-03-04 15:43:22,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:22,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:22,315 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1] [2025-03-04 15:43:22,315 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:43:22,315 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume main_~x~0#1 < main_~n~0#1;main_~y~0#1 := 1 + main_~x~0#1;" [2025-03-04 15:43:22,315 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~y~0#1 < main_~n~0#1;call main_#t~mem5#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2025-03-04 15:43:22,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1463824545, now seen corresponding path program 2 times [2025-03-04 15:43:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:22,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220658813] [2025-03-04 15:43:22,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:22,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 15:43:22,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-03-04 15:43:22,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:43:22,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:43:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220658813] [2025-03-04 15:43:22,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220658813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:43:22,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:43:22,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:43:22,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163520436] [2025-03-04 15:43:22,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:43:22,363 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:22,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:22,363 INFO L85 PathProgramCache]: Analyzing trace with hash 81389, now seen corresponding path program 2 times [2025-03-04 15:43:22,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:22,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616923431] [2025-03-04 15:43:22,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:22,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:22,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:22,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:22,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:43:22,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:22,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:22,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:22,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:22,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:22,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:22,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:22,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:22,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:43:22,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:43:22,441 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 20 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:43:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:22,464 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2025-03-04 15:43:22,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. [2025-03-04 15:43:22,465 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2025-03-04 15:43:22,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 43 transitions. [2025-03-04 15:43:22,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-04 15:43:22,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-04 15:43:22,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 43 transitions. [2025-03-04 15:43:22,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:22,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 43 transitions. [2025-03-04 15:43:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 43 transitions. [2025-03-04 15:43:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 15:43:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 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:43:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2025-03-04 15:43:22,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 43 transitions. [2025-03-04 15:43:22,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:43:22,468 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2025-03-04 15:43:22,468 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:43:22,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2025-03-04 15:43:22,468 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2025-03-04 15:43:22,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:22,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:22,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1] [2025-03-04 15:43:22,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:22,469 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-03-04 15:43:22,469 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-04 15:43:22,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1463824555, now seen corresponding path program 1 times [2025-03-04 15:43:22,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:22,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057464570] [2025-03-04 15:43:22,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:22,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:22,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:43:22,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:43:22,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:22,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:22,546 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2025-03-04 15:43:22,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-04 15:43:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057464570] [2025-03-04 15:43:22,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057464570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267230096] [2025-03-04 15:43:22,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:22,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:22,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:22,599 INFO L229 MonitoredProcess]: Starting monitored process 30 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:43:22,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 15:43:22,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:43:22,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:43:22,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:22,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:22,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:43:22,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:22,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:22,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267230096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:22,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:22,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 15:43:22,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136252499] [2025-03-04 15:43:22,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:22,718 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:22,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2025-03-04 15:43:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:22,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961542110] [2025-03-04 15:43:22,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:22,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:22,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:22,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:22,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:22,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:22,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:22,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:22,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:22,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:22,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:22,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:22,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:22,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:43:22,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:43:22,760 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 17 Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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:43:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:22,889 INFO L93 Difference]: Finished difference Result 117 states and 159 transitions. [2025-03-04 15:43:22,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 159 transitions. [2025-03-04 15:43:22,890 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 93 [2025-03-04 15:43:22,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 159 transitions. [2025-03-04 15:43:22,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2025-03-04 15:43:22,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2025-03-04 15:43:22,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 159 transitions. [2025-03-04 15:43:22,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:22,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 159 transitions. [2025-03-04 15:43:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 159 transitions. [2025-03-04 15:43:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 37. [2025-03-04 15:43:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 36 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:43:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2025-03-04 15:43:22,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 49 transitions. [2025-03-04 15:43:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:43:22,895 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2025-03-04 15:43:22,895 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:43:22,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 49 transitions. [2025-03-04 15:43:22,896 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2025-03-04 15:43:22,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:22,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:22,896 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1] [2025-03-04 15:43:22,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:22,896 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-03-04 15:43:22,896 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-04 15:43:22,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash -612262923, now seen corresponding path program 2 times [2025-03-04 15:43:22,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:22,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130071760] [2025-03-04 15:43:22,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:22,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 15:43:22,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:22,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:43:22,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:23,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:23,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130071760] [2025-03-04 15:43:23,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130071760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:23,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086670940] [2025-03-04 15:43:23,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:23,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:23,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:23,113 INFO L229 MonitoredProcess]: Starting monitored process 31 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:43:23,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 15:43:23,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 15:43:23,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:23,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:43:23,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:23,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:43:23,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:23,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086670940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:23,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:23,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-04 15:43:23,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346272362] [2025-03-04 15:43:23,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:23,367 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:23,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 2 times [2025-03-04 15:43:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:23,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747820624] [2025-03-04 15:43:23,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:23,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:23,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:23,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:23,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:43:23,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:23,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:23,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:23,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:23,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:23,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:23,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:23,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:23,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 15:43:23,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 15:43:23,408 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. cyclomatic complexity: 17 Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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:43:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:23,663 INFO L93 Difference]: Finished difference Result 225 states and 303 transitions. [2025-03-04 15:43:23,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 303 transitions. [2025-03-04 15:43:23,665 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 177 [2025-03-04 15:43:23,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 225 states and 303 transitions. [2025-03-04 15:43:23,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2025-03-04 15:43:23,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2025-03-04 15:43:23,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 303 transitions. [2025-03-04 15:43:23,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:23,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 225 states and 303 transitions. [2025-03-04 15:43:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 303 transitions. [2025-03-04 15:43:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 49. [2025-03-04 15:43:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 48 states have internal predecessors, (61), 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:43:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2025-03-04 15:43:23,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-03-04 15:43:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:43:23,676 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-03-04 15:43:23,676 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:43:23,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 61 transitions. [2025-03-04 15:43:23,677 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2025-03-04 15:43:23,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:23,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:23,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 1, 1, 1, 1] [2025-03-04 15:43:23,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:23,677 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-03-04 15:43:23,677 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-04 15:43:23,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:23,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1425231157, now seen corresponding path program 3 times [2025-03-04 15:43:23,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:23,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532502608] [2025-03-04 15:43:23,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:23,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 12 equivalence classes. [2025-03-04 15:43:23,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:43:23,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 15:43:23,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:24,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:24,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532502608] [2025-03-04 15:43:24,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532502608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:24,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338640147] [2025-03-04 15:43:24,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:24,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:24,145 INFO L229 MonitoredProcess]: Starting monitored process 32 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:43:24,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 15:43:24,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 12 equivalence classes. [2025-03-04 15:43:25,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:43:25,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 15:43:25,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:25,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:43:25,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:25,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:26,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338640147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:26,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:26,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-04 15:43:26,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220147900] [2025-03-04 15:43:26,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:26,522 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:26,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 3 times [2025-03-04 15:43:26,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:26,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622039325] [2025-03-04 15:43:26,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:26,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:26,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:26,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:26,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:43:26,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:26,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:26,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:26,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:26,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:26,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:26,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:26,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 15:43:26,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 15:43:26,560 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. cyclomatic complexity: 17 Second operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 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:43:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:27,151 INFO L93 Difference]: Finished difference Result 441 states and 591 transitions. [2025-03-04 15:43:27,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 441 states and 591 transitions. [2025-03-04 15:43:27,158 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 345 [2025-03-04 15:43:27,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 441 states to 441 states and 591 transitions. [2025-03-04 15:43:27,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 395 [2025-03-04 15:43:27,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 395 [2025-03-04 15:43:27,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 441 states and 591 transitions. [2025-03-04 15:43:27,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:27,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 441 states and 591 transitions. [2025-03-04 15:43:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states and 591 transitions. [2025-03-04 15:43:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 73. [2025-03-04 15:43:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 72 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2025-03-04 15:43:27,173 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 85 transitions. [2025-03-04 15:43:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 15:43:27,176 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 85 transitions. [2025-03-04 15:43:27,176 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:43:27,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 85 transitions. [2025-03-04 15:43:27,177 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2025-03-04 15:43:27,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:27,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:27,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 1, 1, 1, 1] [2025-03-04 15:43:27,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:27,180 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-03-04 15:43:27,180 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-04 15:43:27,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1290211253, now seen corresponding path program 4 times [2025-03-04 15:43:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:27,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490620957] [2025-03-04 15:43:27,181 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:43:27,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:27,203 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-03-04 15:43:27,236 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 15:43:27,236 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:43:27,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490620957] [2025-03-04 15:43:28,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490620957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072214275] [2025-03-04 15:43:28,545 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:43:28,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:28,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:28,547 INFO L229 MonitoredProcess]: Starting monitored process 33 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:43:28,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 15:43:28,619 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-03-04 15:43:28,667 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 15:43:28,667 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:43:28,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:28,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 15:43:28,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:28,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072214275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:30,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:30,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-03-04 15:43:30,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321968724] [2025-03-04 15:43:30,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:30,639 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:30,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 4 times [2025-03-04 15:43:30,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:30,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779130349] [2025-03-04 15:43:30,639 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:43:30,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:30,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-04 15:43:30,647 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:30,647 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:43:30,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:30,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:30,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:30,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:30,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:30,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:30,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:30,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-04 15:43:30,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-04 15:43:30,682 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. cyclomatic complexity: 17 Second operand has 97 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 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:43:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:33,509 INFO L93 Difference]: Finished difference Result 873 states and 1167 transitions. [2025-03-04 15:43:33,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 873 states and 1167 transitions. [2025-03-04 15:43:33,513 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 681 [2025-03-04 15:43:33,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 873 states to 873 states and 1167 transitions. [2025-03-04 15:43:33,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 779 [2025-03-04 15:43:33,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 779 [2025-03-04 15:43:33,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 873 states and 1167 transitions. [2025-03-04 15:43:33,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:33,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 873 states and 1167 transitions. [2025-03-04 15:43:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states and 1167 transitions. [2025-03-04 15:43:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 121. [2025-03-04 15:43:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.0991735537190082) internal successors, (133), 120 states have internal predecessors, (133), 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:43:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2025-03-04 15:43:33,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 121 states and 133 transitions. [2025-03-04 15:43:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 15:43:33,530 INFO L432 stractBuchiCegarLoop]: Abstraction has 121 states and 133 transitions. [2025-03-04 15:43:33,530 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:43:33,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 133 transitions. [2025-03-04 15:43:33,531 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2025-03-04 15:43:33,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:33,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:33,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 1, 1, 1, 1] [2025-03-04 15:43:33,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:33,532 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2025-03-04 15:43:33,534 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-04 15:43:33,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1070601397, now seen corresponding path program 5 times [2025-03-04 15:43:33,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:33,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47232071] [2025-03-04 15:43:33,535 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:43:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:33,580 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 98 statements into 48 equivalence classes. [2025-03-04 15:43:33,797 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 15:43:33,797 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2025-03-04 15:43:33,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:43:38,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47232071] [2025-03-04 15:43:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47232071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456627448] [2025-03-04 15:43:38,028 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:43:38,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:38,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:38,031 INFO L229 MonitoredProcess]: Starting monitored process 34 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:43:38,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 15:43:38,152 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 98 statements into 48 equivalence classes.