./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/mix055.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i ./goblint.2024-06-19_11-23-25.files/protection/mix055.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:38:47,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:38:47,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:38:47,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:38:47,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:38:47,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:38:47,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:38:47,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:38:47,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:38:47,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:38:47,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:38:47,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:38:47,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:38:47,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:38:47,751 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:38:47,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:38:47,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:38:47,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:38:47,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:38:47,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:38:47,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:38:47,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:38:47,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:38:47,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:38:47,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:38:47,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:38:47,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:38:47,754 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:38:47,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:38:47,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:38:47,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:38:47,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:38:47,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:38:47,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:38:47,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:38:47,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:38:47,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:38:47,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:38:47,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:38:47,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:38:47,757 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:38:47,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:38:47,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:38:47,758 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 18:38:47,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:38:48,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:38:48,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:38:48,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:38:48,004 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:38:48,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2024-06-27 18:38:49,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:38:49,258 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:38:49,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2024-06-27 18:38:49,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb8baf263/c3200054f94c4a289fec2829c30865c5/FLAG25c6ee833 [2024-06-27 18:38:49,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb8baf263/c3200054f94c4a289fec2829c30865c5 [2024-06-27 18:38:49,300 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:38:49,301 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:38:49,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/mix055.opt.yml/witness.yml [2024-06-27 18:38:49,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:38:49,485 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:38:49,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:38:49,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:38:49,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:38:49,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:38:49" (1/2) ... [2024-06-27 18:38:49,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b2ac7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:38:49, skipping insertion in model container [2024-06-27 18:38:49,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:38:49" (1/2) ... [2024-06-27 18:38:49,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@124579a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:38:49, skipping insertion in model container [2024-06-27 18:38:49,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:38:49" (2/2) ... [2024-06-27 18:38:49,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b2ac7f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:49, skipping insertion in model container [2024-06-27 18:38:49,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:38:49" (2/2) ... [2024-06-27 18:38:49,494 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:38:49,589 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:38:49,590 INFO L97 edCorrectnessWitness]: Location invariant before [L841-L841] ((((((((((((((((((((! multithreaded || z$flush_delayed == (_Bool)0) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0) [2024-06-27 18:38:49,591 INFO L97 edCorrectnessWitness]: Location invariant before [L844-L844] ((((((((((((((((((((! multithreaded || z$flush_delayed == (_Bool)0) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0) [2024-06-27 18:38:49,591 INFO L97 edCorrectnessWitness]: Location invariant before [L843-L843] ((((((((((((((((((((! multithreaded || z$flush_delayed == (_Bool)0) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0) [2024-06-27 18:38:49,591 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((((! multithreaded || z$flush_delayed == (_Bool)0) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0) [2024-06-27 18:38:49,591 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:38:49,592 INFO L106 edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1; [2024-06-27 18:38:49,620 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:38:49,742 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i[944,957] [2024-06-27 18:38:49,890 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:38:49,898 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:38:49,929 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i[944,957] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:38:50,035 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:38:50,086 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:38:50,087 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50 WrapperNode [2024-06-27 18:38:50,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:38:50,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:38:50,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:38:50,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:38:50,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,154 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2024-06-27 18:38:50,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:38:50,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:38:50,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:38:50,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:38:50,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,186 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 18:38:50,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:38:50,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:38:50,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:38:50,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:38:50,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (1/1) ... [2024-06-27 18:38:50,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:38:50,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:38:50,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 18:38:50,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 18:38:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:38:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:38:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:38:50,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:38:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:38:50,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:38:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 18:38:50,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 18:38:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 18:38:50,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 18:38:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:38:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:38:50,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:38:50,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:38:50,310 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:38:50,448 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:38:50,450 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:38:50,855 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:38:50,855 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:38:50,979 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:38:50,979 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:38:50,979 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:38:50 BoogieIcfgContainer [2024-06-27 18:38:50,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:38:50,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:38:50,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:38:50,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:38:50,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:38:49" (1/4) ... [2024-06-27 18:38:50,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c841e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:38:50, skipping insertion in model container [2024-06-27 18:38:50,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:38:49" (2/4) ... [2024-06-27 18:38:50,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c841e9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:38:50, skipping insertion in model container [2024-06-27 18:38:50,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:50" (3/4) ... [2024-06-27 18:38:50,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c841e9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:38:50, skipping insertion in model container [2024-06-27 18:38:50,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:38:50" (4/4) ... [2024-06-27 18:38:50,987 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2024-06-27 18:38:51,000 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:38:51,000 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-27 18:38:51,001 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:38:51,044 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:38:51,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 57 transitions, 130 flow [2024-06-27 18:38:51,108 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2024-06-27 18:38:51,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:38:51,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 53 events. 1/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2024-06-27 18:38:51,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 57 transitions, 130 flow [2024-06-27 18:38:51,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 53 transitions, 118 flow [2024-06-27 18:38:51,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:38:51,151 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2888d622, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:38:51,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-27 18:38:51,155 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:38:51,155 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 18:38:51,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:38:51,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:51,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:38:51,156 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:38:51,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash 360664208, now seen corresponding path program 1 times [2024-06-27 18:38:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:51,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630693602] [2024-06-27 18:38:51,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:51,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:38:51,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:51,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630693602] [2024-06-27 18:38:51,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630693602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:51,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:51,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:38:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019629440] [2024-06-27 18:38:51,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:51,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:38:51,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:52,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:38:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:38:52,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-06-27 18:38:52,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:38:52,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:52,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-06-27 18:38:52,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:54,469 INFO L124 PetriNetUnfolderBase]: 19082/27957 cut-off events. [2024-06-27 18:38:54,470 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2024-06-27 18:38:54,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53674 conditions, 27957 events. 19082/27957 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 192733 event pairs, 16324 based on Foata normal form. 721/26821 useless extension candidates. Maximal degree in co-relation 53661. Up to 25403 conditions per place. [2024-06-27 18:38:54,632 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 52 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2024-06-27 18:38:54,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 72 transitions, 281 flow [2024-06-27 18:38:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:38:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:38:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-06-27 18:38:54,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6900584795321637 [2024-06-27 18:38:54,643 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 118 flow. Second operand 3 states and 118 transitions. [2024-06-27 18:38:54,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 72 transitions, 281 flow [2024-06-27 18:38:54,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 274 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 18:38:54,648 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 158 flow [2024-06-27 18:38:54,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-06-27 18:38:54,651 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -1 predicate places. [2024-06-27 18:38:54,651 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 158 flow [2024-06-27 18:38:54,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:38:54,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:54,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:54,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:38:54,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:38:54,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:54,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1293519955, now seen corresponding path program 1 times [2024-06-27 18:38:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:54,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998971130] [2024-06-27 18:38:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:54,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:38:55,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:55,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998971130] [2024-06-27 18:38:55,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998971130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:55,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:55,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:38:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191219051] [2024-06-27 18:38:55,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:55,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:38:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:38:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:38:55,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-06-27 18:38:55,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:38:55,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:55,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-06-27 18:38:55,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:57,444 INFO L124 PetriNetUnfolderBase]: 22199/29648 cut-off events. [2024-06-27 18:38:57,445 INFO L125 PetriNetUnfolderBase]: For 4477/4477 co-relation queries the response was YES. [2024-06-27 18:38:57,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66849 conditions, 29648 events. 22199/29648 cut-off events. For 4477/4477 co-relation queries the response was YES. Maximal size of possible extension queue 1175. Compared 174346 event pairs, 13067 based on Foata normal form. 4/28672 useless extension candidates. Maximal degree in co-relation 66837. Up to 29445 conditions per place. [2024-06-27 18:38:57,581 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 68 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2024-06-27 18:38:57,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 406 flow [2024-06-27 18:38:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:38:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:38:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2024-06-27 18:38:57,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6622807017543859 [2024-06-27 18:38:57,587 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 158 flow. Second operand 4 states and 151 transitions. [2024-06-27 18:38:57,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 406 flow [2024-06-27 18:38:57,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:38:57,591 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 216 flow [2024-06-27 18:38:57,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-06-27 18:38:57,592 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 2 predicate places. [2024-06-27 18:38:57,594 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 216 flow [2024-06-27 18:38:57,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:38:57,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:57,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:57,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:38:57,601 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:38:57,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1444411723, now seen corresponding path program 1 times [2024-06-27 18:38:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:57,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704107138] [2024-06-27 18:38:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:38:58,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:58,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704107138] [2024-06-27 18:38:58,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704107138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:58,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:58,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:38:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562476233] [2024-06-27 18:38:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:58,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:38:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:38:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:38:58,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-06-27 18:38:58,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:38:58,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:58,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-06-27 18:38:58,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:00,564 INFO L124 PetriNetUnfolderBase]: 22244/29704 cut-off events. [2024-06-27 18:39:00,564 INFO L125 PetriNetUnfolderBase]: For 12501/12501 co-relation queries the response was YES. [2024-06-27 18:39:00,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74377 conditions, 29704 events. 22244/29704 cut-off events. For 12501/12501 co-relation queries the response was YES. Maximal size of possible extension queue 1175. Compared 175058 event pairs, 9884 based on Foata normal form. 7/28720 useless extension candidates. Maximal degree in co-relation 74363. Up to 29343 conditions per place. [2024-06-27 18:39:00,727 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 91 selfloop transitions, 26 changer transitions 0/130 dead transitions. [2024-06-27 18:39:00,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 130 transitions, 672 flow [2024-06-27 18:39:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:39:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:39:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2024-06-27 18:39:00,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6947368421052632 [2024-06-27 18:39:00,729 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 216 flow. Second operand 5 states and 198 transitions. [2024-06-27 18:39:00,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 130 transitions, 672 flow [2024-06-27 18:39:00,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 130 transitions, 648 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 18:39:00,738 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 377 flow [2024-06-27 18:39:00,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2024-06-27 18:39:00,739 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 7 predicate places. [2024-06-27 18:39:00,739 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 377 flow [2024-06-27 18:39:00,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:00,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:00,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:00,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:39:00,740 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:39:00,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1773812978, now seen corresponding path program 1 times [2024-06-27 18:39:00,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:00,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670745104] [2024-06-27 18:39:00,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:00,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:39:01,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:01,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670745104] [2024-06-27 18:39:01,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670745104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:01,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:01,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:39:01,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672136758] [2024-06-27 18:39:01,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:01,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:39:01,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:01,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:39:01,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:39:01,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-06-27 18:39:01,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:01,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:01,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-06-27 18:39:01,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:03,841 INFO L124 PetriNetUnfolderBase]: 22578/30158 cut-off events. [2024-06-27 18:39:03,841 INFO L125 PetriNetUnfolderBase]: For 31562/31591 co-relation queries the response was YES. [2024-06-27 18:39:03,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88350 conditions, 30158 events. 22578/30158 cut-off events. For 31562/31591 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 177803 event pairs, 7666 based on Foata normal form. 58/29163 useless extension candidates. Maximal degree in co-relation 88333. Up to 29447 conditions per place. [2024-06-27 18:39:04,055 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 106 selfloop transitions, 30 changer transitions 0/149 dead transitions. [2024-06-27 18:39:04,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 149 transitions, 869 flow [2024-06-27 18:39:04,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:39:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:39:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-06-27 18:39:04,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2024-06-27 18:39:04,057 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 377 flow. Second operand 6 states and 234 transitions. [2024-06-27 18:39:04,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 149 transitions, 869 flow [2024-06-27 18:39:04,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 149 transitions, 853 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-06-27 18:39:04,074 INFO L231 Difference]: Finished difference. Result has 77 places, 82 transitions, 465 flow [2024-06-27 18:39:04,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2024-06-27 18:39:04,076 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 12 predicate places. [2024-06-27 18:39:04,076 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 465 flow [2024-06-27 18:39:04,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:04,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:04,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:04,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:39:04,077 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:39:04,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1081294257, now seen corresponding path program 1 times [2024-06-27 18:39:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955921816] [2024-06-27 18:39:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:39:04,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:04,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955921816] [2024-06-27 18:39:04,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955921816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:04,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:04,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:39:04,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449631983] [2024-06-27 18:39:04,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:04,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:39:04,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:04,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:39:04,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:39:04,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-27 18:39:04,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:04,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:04,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-27 18:39:04,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:07,124 INFO L124 PetriNetUnfolderBase]: 21795/29971 cut-off events. [2024-06-27 18:39:07,124 INFO L125 PetriNetUnfolderBase]: For 43333/43373 co-relation queries the response was YES. [2024-06-27 18:39:07,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93482 conditions, 29971 events. 21795/29971 cut-off events. For 43333/43373 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 184996 event pairs, 8713 based on Foata normal form. 3/28803 useless extension candidates. Maximal degree in co-relation 93461. Up to 28942 conditions per place. [2024-06-27 18:39:07,318 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 87 selfloop transitions, 12 changer transitions 0/111 dead transitions. [2024-06-27 18:39:07,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 731 flow [2024-06-27 18:39:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:39:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:39:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-06-27 18:39:07,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5649122807017544 [2024-06-27 18:39:07,320 INFO L175 Difference]: Start difference. First operand has 77 places, 82 transitions, 465 flow. Second operand 5 states and 161 transitions. [2024-06-27 18:39:07,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 731 flow [2024-06-27 18:39:07,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 653 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 18:39:07,337 INFO L231 Difference]: Finished difference. Result has 78 places, 82 transitions, 423 flow [2024-06-27 18:39:07,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2024-06-27 18:39:07,338 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 13 predicate places. [2024-06-27 18:39:07,338 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 423 flow [2024-06-27 18:39:07,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:07,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:07,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:07,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:39:07,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:39:07,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1633615724, now seen corresponding path program 1 times [2024-06-27 18:39:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:07,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614270571] [2024-06-27 18:39:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:39:07,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614270571] [2024-06-27 18:39:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614270571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:07,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:07,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:39:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240105276] [2024-06-27 18:39:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:07,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:39:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:39:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:39:08,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-27 18:39:08,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 423 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:08,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:08,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-27 18:39:08,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:10,893 INFO L124 PetriNetUnfolderBase]: 25373/33818 cut-off events. [2024-06-27 18:39:10,893 INFO L125 PetriNetUnfolderBase]: For 54124/54156 co-relation queries the response was YES. [2024-06-27 18:39:10,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105509 conditions, 33818 events. 25373/33818 cut-off events. For 54124/54156 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 199331 event pairs, 10254 based on Foata normal form. 36/32677 useless extension candidates. Maximal degree in co-relation 105486. Up to 33417 conditions per place. [2024-06-27 18:39:11,367 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 93 selfloop transitions, 31 changer transitions 0/135 dead transitions. [2024-06-27 18:39:11,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 135 transitions, 853 flow [2024-06-27 18:39:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:39:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:39:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2024-06-27 18:39:11,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5847953216374269 [2024-06-27 18:39:11,369 INFO L175 Difference]: Start difference. First operand has 78 places, 82 transitions, 423 flow. Second operand 6 states and 200 transitions. [2024-06-27 18:39:11,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 135 transitions, 853 flow [2024-06-27 18:39:11,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 135 transitions, 817 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 18:39:11,387 INFO L231 Difference]: Finished difference. Result has 80 places, 87 transitions, 505 flow [2024-06-27 18:39:11,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=505, PETRI_PLACES=80, PETRI_TRANSITIONS=87} [2024-06-27 18:39:11,388 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 15 predicate places. [2024-06-27 18:39:11,388 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 505 flow [2024-06-27 18:39:11,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:11,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:11,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:11,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:39:11,389 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:39:11,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:11,390 INFO L85 PathProgramCache]: Analyzing trace with hash -258250352, now seen corresponding path program 2 times [2024-06-27 18:39:11,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:11,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867430309] [2024-06-27 18:39:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:39:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867430309] [2024-06-27 18:39:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867430309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:12,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:39:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457649155] [2024-06-27 18:39:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:12,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:39:12,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:12,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:39:12,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:39:12,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-27 18:39:12,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 505 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:12,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:12,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-27 18:39:12,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:15,215 INFO L124 PetriNetUnfolderBase]: 25318/33743 cut-off events. [2024-06-27 18:39:15,215 INFO L125 PetriNetUnfolderBase]: For 59596/59630 co-relation queries the response was YES. [2024-06-27 18:39:15,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106545 conditions, 33743 events. 25318/33743 cut-off events. For 59596/59630 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 198910 event pairs, 10280 based on Foata normal form. 35/32603 useless extension candidates. Maximal degree in co-relation 106522. Up to 33338 conditions per place. [2024-06-27 18:39:15,408 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 86 selfloop transitions, 32 changer transitions 0/129 dead transitions. [2024-06-27 18:39:15,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 129 transitions, 839 flow [2024-06-27 18:39:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:39:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:39:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-06-27 18:39:15,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5701754385964912 [2024-06-27 18:39:15,410 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 505 flow. Second operand 6 states and 195 transitions. [2024-06-27 18:39:15,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 129 transitions, 839 flow [2024-06-27 18:39:15,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 129 transitions, 782 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 18:39:15,430 INFO L231 Difference]: Finished difference. Result has 83 places, 87 transitions, 524 flow [2024-06-27 18:39:15,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=83, PETRI_TRANSITIONS=87} [2024-06-27 18:39:15,432 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 18 predicate places. [2024-06-27 18:39:15,432 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 524 flow [2024-06-27 18:39:15,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:15,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:15,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:15,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:39:15,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:39:15,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1364341864, now seen corresponding path program 1 times [2024-06-27 18:39:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670567726] [2024-06-27 18:39:15,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:39:16,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:16,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670567726] [2024-06-27 18:39:16,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670567726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:16,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:16,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:39:16,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465450249] [2024-06-27 18:39:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:16,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:39:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:16,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:39:16,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:39:16,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-27 18:39:16,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 524 flow. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:16,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:16,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-27 18:39:16,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:19,795 INFO L124 PetriNetUnfolderBase]: 27727/37454 cut-off events. [2024-06-27 18:39:19,795 INFO L125 PetriNetUnfolderBase]: For 68959/68959 co-relation queries the response was YES. [2024-06-27 18:39:19,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117392 conditions, 37454 events. 27727/37454 cut-off events. For 68959/68959 co-relation queries the response was YES. Maximal size of possible extension queue 1272. Compared 224280 event pairs, 11175 based on Foata normal form. 6/36007 useless extension candidates. Maximal degree in co-relation 117368. Up to 36575 conditions per place. [2024-06-27 18:39:20,030 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 120 selfloop transitions, 21 changer transitions 0/152 dead transitions. [2024-06-27 18:39:20,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 152 transitions, 1009 flow [2024-06-27 18:39:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:39:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:39:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2024-06-27 18:39:20,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5588972431077694 [2024-06-27 18:39:20,032 INFO L175 Difference]: Start difference. First operand has 83 places, 87 transitions, 524 flow. Second operand 7 states and 223 transitions. [2024-06-27 18:39:20,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 152 transitions, 1009 flow [2024-06-27 18:39:20,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 152 transitions, 897 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 18:39:20,085 INFO L231 Difference]: Finished difference. Result has 85 places, 96 transitions, 554 flow [2024-06-27 18:39:20,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=554, PETRI_PLACES=85, PETRI_TRANSITIONS=96} [2024-06-27 18:39:20,086 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 20 predicate places. [2024-06-27 18:39:20,086 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 96 transitions, 554 flow [2024-06-27 18:39:20,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:20,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:20,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:20,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:39:20,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:39:20,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash -17093629, now seen corresponding path program 1 times [2024-06-27 18:39:20,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:20,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957595919] [2024-06-27 18:39:20,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:39:20,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:20,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957595919] [2024-06-27 18:39:20,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957595919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:20,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:20,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:39:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976787691] [2024-06-27 18:39:20,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:20,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:39:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:20,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:39:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:39:20,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-27 18:39:20,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 96 transitions, 554 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:20,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:20,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-27 18:39:20,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:24,098 INFO L124 PetriNetUnfolderBase]: 27719/38028 cut-off events. [2024-06-27 18:39:24,098 INFO L125 PetriNetUnfolderBase]: For 83791/83791 co-relation queries the response was YES. [2024-06-27 18:39:24,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125722 conditions, 38028 events. 27719/38028 cut-off events. For 83791/83791 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 231764 event pairs, 11461 based on Foata normal form. 2/36578 useless extension candidates. Maximal degree in co-relation 125696. Up to 36652 conditions per place. [2024-06-27 18:39:24,325 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 104 selfloop transitions, 12 changer transitions 0/127 dead transitions. [2024-06-27 18:39:24,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 127 transitions, 890 flow [2024-06-27 18:39:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:39:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:39:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-27 18:39:24,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5368421052631579 [2024-06-27 18:39:24,326 INFO L175 Difference]: Start difference. First operand has 85 places, 96 transitions, 554 flow. Second operand 5 states and 153 transitions. [2024-06-27 18:39:24,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 127 transitions, 890 flow [2024-06-27 18:39:24,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 127 transitions, 827 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 18:39:24,378 INFO L231 Difference]: Finished difference. Result has 86 places, 101 transitions, 579 flow [2024-06-27 18:39:24,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=579, PETRI_PLACES=86, PETRI_TRANSITIONS=101} [2024-06-27 18:39:24,379 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 21 predicate places. [2024-06-27 18:39:24,379 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 101 transitions, 579 flow [2024-06-27 18:39:24,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:24,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:24,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:24,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:39:24,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:39:24,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash -529900129, now seen corresponding path program 1 times [2024-06-27 18:39:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:24,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45866911] [2024-06-27 18:39:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:24,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:39:25,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:25,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45866911] [2024-06-27 18:39:25,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45866911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:25,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:25,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:39:25,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287611212] [2024-06-27 18:39:25,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:25,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:39:25,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:25,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:39:25,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:39:25,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-27 18:39:25,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 101 transitions, 579 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:25,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:25,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-27 18:39:25,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:28,810 INFO L124 PetriNetUnfolderBase]: 27703/40404 cut-off events. [2024-06-27 18:39:28,811 INFO L125 PetriNetUnfolderBase]: For 114161/114161 co-relation queries the response was YES. [2024-06-27 18:39:28,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135876 conditions, 40404 events. 27703/40404 cut-off events. For 114161/114161 co-relation queries the response was YES. Maximal size of possible extension queue 1424. Compared 276821 event pairs, 14060 based on Foata normal form. 4/38045 useless extension candidates. Maximal degree in co-relation 135849. Up to 36611 conditions per place. [2024-06-27 18:39:29,095 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 116 selfloop transitions, 20 changer transitions 0/147 dead transitions. [2024-06-27 18:39:29,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 147 transitions, 1078 flow [2024-06-27 18:39:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:39:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:39:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2024-06-27 18:39:29,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52046783625731 [2024-06-27 18:39:29,097 INFO L175 Difference]: Start difference. First operand has 86 places, 101 transitions, 579 flow. Second operand 6 states and 178 transitions. [2024-06-27 18:39:29,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 147 transitions, 1078 flow [2024-06-27 18:39:29,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 978 flow, removed 34 selfloop flow, removed 3 redundant places. [2024-06-27 18:39:29,150 INFO L231 Difference]: Finished difference. Result has 91 places, 119 transitions, 737 flow [2024-06-27 18:39:29,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=737, PETRI_PLACES=91, PETRI_TRANSITIONS=119} [2024-06-27 18:39:29,150 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 26 predicate places. [2024-06-27 18:39:29,150 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 119 transitions, 737 flow [2024-06-27 18:39:29,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:29,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:29,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:29,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:39:29,151 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 18:39:29,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash -531762352, now seen corresponding path program 1 times [2024-06-27 18:39:29,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:29,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113400559] [2024-06-27 18:39:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:29,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:39:29,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113400559] [2024-06-27 18:39:29,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113400559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:29,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:29,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:39:29,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486340606] [2024-06-27 18:39:29,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:29,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:39:29,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:29,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:39:29,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:39:29,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2024-06-27 18:39:29,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 119 transitions, 737 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:39:29,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:29,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2024-06-27 18:39:29,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:30,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L797-->L809: Formula: (and (= v_~z$r_buff0_thd3~0_81 v_~z$r_buff1_thd3~0_69) (= v_~z$r_buff0_thd2~0_63 v_~z$r_buff1_thd2~0_53) (= v_~z$w_buff0~0_126 2) (= v_~z$w_buff0_used~0_152 v_~z$w_buff1_used~0_124) (not (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) (not (= (mod v_~z$w_buff0_used~0_151 256) 0)))) 1 0) 0)) (= v_~z$r_buff0_thd1~0_61 v_~z$r_buff1_thd1~0_53) (= v_~z$r_buff0_thd0~0_105 v_~z$r_buff1_thd0~0_109) (= v_~z$r_buff0_thd4~0_65 v_~z$r_buff1_thd4~0_57) (= v_~z$w_buff0_used~0_151 1) (= v_~z$r_buff0_thd4~0_64 1) (= v_~z$w_buff0~0_127 v_~z$w_buff1~0_111)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_152, ~z$w_buff0~0=v_~z$w_buff0~0_127, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_65, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_81, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_63} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_151, ~z$w_buff0~0=v_~z$w_buff0~0_126, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_69, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_111, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, P3Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_105, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_109, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_53, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_64, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_81, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1][71], [P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, 24#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 54#L809true, 81#true, Black: 79#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 61#L772true, Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 142#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 49#L752true, Black: 85#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 94#(and (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 37#L792true, 162#true, Black: 105#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 178#true]) [2024-06-27 18:39:30,141 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-27 18:39:30,141 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:39:30,141 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:39:30,141 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:39:30,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L797-->L809: Formula: (and (= v_~z$r_buff0_thd3~0_81 v_~z$r_buff1_thd3~0_69) (= v_~z$r_buff0_thd2~0_63 v_~z$r_buff1_thd2~0_53) (= v_~z$w_buff0~0_126 2) (= v_~z$w_buff0_used~0_152 v_~z$w_buff1_used~0_124) (not (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) (not (= (mod v_~z$w_buff0_used~0_151 256) 0)))) 1 0) 0)) (= v_~z$r_buff0_thd1~0_61 v_~z$r_buff1_thd1~0_53) (= v_~z$r_buff0_thd0~0_105 v_~z$r_buff1_thd0~0_109) (= v_~z$r_buff0_thd4~0_65 v_~z$r_buff1_thd4~0_57) (= v_~z$w_buff0_used~0_151 1) (= v_~z$r_buff0_thd4~0_64 1) (= v_~z$w_buff0~0_127 v_~z$w_buff1~0_111)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_152, ~z$w_buff0~0=v_~z$w_buff0~0_127, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_65, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_81, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_63} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_151, ~z$w_buff0~0=v_~z$w_buff0~0_126, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_69, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_111, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, P3Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_105, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_109, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_53, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_64, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_81, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1][71], [P0Thread1of1ForFork2InUse, 24#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, P2Thread1of1ForFork3InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 133#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~a~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 54#L809true, 81#true, Black: 79#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 146#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 61#L772true, Black: 142#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 83#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 49#L752true, Black: 85#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 84#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 58#P2EXITtrue, Black: 94#(and (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p3_EAX~0 0) (= ~a~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 162#true, Black: 105#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~a~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 119#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~__unbuffered_p3_EAX~0 0) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= 2 ~x~0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~a~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 178#true]) [2024-06-27 18:39:30,145 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:39:30,145 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:39:30,146 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:39:30,146 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event