./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix006.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/mix006.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix006.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 23:13:13,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:13:13,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:13:13,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:13:13,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:13:13,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:13:13,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:13:13,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:13:13,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:13:13,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:13:13,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:13:13,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:13:13,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:13:13,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:13:13,404 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:13:13,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:13:13,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:13:13,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:13:13,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:13:13,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:13:13,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:13:13,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:13:13,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:13:13,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:13:13,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:13:13,408 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:13:13,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:13:13,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:13:13,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:13:13,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:13:13,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:13:13,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:13:13,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:13:13,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:13:13,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:13:13,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:13:13,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:13:13,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:13:13,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:13:13,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:13:13,412 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:13:13,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:13:13,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:13:13,413 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-27 23:13:13,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:13:13,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:13:13,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:13:13,707 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:13:13,708 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:13:13,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix006.opt.yml/witness.yml [2024-06-27 23:13:13,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:13:13,828 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:13:13,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2024-06-27 23:13:14,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:13:15,276 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:13:15,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2024-06-27 23:13:15,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea2db960/37ad0d64f64c4b70a24724aad3b882ea/FLAGfefcace0d [2024-06-27 23:13:15,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea2db960/37ad0d64f64c4b70a24724aad3b882ea [2024-06-27 23:13:15,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:13:15,316 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:13:15,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:13:15,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:13:15,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:13:15,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:13:13" (1/2) ... [2024-06-27 23:13:15,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f26581 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:13:15, skipping insertion in model container [2024-06-27 23:13:15,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:13:13" (1/2) ... [2024-06-27 23:13:15,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3788db03 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:13:15, skipping insertion in model container [2024-06-27 23:13:15,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:13:15" (2/2) ... [2024-06-27 23:13:15,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f26581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:15, skipping insertion in model container [2024-06-27 23:13:15,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:13:15" (2/2) ... [2024-06-27 23:13:15,330 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:13:15,361 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:13:15,362 INFO L97 edCorrectnessWitness]: Location invariant before [L852-L852] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 23:13:15,363 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 23:13:15,363 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 23:13:15,363 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:13:15,363 INFO L106 edCorrectnessWitness]: ghost_update [L847-L847] multithreaded = 1; [2024-06-27 23:13:15,412 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:13:15,754 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:13:15,765 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 23:13:15,966 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:13:16,016 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:13:16,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16 WrapperNode [2024-06-27 23:13:16,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:13:16,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:13:16,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:13:16,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:13:16,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,104 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2024-06-27 23:13:16,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:13:16,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:13:16,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:13:16,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:13:16,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,141 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 23:13:16,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:13:16,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:13:16,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:13:16,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:13:16,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (1/1) ... [2024-06-27 23:13:16,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:13:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:13:16,201 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 23:13:16,232 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 23:13:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:13:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:13:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:13:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:13:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:13:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:13:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:13:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:13:16,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:13:16,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:13:16,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:13:16,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:13:16,256 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 23:13:16,389 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:13:16,391 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:13:16,914 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:13:16,914 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:13:17,097 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:13:17,097 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:13:17,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:13:17 BoogieIcfgContainer [2024-06-27 23:13:17,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:13:17,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:13:17,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:13:17,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:13:17,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:13:13" (1/4) ... [2024-06-27 23:13:17,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469f7e65 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:13:17, skipping insertion in model container [2024-06-27 23:13:17,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:13:15" (2/4) ... [2024-06-27 23:13:17,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469f7e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:13:17, skipping insertion in model container [2024-06-27 23:13:17,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:13:16" (3/4) ... [2024-06-27 23:13:17,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469f7e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:13:17, skipping insertion in model container [2024-06-27 23:13:17,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:13:17" (4/4) ... [2024-06-27 23:13:17,108 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2024-06-27 23:13:17,124 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:13:17,124 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 23:13:17,125 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:13:17,181 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:13:17,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-27 23:13:17,245 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-27 23:13:17,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:13:17,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:13:17,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-27 23:13:17,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-27 23:13:17,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:13:17,273 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;@3dce5565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:13:17,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 23:13:17,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:13:17,279 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:13:17,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:13:17,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:17,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:13:17,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:17,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:17,288 INFO L85 PathProgramCache]: Analyzing trace with hash 398955286, now seen corresponding path program 1 times [2024-06-27 23:13:17,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:17,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543468148] [2024-06-27 23:13:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:17,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:18,497 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 23:13:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543468148] [2024-06-27 23:13:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543468148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:18,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:13:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902848210] [2024-06-27 23:13:18,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:18,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:13:18,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:18,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:13:18,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:13:18,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-06-27 23:13:18,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 23:13:18,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:18,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-06-27 23:13:18,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:19,063 INFO L124 PetriNetUnfolderBase]: 1116/1776 cut-off events. [2024-06-27 23:13:19,064 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-27 23:13:19,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 1776 events. 1116/1776 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8974 event pairs, 765 based on Foata normal form. 1/1713 useless extension candidates. Maximal degree in co-relation 3515. Up to 1676 conditions per place. [2024-06-27 23:13:19,078 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 31 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-27 23:13:19,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 171 flow [2024-06-27 23:13:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:13:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:13:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-27 23:13:19,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2024-06-27 23:13:19,092 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 80 transitions. [2024-06-27 23:13:19,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 171 flow [2024-06-27 23:13:19,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 23:13:19,098 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-27 23:13:19,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-27 23:13:19,103 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-27 23:13:19,103 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-27 23:13:19,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 23:13:19,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:19,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:19,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:13:19,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:19,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1144019377, now seen corresponding path program 1 times [2024-06-27 23:13:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452405009] [2024-06-27 23:13:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:19,912 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 23:13:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:19,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452405009] [2024-06-27 23:13:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452405009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:19,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:13:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975052096] [2024-06-27 23:13:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:19,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:13:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:19,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:13:19,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:13:19,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-27 23:13:19,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 23:13:19,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:19,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-27 23:13:19,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:20,391 INFO L124 PetriNetUnfolderBase]: 1280/1982 cut-off events. [2024-06-27 23:13:20,391 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2024-06-27 23:13:20,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4503 conditions, 1982 events. 1280/1982 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9782 event pairs, 750 based on Foata normal form. 3/1979 useless extension candidates. Maximal degree in co-relation 4491. Up to 1897 conditions per place. [2024-06-27 23:13:20,402 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 39 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-27 23:13:20,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 240 flow [2024-06-27 23:13:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:13:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:13:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-27 23:13:20,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6011904761904762 [2024-06-27 23:13:20,404 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 101 transitions. [2024-06-27 23:13:20,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 240 flow [2024-06-27 23:13:20,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:13:20,406 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-27 23:13:20,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-27 23:13:20,407 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-27 23:13:20,408 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-27 23:13:20,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 23:13:20,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:20,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:20,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:13:20,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:20,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:20,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1104863043, now seen corresponding path program 1 times [2024-06-27 23:13:20,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547399720] [2024-06-27 23:13:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:21,205 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 23:13:21,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:21,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547399720] [2024-06-27 23:13:21,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547399720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:21,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:21,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:13:21,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802548340] [2024-06-27 23:13:21,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:21,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:13:21,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:21,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:13:21,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:13:21,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-27 23:13:21,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 23:13:21,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:21,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-27 23:13:21,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:21,682 INFO L124 PetriNetUnfolderBase]: 1568/2406 cut-off events. [2024-06-27 23:13:21,682 INFO L125 PetriNetUnfolderBase]: For 1364/1364 co-relation queries the response was YES. [2024-06-27 23:13:21,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6039 conditions, 2406 events. 1568/2406 cut-off events. For 1364/1364 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11887 event pairs, 669 based on Foata normal form. 5/2408 useless extension candidates. Maximal degree in co-relation 6025. Up to 2248 conditions per place. [2024-06-27 23:13:21,699 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 53 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2024-06-27 23:13:21,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 396 flow [2024-06-27 23:13:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:13:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:13:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-06-27 23:13:21,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2024-06-27 23:13:21,706 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 128 transitions. [2024-06-27 23:13:21,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 396 flow [2024-06-27 23:13:21,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 382 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 23:13:21,710 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 237 flow [2024-06-27 23:13:21,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2024-06-27 23:13:21,712 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-27 23:13:21,712 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 237 flow [2024-06-27 23:13:21,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 23:13:21,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:21,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:21,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:13:21,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:21,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash -801262658, now seen corresponding path program 1 times [2024-06-27 23:13:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:21,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715432016] [2024-06-27 23:13:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:21,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:22,704 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 23:13:22,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715432016] [2024-06-27 23:13:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715432016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:22,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:22,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:13:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814961837] [2024-06-27 23:13:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:22,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:13:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:13:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:13:22,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-27 23:13:22,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 23:13:22,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:22,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-27 23:13:22,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:23,282 INFO L124 PetriNetUnfolderBase]: 1580/2426 cut-off events. [2024-06-27 23:13:23,282 INFO L125 PetriNetUnfolderBase]: For 3226/3228 co-relation queries the response was YES. [2024-06-27 23:13:23,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7183 conditions, 2426 events. 1580/2426 cut-off events. For 3226/3228 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12009 event pairs, 481 based on Foata normal form. 12/2435 useless extension candidates. Maximal degree in co-relation 7166. Up to 2216 conditions per place. [2024-06-27 23:13:23,298 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 57 selfloop transitions, 19 changer transitions 0/82 dead transitions. [2024-06-27 23:13:23,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 499 flow [2024-06-27 23:13:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:13:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:13:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-27 23:13:23,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-27 23:13:23,301 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 237 flow. Second operand 6 states and 147 transitions. [2024-06-27 23:13:23,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 499 flow [2024-06-27 23:13:23,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 491 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 23:13:23,306 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 293 flow [2024-06-27 23:13:23,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-06-27 23:13:23,307 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2024-06-27 23:13:23,307 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 293 flow [2024-06-27 23:13:23,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 23:13:23,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:23,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:23,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:13:23,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:23,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:23,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1011703320, now seen corresponding path program 1 times [2024-06-27 23:13:23,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:23,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949791684] [2024-06-27 23:13:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:23,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:24,345 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 23:13:24,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:24,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949791684] [2024-06-27 23:13:24,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949791684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:24,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:13:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717313094] [2024-06-27 23:13:24,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:24,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:13:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:13:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:13:24,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:24,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:24,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:24,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:24,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:25,011 INFO L124 PetriNetUnfolderBase]: 1575/2424 cut-off events. [2024-06-27 23:13:25,012 INFO L125 PetriNetUnfolderBase]: For 5200/5200 co-relation queries the response was YES. [2024-06-27 23:13:25,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7792 conditions, 2424 events. 1575/2424 cut-off events. For 5200/5200 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12126 event pairs, 921 based on Foata normal form. 2/2419 useless extension candidates. Maximal degree in co-relation 7771. Up to 2333 conditions per place. [2024-06-27 23:13:25,030 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 49 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-27 23:13:25,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 451 flow [2024-06-27 23:13:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:13:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:13:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-06-27 23:13:25,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-27 23:13:25,032 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 293 flow. Second operand 5 states and 97 transitions. [2024-06-27 23:13:25,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 451 flow [2024-06-27 23:13:25,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 399 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 23:13:25,041 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 290 flow [2024-06-27 23:13:25,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-06-27 23:13:25,043 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-06-27 23:13:25,044 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 290 flow [2024-06-27 23:13:25,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:25,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:25,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:25,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:13:25,049 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:25,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1325736148, now seen corresponding path program 1 times [2024-06-27 23:13:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:25,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924518481] [2024-06-27 23:13:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:26,361 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 23:13:26,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:26,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924518481] [2024-06-27 23:13:26,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924518481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:26,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:26,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:13:26,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771075640] [2024-06-27 23:13:26,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:26,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:13:26,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:26,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:13:26,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:13:26,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:26,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:26,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:26,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:26,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:27,119 INFO L124 PetriNetUnfolderBase]: 1565/2412 cut-off events. [2024-06-27 23:13:27,120 INFO L125 PetriNetUnfolderBase]: For 5872/5872 co-relation queries the response was YES. [2024-06-27 23:13:27,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7816 conditions, 2412 events. 1565/2412 cut-off events. For 5872/5872 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12003 event pairs, 879 based on Foata normal form. 4/2414 useless extension candidates. Maximal degree in co-relation 7791. Up to 2301 conditions per place. [2024-06-27 23:13:27,144 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 54 selfloop transitions, 13 changer transitions 0/72 dead transitions. [2024-06-27 23:13:27,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 480 flow [2024-06-27 23:13:27,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:13:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:13:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-27 23:13:27,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-27 23:13:27,146 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 290 flow. Second operand 6 states and 115 transitions. [2024-06-27 23:13:27,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 480 flow [2024-06-27 23:13:27,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 461 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 23:13:27,154 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 331 flow [2024-06-27 23:13:27,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-06-27 23:13:27,156 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-06-27 23:13:27,157 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 331 flow [2024-06-27 23:13:27,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:27,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:27,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:27,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:13:27,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:27,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 5555245, now seen corresponding path program 1 times [2024-06-27 23:13:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:27,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299525970] [2024-06-27 23:13:27,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:27,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:28,136 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 23:13:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299525970] [2024-06-27 23:13:28,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299525970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:28,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:13:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472147209] [2024-06-27 23:13:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:28,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:13:28,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:28,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:13:28,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:13:28,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:28,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:28,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:28,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:28,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:28,955 INFO L124 PetriNetUnfolderBase]: 1644/2509 cut-off events. [2024-06-27 23:13:28,955 INFO L125 PetriNetUnfolderBase]: For 7557/7561 co-relation queries the response was YES. [2024-06-27 23:13:28,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8846 conditions, 2509 events. 1644/2509 cut-off events. For 7557/7561 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12257 event pairs, 639 based on Foata normal form. 8/2516 useless extension candidates. Maximal degree in co-relation 8819. Up to 2313 conditions per place. [2024-06-27 23:13:28,976 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 62 selfloop transitions, 30 changer transitions 0/97 dead transitions. [2024-06-27 23:13:28,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 97 transitions, 713 flow [2024-06-27 23:13:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:13:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:13:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-27 23:13:28,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48639455782312924 [2024-06-27 23:13:28,979 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 331 flow. Second operand 7 states and 143 transitions. [2024-06-27 23:13:28,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 97 transitions, 713 flow [2024-06-27 23:13:28,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 683 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 23:13:28,987 INFO L231 Difference]: Finished difference. Result has 66 places, 72 transitions, 491 flow [2024-06-27 23:13:28,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=491, PETRI_PLACES=66, PETRI_TRANSITIONS=72} [2024-06-27 23:13:28,988 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2024-06-27 23:13:28,988 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 72 transitions, 491 flow [2024-06-27 23:13:28,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:28,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:28,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:28,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:13:28,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:28,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:28,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1846131877, now seen corresponding path program 2 times [2024-06-27 23:13:28,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:28,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633574311] [2024-06-27 23:13:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:30,199 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 23:13:30,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:30,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633574311] [2024-06-27 23:13:30,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633574311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:30,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:30,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:13:30,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346108826] [2024-06-27 23:13:30,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:30,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:13:30,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:30,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:13:30,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:13:30,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:30,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 72 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:30,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:30,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:30,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:30,982 INFO L124 PetriNetUnfolderBase]: 1689/2583 cut-off events. [2024-06-27 23:13:30,983 INFO L125 PetriNetUnfolderBase]: For 9628/9634 co-relation queries the response was YES. [2024-06-27 23:13:30,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9735 conditions, 2583 events. 1689/2583 cut-off events. For 9628/9634 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12672 event pairs, 652 based on Foata normal form. 12/2592 useless extension candidates. Maximal degree in co-relation 9705. Up to 2345 conditions per place. [2024-06-27 23:13:31,003 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 57 selfloop transitions, 44 changer transitions 0/106 dead transitions. [2024-06-27 23:13:31,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 939 flow [2024-06-27 23:13:31,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:13:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:13:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-06-27 23:13:31,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2024-06-27 23:13:31,007 INFO L175 Difference]: Start difference. First operand has 66 places, 72 transitions, 491 flow. Second operand 6 states and 125 transitions. [2024-06-27 23:13:31,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 939 flow [2024-06-27 23:13:31,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 883 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 23:13:31,017 INFO L231 Difference]: Finished difference. Result has 70 places, 88 transitions, 724 flow [2024-06-27 23:13:31,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=724, PETRI_PLACES=70, PETRI_TRANSITIONS=88} [2024-06-27 23:13:31,019 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2024-06-27 23:13:31,019 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 88 transitions, 724 flow [2024-06-27 23:13:31,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:31,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:31,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:31,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:13:31,020 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:31,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1584246969, now seen corresponding path program 3 times [2024-06-27 23:13:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:31,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971968431] [2024-06-27 23:13:31,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:32,230 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 23:13:32,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:32,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971968431] [2024-06-27 23:13:32,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971968431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:32,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:32,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:13:32,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515622152] [2024-06-27 23:13:32,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:32,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:13:32,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:13:32,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:13:32,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:32,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 88 transitions, 724 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:32,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:32,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:32,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:32,989 INFO L124 PetriNetUnfolderBase]: 1672/2546 cut-off events. [2024-06-27 23:13:32,990 INFO L125 PetriNetUnfolderBase]: For 11596/11598 co-relation queries the response was YES. [2024-06-27 23:13:32,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9954 conditions, 2546 events. 1672/2546 cut-off events. For 11596/11598 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12335 event pairs, 651 based on Foata normal form. 5/2548 useless extension candidates. Maximal degree in co-relation 9922. Up to 2324 conditions per place. [2024-06-27 23:13:33,011 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 51 selfloop transitions, 48 changer transitions 0/104 dead transitions. [2024-06-27 23:13:33,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 104 transitions, 980 flow [2024-06-27 23:13:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:13:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:13:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-27 23:13:33,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801587301587302 [2024-06-27 23:13:33,013 INFO L175 Difference]: Start difference. First operand has 70 places, 88 transitions, 724 flow. Second operand 6 states and 121 transitions. [2024-06-27 23:13:33,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 104 transitions, 980 flow [2024-06-27 23:13:33,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 104 transitions, 933 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-27 23:13:33,027 INFO L231 Difference]: Finished difference. Result has 75 places, 88 transitions, 783 flow [2024-06-27 23:13:33,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=75, PETRI_TRANSITIONS=88} [2024-06-27 23:13:33,029 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2024-06-27 23:13:33,029 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 88 transitions, 783 flow [2024-06-27 23:13:33,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:33,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:33,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:33,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:13:33,030 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:33,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1916351507, now seen corresponding path program 1 times [2024-06-27 23:13:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:33,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279665916] [2024-06-27 23:13:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:34,159 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 23:13:34,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:34,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279665916] [2024-06-27 23:13:34,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279665916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:34,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:34,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:13:34,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080700911] [2024-06-27 23:13:34,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:34,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:13:34,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:34,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:13:34,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:13:34,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:34,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 88 transitions, 783 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 23:13:34,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:34,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:34,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:34,973 INFO L124 PetriNetUnfolderBase]: 1768/2704 cut-off events. [2024-06-27 23:13:34,973 INFO L125 PetriNetUnfolderBase]: For 14665/14671 co-relation queries the response was YES. [2024-06-27 23:13:34,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10785 conditions, 2704 events. 1768/2704 cut-off events. For 14665/14671 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13367 event pairs, 564 based on Foata normal form. 11/2714 useless extension candidates. Maximal degree in co-relation 10750. Up to 2256 conditions per place. [2024-06-27 23:13:35,003 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 80 selfloop transitions, 51 changer transitions 0/136 dead transitions. [2024-06-27 23:13:35,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 136 transitions, 1324 flow [2024-06-27 23:13:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:13:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:13:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-27 23:13:35,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029761904761905 [2024-06-27 23:13:35,006 INFO L175 Difference]: Start difference. First operand has 75 places, 88 transitions, 783 flow. Second operand 8 states and 169 transitions. [2024-06-27 23:13:35,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 136 transitions, 1324 flow [2024-06-27 23:13:35,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 136 transitions, 1210 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 23:13:35,026 INFO L231 Difference]: Finished difference. Result has 80 places, 99 transitions, 888 flow [2024-06-27 23:13:35,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=888, PETRI_PLACES=80, PETRI_TRANSITIONS=99} [2024-06-27 23:13:35,028 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2024-06-27 23:13:35,028 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 99 transitions, 888 flow [2024-06-27 23:13:35,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 23:13:35,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:35,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:35,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:13:35,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:35,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash 341663667, now seen corresponding path program 2 times [2024-06-27 23:13:35,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:35,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494071779] [2024-06-27 23:13:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:36,413 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 23:13:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494071779] [2024-06-27 23:13:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494071779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:36,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:13:36,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600203640] [2024-06-27 23:13:36,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:36,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:13:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:36,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:13:36,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:13:36,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:36,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 99 transitions, 888 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 23:13:36,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:36,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:36,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:37,262 INFO L124 PetriNetUnfolderBase]: 1888/2908 cut-off events. [2024-06-27 23:13:37,263 INFO L125 PetriNetUnfolderBase]: For 19173/19177 co-relation queries the response was YES. [2024-06-27 23:13:37,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12490 conditions, 2908 events. 1888/2908 cut-off events. For 19173/19177 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14628 event pairs, 600 based on Foata normal form. 14/2919 useless extension candidates. Maximal degree in co-relation 12453. Up to 2342 conditions per place. [2024-06-27 23:13:37,294 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 73 selfloop transitions, 63 changer transitions 0/141 dead transitions. [2024-06-27 23:13:37,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 141 transitions, 1467 flow [2024-06-27 23:13:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:13:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:13:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-27 23:13:37,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-27 23:13:37,296 INFO L175 Difference]: Start difference. First operand has 80 places, 99 transitions, 888 flow. Second operand 7 states and 150 transitions. [2024-06-27 23:13:37,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 141 transitions, 1467 flow [2024-06-27 23:13:37,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 141 transitions, 1417 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-27 23:13:37,321 INFO L231 Difference]: Finished difference. Result has 85 places, 113 transitions, 1113 flow [2024-06-27 23:13:37,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1113, PETRI_PLACES=85, PETRI_TRANSITIONS=113} [2024-06-27 23:13:37,322 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2024-06-27 23:13:37,322 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 113 transitions, 1113 flow [2024-06-27 23:13:37,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 23:13:37,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:37,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:37,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:13:37,323 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:37,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:37,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1866777303, now seen corresponding path program 3 times [2024-06-27 23:13:37,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:37,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120185271] [2024-06-27 23:13:37,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:37,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:38,575 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 23:13:38,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:38,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120185271] [2024-06-27 23:13:38,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120185271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:38,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:38,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:13:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517950148] [2024-06-27 23:13:38,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:38,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:13:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:38,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:13:38,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:13:38,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:38,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 113 transitions, 1113 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 23:13:38,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:38,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:38,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:39,356 INFO L124 PetriNetUnfolderBase]: 1924/2948 cut-off events. [2024-06-27 23:13:39,356 INFO L125 PetriNetUnfolderBase]: For 23461/23463 co-relation queries the response was YES. [2024-06-27 23:13:39,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13447 conditions, 2948 events. 1924/2948 cut-off events. For 23461/23463 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 14741 event pairs, 580 based on Foata normal form. 8/2953 useless extension candidates. Maximal degree in co-relation 13407. Up to 2358 conditions per place. [2024-06-27 23:13:39,378 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 65 selfloop transitions, 81 changer transitions 0/151 dead transitions. [2024-06-27 23:13:39,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 151 transitions, 1713 flow [2024-06-27 23:13:39,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:13:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:13:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-27 23:13:39,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2024-06-27 23:13:39,380 INFO L175 Difference]: Start difference. First operand has 85 places, 113 transitions, 1113 flow. Second operand 7 states and 148 transitions. [2024-06-27 23:13:39,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 151 transitions, 1713 flow [2024-06-27 23:13:39,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 151 transitions, 1608 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 23:13:39,407 INFO L231 Difference]: Finished difference. Result has 89 places, 123 transitions, 1302 flow [2024-06-27 23:13:39,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1302, PETRI_PLACES=89, PETRI_TRANSITIONS=123} [2024-06-27 23:13:39,408 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2024-06-27 23:13:39,408 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 123 transitions, 1302 flow [2024-06-27 23:13:39,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 23:13:39,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:39,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:39,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:13:39,409 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:39,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:39,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1569078313, now seen corresponding path program 4 times [2024-06-27 23:13:39,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:39,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035211316] [2024-06-27 23:13:39,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:40,647 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 23:13:40,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035211316] [2024-06-27 23:13:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035211316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:40,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:40,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:13:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586773859] [2024-06-27 23:13:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:40,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:13:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:40,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:13:40,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:13:40,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:40,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 123 transitions, 1302 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 23:13:40,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:40,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:40,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:41,584 INFO L124 PetriNetUnfolderBase]: 1908/2924 cut-off events. [2024-06-27 23:13:41,584 INFO L125 PetriNetUnfolderBase]: For 27238/27240 co-relation queries the response was YES. [2024-06-27 23:13:41,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13665 conditions, 2924 events. 1908/2924 cut-off events. For 27238/27240 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 14632 event pairs, 577 based on Foata normal form. 8/2929 useless extension candidates. Maximal degree in co-relation 13623. Up to 2351 conditions per place. [2024-06-27 23:13:41,604 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 69 selfloop transitions, 77 changer transitions 0/151 dead transitions. [2024-06-27 23:13:41,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 151 transitions, 1750 flow [2024-06-27 23:13:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:13:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:13:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-06-27 23:13:41,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 23:13:41,609 INFO L175 Difference]: Start difference. First operand has 89 places, 123 transitions, 1302 flow. Second operand 7 states and 147 transitions. [2024-06-27 23:13:41,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 151 transitions, 1750 flow [2024-06-27 23:13:41,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 151 transitions, 1640 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-27 23:13:41,655 INFO L231 Difference]: Finished difference. Result has 93 places, 123 transitions, 1358 flow [2024-06-27 23:13:41,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1358, PETRI_PLACES=93, PETRI_TRANSITIONS=123} [2024-06-27 23:13:41,657 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2024-06-27 23:13:41,657 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 123 transitions, 1358 flow [2024-06-27 23:13:41,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 23:13:41,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:41,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:41,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:13:41,658 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:41,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash 787456522, now seen corresponding path program 1 times [2024-06-27 23:13:41,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:41,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017258496] [2024-06-27 23:13:41,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:41,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:42,769 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 23:13:42,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:42,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017258496] [2024-06-27 23:13:42,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017258496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:42,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:42,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:13:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244289876] [2024-06-27 23:13:42,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:42,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:13:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:13:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:13:42,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:13:42,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 123 transitions, 1358 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 23:13:42,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:42,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:13:42,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:43,275 INFO L124 PetriNetUnfolderBase]: 1800/2808 cut-off events. [2024-06-27 23:13:43,275 INFO L125 PetriNetUnfolderBase]: For 31787/31797 co-relation queries the response was YES. [2024-06-27 23:13:43,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13513 conditions, 2808 events. 1800/2808 cut-off events. For 31787/31797 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14617 event pairs, 847 based on Foata normal form. 6/2778 useless extension candidates. Maximal degree in co-relation 13469. Up to 2620 conditions per place. [2024-06-27 23:13:43,295 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 106 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2024-06-27 23:13:43,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 133 transitions, 1632 flow [2024-06-27 23:13:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:13:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:13:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-06-27 23:13:43,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-27 23:13:43,296 INFO L175 Difference]: Start difference. First operand has 93 places, 123 transitions, 1358 flow. Second operand 5 states and 97 transitions. [2024-06-27 23:13:43,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 133 transitions, 1632 flow [2024-06-27 23:13:43,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 133 transitions, 1433 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 23:13:43,332 INFO L231 Difference]: Finished difference. Result has 92 places, 126 transitions, 1211 flow [2024-06-27 23:13:43,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1211, PETRI_PLACES=92, PETRI_TRANSITIONS=126} [2024-06-27 23:13:43,334 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places. [2024-06-27 23:13:43,334 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 126 transitions, 1211 flow [2024-06-27 23:13:43,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 23:13:43,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:43,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:43,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:13:43,335 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:43,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:43,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1044612263, now seen corresponding path program 1 times [2024-06-27 23:13:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:43,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775903832] [2024-06-27 23:13:43,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:44,703 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 23:13:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:44,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775903832] [2024-06-27 23:13:44,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775903832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:44,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:44,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:13:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677272321] [2024-06-27 23:13:44,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:44,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:13:44,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:13:44,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:13:44,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:44,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 126 transitions, 1211 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 23:13:44,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:44,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:44,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:45,617 INFO L124 PetriNetUnfolderBase]: 1941/2997 cut-off events. [2024-06-27 23:13:45,617 INFO L125 PetriNetUnfolderBase]: For 31193/31197 co-relation queries the response was YES. [2024-06-27 23:13:45,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14147 conditions, 2997 events. 1941/2997 cut-off events. For 31193/31197 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15201 event pairs, 573 based on Foata normal form. 8/3004 useless extension candidates. Maximal degree in co-relation 14103. Up to 2379 conditions per place. [2024-06-27 23:13:45,638 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 92 selfloop transitions, 78 changer transitions 0/175 dead transitions. [2024-06-27 23:13:45,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 175 transitions, 1886 flow [2024-06-27 23:13:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:13:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:13:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-27 23:13:45,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947089947089947 [2024-06-27 23:13:45,641 INFO L175 Difference]: Start difference. First operand has 92 places, 126 transitions, 1211 flow. Second operand 9 states and 187 transitions. [2024-06-27 23:13:45,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 175 transitions, 1886 flow [2024-06-27 23:13:45,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 175 transitions, 1856 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 23:13:45,714 INFO L231 Difference]: Finished difference. Result has 98 places, 132 transitions, 1419 flow [2024-06-27 23:13:45,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1419, PETRI_PLACES=98, PETRI_TRANSITIONS=132} [2024-06-27 23:13:45,715 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2024-06-27 23:13:45,715 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 132 transitions, 1419 flow [2024-06-27 23:13:45,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 23:13:45,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:45,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:45,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:13:45,716 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:45,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:45,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1044409523, now seen corresponding path program 2 times [2024-06-27 23:13:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:45,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614403306] [2024-06-27 23:13:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:46,832 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 23:13:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:46,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614403306] [2024-06-27 23:13:46,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614403306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:46,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:46,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:13:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538587966] [2024-06-27 23:13:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:46,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:13:46,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:13:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:13:46,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:46,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 132 transitions, 1419 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:13:46,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:46,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:46,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:47,673 INFO L124 PetriNetUnfolderBase]: 1991/3095 cut-off events. [2024-06-27 23:13:47,673 INFO L125 PetriNetUnfolderBase]: For 37460/37468 co-relation queries the response was YES. [2024-06-27 23:13:47,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15262 conditions, 3095 events. 1991/3095 cut-off events. For 37460/37468 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15909 event pairs, 595 based on Foata normal form. 12/3106 useless extension candidates. Maximal degree in co-relation 15217. Up to 2420 conditions per place. [2024-06-27 23:13:47,698 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 88 selfloop transitions, 92 changer transitions 0/185 dead transitions. [2024-06-27 23:13:47,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 185 transitions, 2239 flow [2024-06-27 23:13:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:13:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:13:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-27 23:13:47,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2024-06-27 23:13:47,701 INFO L175 Difference]: Start difference. First operand has 98 places, 132 transitions, 1419 flow. Second operand 8 states and 171 transitions. [2024-06-27 23:13:47,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 185 transitions, 2239 flow [2024-06-27 23:13:47,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 185 transitions, 2029 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-27 23:13:47,748 INFO L231 Difference]: Finished difference. Result has 101 places, 151 transitions, 1734 flow [2024-06-27 23:13:47,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1734, PETRI_PLACES=101, PETRI_TRANSITIONS=151} [2024-06-27 23:13:47,749 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2024-06-27 23:13:47,750 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 151 transitions, 1734 flow [2024-06-27 23:13:47,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:13:47,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:47,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:47,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:13:47,751 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:47,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash 311277343, now seen corresponding path program 3 times [2024-06-27 23:13:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:47,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899790071] [2024-06-27 23:13:47,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:49,040 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 23:13:49,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:49,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899790071] [2024-06-27 23:13:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899790071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:49,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:13:49,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068269732] [2024-06-27 23:13:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:49,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:13:49,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:49,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:13:49,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:13:49,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:49,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 151 transitions, 1734 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:13:49,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:49,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:49,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:49,906 INFO L124 PetriNetUnfolderBase]: 2027/3158 cut-off events. [2024-06-27 23:13:49,906 INFO L125 PetriNetUnfolderBase]: For 41417/41421 co-relation queries the response was YES. [2024-06-27 23:13:49,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16134 conditions, 3158 events. 2027/3158 cut-off events. For 41417/41421 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16335 event pairs, 618 based on Foata normal form. 8/3163 useless extension candidates. Maximal degree in co-relation 16086. Up to 2452 conditions per place. [2024-06-27 23:13:49,928 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 78 selfloop transitions, 102 changer transitions 0/185 dead transitions. [2024-06-27 23:13:49,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 185 transitions, 2358 flow [2024-06-27 23:13:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:13:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:13:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-27 23:13:49,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-27 23:13:49,930 INFO L175 Difference]: Start difference. First operand has 101 places, 151 transitions, 1734 flow. Second operand 7 states and 150 transitions. [2024-06-27 23:13:49,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 185 transitions, 2358 flow [2024-06-27 23:13:49,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 185 transitions, 2215 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-27 23:13:49,978 INFO L231 Difference]: Finished difference. Result has 105 places, 159 transitions, 1971 flow [2024-06-27 23:13:49,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1971, PETRI_PLACES=105, PETRI_TRANSITIONS=159} [2024-06-27 23:13:49,978 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2024-06-27 23:13:49,979 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 159 transitions, 1971 flow [2024-06-27 23:13:49,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:13:49,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:49,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:49,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:13:49,979 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:49,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2001640229, now seen corresponding path program 4 times [2024-06-27 23:13:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036330841] [2024-06-27 23:13:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:51,355 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 23:13:51,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:51,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036330841] [2024-06-27 23:13:51,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036330841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:51,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:51,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:13:51,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905600108] [2024-06-27 23:13:51,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:51,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:13:51,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:51,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:13:51,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:13:51,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:51,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 159 transitions, 1971 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 23:13:51,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:51,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:51,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:52,373 INFO L124 PetriNetUnfolderBase]: 2077/3243 cut-off events. [2024-06-27 23:13:52,373 INFO L125 PetriNetUnfolderBase]: For 47766/47770 co-relation queries the response was YES. [2024-06-27 23:13:52,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17116 conditions, 3243 events. 2077/3243 cut-off events. For 47766/47770 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16911 event pairs, 620 based on Foata normal form. 10/3250 useless extension candidates. Maximal degree in co-relation 17066. Up to 2497 conditions per place. [2024-06-27 23:13:52,391 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 86 selfloop transitions, 105 changer transitions 0/196 dead transitions. [2024-06-27 23:13:52,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 196 transitions, 2654 flow [2024-06-27 23:13:52,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:13:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:13:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-06-27 23:13:52,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2024-06-27 23:13:52,393 INFO L175 Difference]: Start difference. First operand has 105 places, 159 transitions, 1971 flow. Second operand 8 states and 166 transitions. [2024-06-27 23:13:52,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 196 transitions, 2654 flow [2024-06-27 23:13:52,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 196 transitions, 2373 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-27 23:13:52,441 INFO L231 Difference]: Finished difference. Result has 108 places, 168 transitions, 2057 flow [2024-06-27 23:13:52,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2057, PETRI_PLACES=108, PETRI_TRANSITIONS=168} [2024-06-27 23:13:52,442 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places. [2024-06-27 23:13:52,442 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 168 transitions, 2057 flow [2024-06-27 23:13:52,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 23:13:52,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:52,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:52,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:13:52,442 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:52,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1377735121, now seen corresponding path program 5 times [2024-06-27 23:13:52,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:52,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436069489] [2024-06-27 23:13:52,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:52,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:53,813 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 23:13:53,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:53,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436069489] [2024-06-27 23:13:53,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436069489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:53,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:53,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:13:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124410355] [2024-06-27 23:13:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:53,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:13:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:53,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:13:53,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:13:53,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:53,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 168 transitions, 2057 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 23:13:53,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:53,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:53,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:54,978 INFO L124 PetriNetUnfolderBase]: 2127/3326 cut-off events. [2024-06-27 23:13:54,978 INFO L125 PetriNetUnfolderBase]: For 51247/51249 co-relation queries the response was YES. [2024-06-27 23:13:54,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17728 conditions, 3326 events. 2127/3326 cut-off events. For 51247/51249 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17412 event pairs, 583 based on Foata normal form. 10/3333 useless extension candidates. Maximal degree in co-relation 17677. Up to 2542 conditions per place. [2024-06-27 23:13:54,995 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 80 selfloop transitions, 128 changer transitions 0/213 dead transitions. [2024-06-27 23:13:54,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 213 transitions, 2811 flow [2024-06-27 23:13:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:13:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:13:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-27 23:13:54,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-27 23:13:54,998 INFO L175 Difference]: Start difference. First operand has 108 places, 168 transitions, 2057 flow. Second operand 9 states and 182 transitions. [2024-06-27 23:13:54,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 213 transitions, 2811 flow [2024-06-27 23:13:55,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 213 transitions, 2612 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 23:13:55,046 INFO L231 Difference]: Finished difference. Result has 112 places, 177 transitions, 2258 flow [2024-06-27 23:13:55,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2258, PETRI_PLACES=112, PETRI_TRANSITIONS=177} [2024-06-27 23:13:55,047 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places. [2024-06-27 23:13:55,047 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 177 transitions, 2258 flow [2024-06-27 23:13:55,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 23:13:55,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:55,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:55,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:13:55,048 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:55,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1396788591, now seen corresponding path program 6 times [2024-06-27 23:13:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:55,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666427576] [2024-06-27 23:13:55,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:56,444 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 23:13:56,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:56,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666427576] [2024-06-27 23:13:56,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666427576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:56,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:13:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455290035] [2024-06-27 23:13:56,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:56,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:13:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:13:56,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:13:56,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:56,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 177 transitions, 2258 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 23:13:56,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:56,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:56,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:57,474 INFO L124 PetriNetUnfolderBase]: 2105/3280 cut-off events. [2024-06-27 23:13:57,474 INFO L125 PetriNetUnfolderBase]: For 55292/55294 co-relation queries the response was YES. [2024-06-27 23:13:57,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17701 conditions, 3280 events. 2105/3280 cut-off events. For 55292/55294 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17092 event pairs, 607 based on Foata normal form. 10/3287 useless extension candidates. Maximal degree in co-relation 17649. Up to 2524 conditions per place. [2024-06-27 23:13:57,496 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 78 selfloop transitions, 124 changer transitions 0/207 dead transitions. [2024-06-27 23:13:57,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 207 transitions, 2788 flow [2024-06-27 23:13:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:13:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:13:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-27 23:13:57,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2024-06-27 23:13:57,498 INFO L175 Difference]: Start difference. First operand has 112 places, 177 transitions, 2258 flow. Second operand 8 states and 163 transitions. [2024-06-27 23:13:57,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 207 transitions, 2788 flow [2024-06-27 23:13:57,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 207 transitions, 2489 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-27 23:13:57,550 INFO L231 Difference]: Finished difference. Result has 114 places, 177 transitions, 2222 flow [2024-06-27 23:13:57,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2222, PETRI_PLACES=114, PETRI_TRANSITIONS=177} [2024-06-27 23:13:57,550 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2024-06-27 23:13:57,550 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 177 transitions, 2222 flow [2024-06-27 23:13:57,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 23:13:57,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:57,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:57,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 23:13:57,551 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:57,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:57,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1404417288, now seen corresponding path program 1 times [2024-06-27 23:13:57,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:57,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826097246] [2024-06-27 23:13:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:57,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:59,335 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 23:13:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826097246] [2024-06-27 23:13:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826097246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:59,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:59,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:13:59,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672497690] [2024-06-27 23:13:59,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:59,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:13:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:13:59,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:13:59,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:13:59,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 177 transitions, 2222 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:13:59,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:59,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:13:59,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:00,293 INFO L124 PetriNetUnfolderBase]: 1890/3067 cut-off events. [2024-06-27 23:14:00,294 INFO L125 PetriNetUnfolderBase]: For 50259/50261 co-relation queries the response was YES. [2024-06-27 23:14:00,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16261 conditions, 3067 events. 1890/3067 cut-off events. For 50259/50261 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16650 event pairs, 783 based on Foata normal form. 4/3070 useless extension candidates. Maximal degree in co-relation 16208. Up to 2753 conditions per place. [2024-06-27 23:14:00,313 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 181 selfloop transitions, 18 changer transitions 0/205 dead transitions. [2024-06-27 23:14:00,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 205 transitions, 2757 flow [2024-06-27 23:14:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 23:14:00,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-27 23:14:00,314 INFO L175 Difference]: Start difference. First operand has 114 places, 177 transitions, 2222 flow. Second operand 9 states and 166 transitions. [2024-06-27 23:14:00,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 205 transitions, 2757 flow [2024-06-27 23:14:00,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 205 transitions, 2429 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 23:14:00,363 INFO L231 Difference]: Finished difference. Result has 116 places, 182 transitions, 2006 flow [2024-06-27 23:14:00,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2006, PETRI_PLACES=116, PETRI_TRANSITIONS=182} [2024-06-27 23:14:00,364 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2024-06-27 23:14:00,364 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 182 transitions, 2006 flow [2024-06-27 23:14:00,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:14:00,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:00,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:00,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 23:14:00,365 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:00,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:00,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1340775507, now seen corresponding path program 1 times [2024-06-27 23:14:00,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:00,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631894612] [2024-06-27 23:14:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:00,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:01,927 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 23:14:01,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:01,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631894612] [2024-06-27 23:14:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631894612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:01,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:01,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:14:01,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896623851] [2024-06-27 23:14:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:01,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:14:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:01,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:14:01,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:14:02,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:14:02,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 182 transitions, 2006 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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 23:14:02,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:02,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:14:02,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:02,541 INFO L124 PetriNetUnfolderBase]: 1979/3138 cut-off events. [2024-06-27 23:14:02,542 INFO L125 PetriNetUnfolderBase]: For 62260/62271 co-relation queries the response was YES. [2024-06-27 23:14:02,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17262 conditions, 3138 events. 1979/3138 cut-off events. For 62260/62271 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16879 event pairs, 855 based on Foata normal form. 8/3107 useless extension candidates. Maximal degree in co-relation 17207. Up to 2878 conditions per place. [2024-06-27 23:14:02,561 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 162 selfloop transitions, 13 changer transitions 0/193 dead transitions. [2024-06-27 23:14:02,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 193 transitions, 2406 flow [2024-06-27 23:14:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:14:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:14:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-27 23:14:02,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2024-06-27 23:14:02,562 INFO L175 Difference]: Start difference. First operand has 116 places, 182 transitions, 2006 flow. Second operand 7 states and 123 transitions. [2024-06-27 23:14:02,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 193 transitions, 2406 flow [2024-06-27 23:14:02,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 193 transitions, 2326 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-27 23:14:02,622 INFO L231 Difference]: Finished difference. Result has 116 places, 185 transitions, 1990 flow [2024-06-27 23:14:02,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1990, PETRI_PLACES=116, PETRI_TRANSITIONS=185} [2024-06-27 23:14:02,622 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2024-06-27 23:14:02,623 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 185 transitions, 1990 flow [2024-06-27 23:14:02,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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 23:14:02,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:02,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:02,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 23:14:02,623 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:02,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash 156364922, now seen corresponding path program 1 times [2024-06-27 23:14:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:02,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560925400] [2024-06-27 23:14:02,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:03,619 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 23:14:03,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:03,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560925400] [2024-06-27 23:14:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560925400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:14:03,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026596605] [2024-06-27 23:14:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:03,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:14:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:03,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:14:03,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:14:03,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:03,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 185 transitions, 1990 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:14:03,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:03,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:03,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:04,351 INFO L124 PetriNetUnfolderBase]: 2171/3413 cut-off events. [2024-06-27 23:14:04,351 INFO L125 PetriNetUnfolderBase]: For 63285/63289 co-relation queries the response was YES. [2024-06-27 23:14:04,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18489 conditions, 3413 events. 2171/3413 cut-off events. For 63285/63289 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18193 event pairs, 587 based on Foata normal form. 8/3420 useless extension candidates. Maximal degree in co-relation 18435. Up to 2929 conditions per place. [2024-06-27 23:14:04,374 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 165 selfloop transitions, 51 changer transitions 0/221 dead transitions. [2024-06-27 23:14:04,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 221 transitions, 2654 flow [2024-06-27 23:14:04,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-27 23:14:04,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 23:14:04,376 INFO L175 Difference]: Start difference. First operand has 116 places, 185 transitions, 1990 flow. Second operand 8 states and 160 transitions. [2024-06-27 23:14:04,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 221 transitions, 2654 flow [2024-06-27 23:14:04,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 221 transitions, 2612 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 23:14:04,437 INFO L231 Difference]: Finished difference. Result has 120 places, 192 transitions, 2135 flow [2024-06-27 23:14:04,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1948, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2135, PETRI_PLACES=120, PETRI_TRANSITIONS=192} [2024-06-27 23:14:04,438 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places. [2024-06-27 23:14:04,438 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 192 transitions, 2135 flow [2024-06-27 23:14:04,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:14:04,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:04,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:04,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 23:14:04,439 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:04,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1033073442, now seen corresponding path program 2 times [2024-06-27 23:14:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:04,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106427880] [2024-06-27 23:14:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:05,427 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 23:14:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106427880] [2024-06-27 23:14:05,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106427880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:05,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:05,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:14:05,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063371168] [2024-06-27 23:14:05,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:05,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:14:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:05,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:14:05,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:14:05,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:05,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 192 transitions, 2135 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:14:05,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:05,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:05,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:06,314 INFO L124 PetriNetUnfolderBase]: 2179/3421 cut-off events. [2024-06-27 23:14:06,314 INFO L125 PetriNetUnfolderBase]: For 69040/69044 co-relation queries the response was YES. [2024-06-27 23:14:06,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19175 conditions, 3421 events. 2179/3421 cut-off events. For 69040/69044 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18146 event pairs, 588 based on Foata normal form. 8/3428 useless extension candidates. Maximal degree in co-relation 19119. Up to 3031 conditions per place. [2024-06-27 23:14:06,336 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 160 selfloop transitions, 54 changer transitions 0/219 dead transitions. [2024-06-27 23:14:06,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 219 transitions, 2673 flow [2024-06-27 23:14:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-27 23:14:06,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2024-06-27 23:14:06,338 INFO L175 Difference]: Start difference. First operand has 120 places, 192 transitions, 2135 flow. Second operand 8 states and 157 transitions. [2024-06-27 23:14:06,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 219 transitions, 2673 flow [2024-06-27 23:14:06,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 219 transitions, 2593 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-27 23:14:06,396 INFO L231 Difference]: Finished difference. Result has 124 places, 194 transitions, 2203 flow [2024-06-27 23:14:06,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2203, PETRI_PLACES=124, PETRI_TRANSITIONS=194} [2024-06-27 23:14:06,396 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 81 predicate places. [2024-06-27 23:14:06,396 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 194 transitions, 2203 flow [2024-06-27 23:14:06,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:14:06,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:06,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:06,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 23:14:06,397 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:06,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2074570884, now seen corresponding path program 3 times [2024-06-27 23:14:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:06,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247626225] [2024-06-27 23:14:06,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:07,145 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 23:14:07,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:07,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247626225] [2024-06-27 23:14:07,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247626225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:07,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:07,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:14:07,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154754310] [2024-06-27 23:14:07,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:07,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:14:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:07,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:14:07,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:14:07,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-27 23:14:07,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 194 transitions, 2203 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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 23:14:07,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:07,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-27 23:14:07,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:07,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_1| 0) (= |v_P0Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_1|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_1|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base][43], [Black: 192#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 382#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), 376#true, Black: 66#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 32#L851-5true, 145#true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 329#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 214#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 346#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 338#(and (= ~y$w_buff1~0 0) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0)), 23#$Ultimate##0true, Black: 148#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 368#(and (= ~y$w_buff1~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 77#(and (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 399#(and (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 357#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EAX~0 1) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (or (and (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0)) (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 36#P0EXITtrue, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 34#$Ultimate##0true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork1InUse, Black: 369#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 64#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 247#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 251#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 249#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 178#true, Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))]) [2024-06-27 23:14:07,598 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-06-27 23:14:07,598 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-06-27 23:14:07,598 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-06-27 23:14:07,598 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-06-27 23:14:07,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_1| 0) (= |v_P0Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_1|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_1|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base][43], [Black: 192#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 20#L852true, Black: 382#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 376#true, 145#true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 329#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 214#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 346#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 338#(and (= ~y$w_buff1~0 0) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0)), 23#$Ultimate##0true, Black: 148#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 368#(and (= ~y$w_buff1~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 399#(and (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 77#(and (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 357#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EAX~0 1) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (or (and (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0)) (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 36#P0EXITtrue, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 34#$Ultimate##0true, Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork1InUse, Black: 369#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 64#true, Black: 247#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 251#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 249#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 178#true, Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))]) [2024-06-27 23:14:07,620 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2024-06-27 23:14:07,620 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-06-27 23:14:07,620 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-06-27 23:14:07,620 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-06-27 23:14:07,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L761-->L763: Formula: (= 2 v_~x~0_2) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][44], [Black: 192#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 30#L756true, Black: 129#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 382#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), 32#L851-5true, Black: 66#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 376#true, 145#true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 329#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 77#(and (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 214#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 45#L763true, Black: 346#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 338#(and (= ~y$w_buff1~0 0) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0)), 369#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 357#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EAX~0 1) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (or (and (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0)) (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 34#$Ultimate##0true, Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork1InUse, Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 368#(and (= ~y$w_buff1~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 64#true, Black: 247#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 251#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 249#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 401#(and (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 178#true, Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))]) [2024-06-27 23:14:07,668 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is not cut-off event [2024-06-27 23:14:07,668 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2024-06-27 23:14:07,668 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2024-06-27 23:14:07,669 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2024-06-27 23:14:07,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L792-->L803: Formula: (and (= v_~y$w_buff0_used~0_185 1) (= |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_2| |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_1|) (= |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_2| |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|) (= v_~y$r_buff0_thd3~0_106 1) (= v_~y$r_buff0_thd2~0_87 v_~y$r_buff1_thd2~0_83) (not (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_160 256) 0)) (not (= (mod v_~y$w_buff0_used~0_185 256) 0)))) 1 0) 0)) (= v_~y$w_buff0_used~0_186 v_~y$w_buff1_used~0_160) (= v_~y$w_buff1~0_111 v_~y$w_buff0~0_109) (= v_~y$r_buff0_thd3~0_107 v_~y$r_buff1_thd3~0_95) (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_45) (= v_~y$w_buff0~0_108 1) (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff1_thd0~0_63)) InVars {P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_186, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_107, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_87, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|} OutVars{P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_2|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_185, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_45, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_106, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_87, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_1|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_1|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_160} AuxVars[] AssignedVars[P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][114], [Black: 192#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 30#L756true, Black: 129#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 382#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), 32#L851-5true, Black: 66#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 376#true, 145#true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 329#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 77#(and (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 214#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 346#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 338#(and (= ~y$w_buff1~0 0) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0)), 23#$Ultimate##0true, Black: 148#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 29#L803true, Black: 357#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EAX~0 1) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (or (and (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0)) (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 363#true, Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork1InUse, 390#true, Black: 369#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 368#(and (= ~y$w_buff1~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 64#true, Black: 247#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 251#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 249#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 178#true, Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))]) [2024-06-27 23:14:07,674 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is not cut-off event [2024-06-27 23:14:07,674 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2024-06-27 23:14:07,674 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2024-06-27 23:14:07,674 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2024-06-27 23:14:07,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L761-->L763: Formula: (= 2 v_~x~0_2) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0][44], [Black: 192#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 30#L756true, Black: 129#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 20#L852true, Black: 382#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 376#true, 145#true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 329#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 77#(and (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 214#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 45#L763true, Black: 346#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 338#(and (= ~y$w_buff1~0 0) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0)), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 369#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 357#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EAX~0 1) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (or (and (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0)) (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 34#$Ultimate##0true, Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork1InUse, Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 368#(and (= ~y$w_buff1~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 64#true, Black: 247#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 251#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 249#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 401#(and (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 178#true, Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))]) [2024-06-27 23:14:07,707 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-06-27 23:14:07,707 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:14:07,707 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:14:07,707 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:14:07,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L792-->L803: Formula: (and (= v_~y$w_buff0_used~0_185 1) (= |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_2| |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_1|) (= |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_2| |v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|) (= v_~y$r_buff0_thd3~0_106 1) (= v_~y$r_buff0_thd2~0_87 v_~y$r_buff1_thd2~0_83) (not (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_160 256) 0)) (not (= (mod v_~y$w_buff0_used~0_185 256) 0)))) 1 0) 0)) (= v_~y$w_buff0_used~0_186 v_~y$w_buff1_used~0_160) (= v_~y$w_buff1~0_111 v_~y$w_buff0~0_109) (= v_~y$r_buff0_thd3~0_107 v_~y$r_buff1_thd3~0_95) (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_45) (= v_~y$w_buff0~0_108 1) (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff1_thd0~0_63)) InVars {P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_186, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_107, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_87, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|} OutVars{P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base_2|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_185, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_45, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_106, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_87, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_1|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_1|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_160} AuxVars[] AssignedVars[P2Thread1of1ForFork2_reach_error_#t~nondet0#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork2_reach_error_#t~nondet0#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][114], [Black: 192#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 30#L756true, Black: 129#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 127#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 20#L852true, Black: 382#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 376#true, 145#true, Black: 68#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 329#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 77#(and (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 143#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 85#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 214#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EBX~0 0) (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 346#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 338#(and (= ~y$w_buff1~0 0) (or (and (= ~y$flush_delayed~0 0) (= 2 ~__unbuffered_p1_EAX~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0)), 23#$Ultimate##0true, Black: 148#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 289#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 97#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 29#L803true, Black: 357#(and (= ~y$w_buff1~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff0_thd3~0 1) (= ~__unbuffered_p2_EAX~0 1) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (or (and (<= ~y$w_buff0_used~0 1) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd3~0 0)) (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y~0 1))) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 363#true, Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 106#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork1InUse, 390#true, Black: 369#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (= 2 ~x~0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 310#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (and (= 2 ~__unbuffered_p1_EAX~0) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 368#(and (= ~y$w_buff1~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (= ~y~0 0) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 64#true, Black: 247#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 251#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 249#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), 178#true, Black: 62#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))]) [2024-06-27 23:14:07,711 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-06-27 23:14:07,711 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:14:07,711 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:14:07,711 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:14:07,876 INFO L124 PetriNetUnfolderBase]: 1814/3092 cut-off events. [2024-06-27 23:14:07,876 INFO L125 PetriNetUnfolderBase]: For 64670/64729 co-relation queries the response was YES. [2024-06-27 23:14:07,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16979 conditions, 3092 events. 1814/3092 cut-off events. For 64670/64729 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17755 event pairs, 352 based on Foata normal form. 63/3139 useless extension candidates. Maximal degree in co-relation 16921. Up to 2141 conditions per place. [2024-06-27 23:14:07,899 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 103 selfloop transitions, 64 changer transitions 0/228 dead transitions. [2024-06-27 23:14:07,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 228 transitions, 2851 flow [2024-06-27 23:14:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:14:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:14:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-06-27 23:14:07,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2024-06-27 23:14:07,901 INFO L175 Difference]: Start difference. First operand has 124 places, 194 transitions, 2203 flow. Second operand 7 states and 158 transitions. [2024-06-27 23:14:07,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 228 transitions, 2851 flow [2024-06-27 23:14:07,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 228 transitions, 2763 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 23:14:07,959 INFO L231 Difference]: Finished difference. Result has 128 places, 204 transitions, 2430 flow [2024-06-27 23:14:07,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2115, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2430, PETRI_PLACES=128, PETRI_TRANSITIONS=204} [2024-06-27 23:14:07,959 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places. [2024-06-27 23:14:07,959 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 204 transitions, 2430 flow [2024-06-27 23:14:07,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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 23:14:07,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:07,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:07,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 23:14:07,960 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:07,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash 648125861, now seen corresponding path program 1 times [2024-06-27 23:14:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:07,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183175852] [2024-06-27 23:14:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:07,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:08,818 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 23:14:08,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:08,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183175852] [2024-06-27 23:14:08,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183175852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:08,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:08,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:14:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066761889] [2024-06-27 23:14:08,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:08,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:14:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:08,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:14:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:14:08,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:14:08,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 204 transitions, 2430 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 23:14:08,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:08,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:14:08,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:09,428 INFO L124 PetriNetUnfolderBase]: 2095/3364 cut-off events. [2024-06-27 23:14:09,429 INFO L125 PetriNetUnfolderBase]: For 82567/82578 co-relation queries the response was YES. [2024-06-27 23:14:09,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19852 conditions, 3364 events. 2095/3364 cut-off events. For 82567/82578 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18735 event pairs, 774 based on Foata normal form. 10/3351 useless extension candidates. Maximal degree in co-relation 19791. Up to 3019 conditions per place. [2024-06-27 23:14:09,465 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 179 selfloop transitions, 21 changer transitions 0/226 dead transitions. [2024-06-27 23:14:09,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 226 transitions, 2952 flow [2024-06-27 23:14:09,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:14:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:14:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-27 23:14:09,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-27 23:14:09,467 INFO L175 Difference]: Start difference. First operand has 128 places, 204 transitions, 2430 flow. Second operand 7 states and 136 transitions. [2024-06-27 23:14:09,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 226 transitions, 2952 flow [2024-06-27 23:14:09,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 226 transitions, 2915 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-27 23:14:09,552 INFO L231 Difference]: Finished difference. Result has 132 places, 209 transitions, 2524 flow [2024-06-27 23:14:09,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2393, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2524, PETRI_PLACES=132, PETRI_TRANSITIONS=209} [2024-06-27 23:14:09,553 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 89 predicate places. [2024-06-27 23:14:09,553 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 209 transitions, 2524 flow [2024-06-27 23:14:09,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 23:14:09,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:09,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:09,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 23:14:09,553 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:09,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 941571762, now seen corresponding path program 4 times [2024-06-27 23:14:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151820166] [2024-06-27 23:14:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:10,699 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 23:14:10,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:10,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151820166] [2024-06-27 23:14:10,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151820166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:10,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:10,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:14:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386566210] [2024-06-27 23:14:10,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:10,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:14:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:10,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:14:10,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:14:10,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:10,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 209 transitions, 2524 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:14:10,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:10,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:10,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:11,595 INFO L124 PetriNetUnfolderBase]: 2280/3589 cut-off events. [2024-06-27 23:14:11,595 INFO L125 PetriNetUnfolderBase]: For 82369/82371 co-relation queries the response was YES. [2024-06-27 23:14:11,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21279 conditions, 3589 events. 2280/3589 cut-off events. For 82369/82371 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19368 event pairs, 619 based on Foata normal form. 10/3596 useless extension candidates. Maximal degree in co-relation 21217. Up to 3166 conditions per place. [2024-06-27 23:14:11,620 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 169 selfloop transitions, 60 changer transitions 0/234 dead transitions. [2024-06-27 23:14:11,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 234 transitions, 3146 flow [2024-06-27 23:14:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 23:14:11,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 23:14:11,623 INFO L175 Difference]: Start difference. First operand has 132 places, 209 transitions, 2524 flow. Second operand 8 states and 150 transitions. [2024-06-27 23:14:11,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 234 transitions, 3146 flow [2024-06-27 23:14:11,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 234 transitions, 3077 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-27 23:14:11,704 INFO L231 Difference]: Finished difference. Result has 136 places, 215 transitions, 2686 flow [2024-06-27 23:14:11,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2686, PETRI_PLACES=136, PETRI_TRANSITIONS=215} [2024-06-27 23:14:11,705 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places. [2024-06-27 23:14:11,705 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 215 transitions, 2686 flow [2024-06-27 23:14:11,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:14:11,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:11,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:11,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 23:14:11,705 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:11,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:11,706 INFO L85 PathProgramCache]: Analyzing trace with hash 941511312, now seen corresponding path program 5 times [2024-06-27 23:14:11,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:11,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415796028] [2024-06-27 23:14:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:12,926 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 23:14:12,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415796028] [2024-06-27 23:14:12,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415796028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:12,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:12,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:14:12,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699159042] [2024-06-27 23:14:12,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:12,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:14:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:12,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:14:12,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:14:12,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:12,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 215 transitions, 2686 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:14:12,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:12,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:12,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:13,692 INFO L124 PetriNetUnfolderBase]: 2322/3660 cut-off events. [2024-06-27 23:14:13,692 INFO L125 PetriNetUnfolderBase]: For 86459/86461 co-relation queries the response was YES. [2024-06-27 23:14:13,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21872 conditions, 3660 events. 2322/3660 cut-off events. For 86459/86461 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19962 event pairs, 607 based on Foata normal form. 8/3665 useless extension candidates. Maximal degree in co-relation 21809. Up to 3096 conditions per place. [2024-06-27 23:14:13,718 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 170 selfloop transitions, 69 changer transitions 0/244 dead transitions. [2024-06-27 23:14:13,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 244 transitions, 3316 flow [2024-06-27 23:14:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 23:14:13,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-27 23:14:13,720 INFO L175 Difference]: Start difference. First operand has 136 places, 215 transitions, 2686 flow. Second operand 8 states and 151 transitions. [2024-06-27 23:14:13,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 244 transitions, 3316 flow [2024-06-27 23:14:13,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 244 transitions, 3149 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-27 23:14:13,804 INFO L231 Difference]: Finished difference. Result has 139 places, 224 transitions, 2797 flow [2024-06-27 23:14:13,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2519, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2797, PETRI_PLACES=139, PETRI_TRANSITIONS=224} [2024-06-27 23:14:13,805 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places. [2024-06-27 23:14:13,805 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 224 transitions, 2797 flow [2024-06-27 23:14:13,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 23:14:13,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:13,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:13,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 23:14:13,806 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:13,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash 819126121, now seen corresponding path program 2 times [2024-06-27 23:14:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:13,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020833373] [2024-06-27 23:14:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:13,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:14,630 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 23:14:14,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:14,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020833373] [2024-06-27 23:14:14,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020833373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:14,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:14,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:14:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640462727] [2024-06-27 23:14:14,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:14,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:14:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:14,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:14:14,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:14:14,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:14:14,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 224 transitions, 2797 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 23:14:14,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:14,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:14:14,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:15,285 INFO L124 PetriNetUnfolderBase]: 2189/3510 cut-off events. [2024-06-27 23:14:15,285 INFO L125 PetriNetUnfolderBase]: For 95038/95074 co-relation queries the response was YES. [2024-06-27 23:14:15,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21392 conditions, 3510 events. 2189/3510 cut-off events. For 95038/95074 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19704 event pairs, 814 based on Foata normal form. 14/3499 useless extension candidates. Maximal degree in co-relation 21328. Up to 3148 conditions per place. [2024-06-27 23:14:15,372 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 186 selfloop transitions, 23 changer transitions 0/241 dead transitions. [2024-06-27 23:14:15,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 241 transitions, 3297 flow [2024-06-27 23:14:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:14:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:14:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 23:14:15,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-27 23:14:15,375 INFO L175 Difference]: Start difference. First operand has 139 places, 224 transitions, 2797 flow. Second operand 7 states and 129 transitions. [2024-06-27 23:14:15,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 241 transitions, 3297 flow [2024-06-27 23:14:15,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 241 transitions, 3145 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-27 23:14:15,462 INFO L231 Difference]: Finished difference. Result has 140 places, 230 transitions, 2759 flow [2024-06-27 23:14:15,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2645, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2759, PETRI_PLACES=140, PETRI_TRANSITIONS=230} [2024-06-27 23:14:15,462 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places. [2024-06-27 23:14:15,462 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 230 transitions, 2759 flow [2024-06-27 23:14:15,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 23:14:15,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:15,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:15,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 23:14:15,463 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:15,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:15,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1322192944, now seen corresponding path program 1 times [2024-06-27 23:14:15,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:15,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130299589] [2024-06-27 23:14:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:16,722 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 23:14:16,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:16,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130299589] [2024-06-27 23:14:16,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130299589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:16,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:16,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310683415] [2024-06-27 23:14:16,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:16,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:16,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:16,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:16,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:14:16,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:16,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 230 transitions, 2759 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:16,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:16,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:16,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:17,711 INFO L124 PetriNetUnfolderBase]: 2424/3812 cut-off events. [2024-06-27 23:14:17,711 INFO L125 PetriNetUnfolderBase]: For 97517/97519 co-relation queries the response was YES. [2024-06-27 23:14:17,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22931 conditions, 3812 events. 2424/3812 cut-off events. For 97517/97519 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 20905 event pairs, 619 based on Foata normal form. 24/3835 useless extension candidates. Maximal degree in co-relation 22867. Up to 2894 conditions per place. [2024-06-27 23:14:17,739 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 142 selfloop transitions, 121 changer transitions 0/268 dead transitions. [2024-06-27 23:14:17,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 268 transitions, 3453 flow [2024-06-27 23:14:17,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-27 23:14:17,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-06-27 23:14:17,740 INFO L175 Difference]: Start difference. First operand has 140 places, 230 transitions, 2759 flow. Second operand 9 states and 186 transitions. [2024-06-27 23:14:17,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 268 transitions, 3453 flow [2024-06-27 23:14:17,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 268 transitions, 3310 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 23:14:17,837 INFO L231 Difference]: Finished difference. Result has 145 places, 233 transitions, 2911 flow [2024-06-27 23:14:17,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2616, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2911, PETRI_PLACES=145, PETRI_TRANSITIONS=233} [2024-06-27 23:14:17,838 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places. [2024-06-27 23:14:17,838 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 233 transitions, 2911 flow [2024-06-27 23:14:17,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:17,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:17,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:17,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 23:14:17,839 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:17,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -780224347, now seen corresponding path program 3 times [2024-06-27 23:14:17,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:17,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349215723] [2024-06-27 23:14:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:17,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:18,803 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 23:14:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:18,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349215723] [2024-06-27 23:14:18,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349215723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:18,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:18,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:14:18,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474047556] [2024-06-27 23:14:18,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:18,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:14:18,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:18,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:14:18,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:14:18,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:14:18,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 233 transitions, 2911 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 23:14:18,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:18,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:14:18,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:19,435 INFO L124 PetriNetUnfolderBase]: 2261/3644 cut-off events. [2024-06-27 23:14:19,436 INFO L125 PetriNetUnfolderBase]: For 100847/100860 co-relation queries the response was YES. [2024-06-27 23:14:19,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22819 conditions, 3644 events. 2261/3644 cut-off events. For 100847/100860 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 20745 event pairs, 850 based on Foata normal form. 12/3629 useless extension candidates. Maximal degree in co-relation 22754. Up to 3261 conditions per place. [2024-06-27 23:14:19,467 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 181 selfloop transitions, 31 changer transitions 0/244 dead transitions. [2024-06-27 23:14:19,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 244 transitions, 3403 flow [2024-06-27 23:14:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:14:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:14:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-27 23:14:19,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-27 23:14:19,468 INFO L175 Difference]: Start difference. First operand has 145 places, 233 transitions, 2911 flow. Second operand 6 states and 115 transitions. [2024-06-27 23:14:19,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 244 transitions, 3403 flow [2024-06-27 23:14:19,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 244 transitions, 3144 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 23:14:19,573 INFO L231 Difference]: Finished difference. Result has 144 places, 236 transitions, 2768 flow [2024-06-27 23:14:19,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2652, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2768, PETRI_PLACES=144, PETRI_TRANSITIONS=236} [2024-06-27 23:14:19,573 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places. [2024-06-27 23:14:19,573 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 236 transitions, 2768 flow [2024-06-27 23:14:19,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 23:14:19,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:19,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:19,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 23:14:19,574 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:19,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 824845993, now seen corresponding path program 1 times [2024-06-27 23:14:19,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:19,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645820301] [2024-06-27 23:14:19,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:20,398 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 23:14:20,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:20,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645820301] [2024-06-27 23:14:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645820301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:20,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:20,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:14:20,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306811545] [2024-06-27 23:14:20,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:20,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:14:20,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:20,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:14:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:14:20,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:20,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 236 transitions, 2768 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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 23:14:20,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:20,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:20,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:21,111 INFO L124 PetriNetUnfolderBase]: 2426/3829 cut-off events. [2024-06-27 23:14:21,111 INFO L125 PetriNetUnfolderBase]: For 101284/101284 co-relation queries the response was YES. [2024-06-27 23:14:21,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23611 conditions, 3829 events. 2426/3829 cut-off events. For 101284/101284 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21156 event pairs, 983 based on Foata normal form. 1/3829 useless extension candidates. Maximal degree in co-relation 23545. Up to 3608 conditions per place. [2024-06-27 23:14:21,139 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 232 selfloop transitions, 13 changer transitions 0/250 dead transitions. [2024-06-27 23:14:21,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 250 transitions, 3330 flow [2024-06-27 23:14:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:14:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:14:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-27 23:14:21,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-27 23:14:21,140 INFO L175 Difference]: Start difference. First operand has 144 places, 236 transitions, 2768 flow. Second operand 6 states and 110 transitions. [2024-06-27 23:14:21,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 250 transitions, 3330 flow [2024-06-27 23:14:21,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 250 transitions, 3236 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-27 23:14:21,234 INFO L231 Difference]: Finished difference. Result has 146 places, 239 transitions, 2744 flow [2024-06-27 23:14:21,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2674, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2744, PETRI_PLACES=146, PETRI_TRANSITIONS=239} [2024-06-27 23:14:21,234 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places. [2024-06-27 23:14:21,235 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 239 transitions, 2744 flow [2024-06-27 23:14:21,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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 23:14:21,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:21,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:21,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 23:14:21,235 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:21,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:21,236 INFO L85 PathProgramCache]: Analyzing trace with hash 831512233, now seen corresponding path program 2 times [2024-06-27 23:14:21,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:21,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928138211] [2024-06-27 23:14:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:22,153 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 23:14:22,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:22,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928138211] [2024-06-27 23:14:22,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928138211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:22,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:22,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:14:22,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703436247] [2024-06-27 23:14:22,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:22,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:14:22,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:22,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:14:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:14:22,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:22,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 239 transitions, 2744 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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 23:14:22,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:22,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:22,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:22,841 INFO L124 PetriNetUnfolderBase]: 2423/3826 cut-off events. [2024-06-27 23:14:22,842 INFO L125 PetriNetUnfolderBase]: For 106402/106404 co-relation queries the response was YES. [2024-06-27 23:14:22,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23955 conditions, 3826 events. 2423/3826 cut-off events. For 106402/106404 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 21171 event pairs, 987 based on Foata normal form. 3/3828 useless extension candidates. Maximal degree in co-relation 23888. Up to 3598 conditions per place. [2024-06-27 23:14:22,875 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 227 selfloop transitions, 18 changer transitions 0/250 dead transitions. [2024-06-27 23:14:22,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 250 transitions, 3298 flow [2024-06-27 23:14:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:14:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:14:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-27 23:14:22,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2024-06-27 23:14:22,876 INFO L175 Difference]: Start difference. First operand has 146 places, 239 transitions, 2744 flow. Second operand 6 states and 109 transitions. [2024-06-27 23:14:22,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 250 transitions, 3298 flow [2024-06-27 23:14:22,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 250 transitions, 3250 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-27 23:14:22,971 INFO L231 Difference]: Finished difference. Result has 148 places, 242 transitions, 2782 flow [2024-06-27 23:14:22,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2696, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2782, PETRI_PLACES=148, PETRI_TRANSITIONS=242} [2024-06-27 23:14:22,971 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places. [2024-06-27 23:14:22,971 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 242 transitions, 2782 flow [2024-06-27 23:14:22,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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 23:14:22,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:22,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:22,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 23:14:22,972 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:22,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:22,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1385633761, now seen corresponding path program 1 times [2024-06-27 23:14:22,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:22,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965775711] [2024-06-27 23:14:22,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:22,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:24,702 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 23:14:24,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:24,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965775711] [2024-06-27 23:14:24,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965775711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:24,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:24,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:14:24,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388075409] [2024-06-27 23:14:24,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:24,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:14:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:24,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:14:24,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:14:24,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:14:24,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 242 transitions, 2782 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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 23:14:24,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:24,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:14:24,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:25,580 INFO L124 PetriNetUnfolderBase]: 2258/3624 cut-off events. [2024-06-27 23:14:25,580 INFO L125 PetriNetUnfolderBase]: For 115840/115849 co-relation queries the response was YES. [2024-06-27 23:14:25,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23109 conditions, 3624 events. 2258/3624 cut-off events. For 115840/115849 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20548 event pairs, 942 based on Foata normal form. 9/3604 useless extension candidates. Maximal degree in co-relation 23041. Up to 3278 conditions per place. [2024-06-27 23:14:25,605 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 205 selfloop transitions, 16 changer transitions 0/255 dead transitions. [2024-06-27 23:14:25,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 255 transitions, 3294 flow [2024-06-27 23:14:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-27 23:14:25,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41369047619047616 [2024-06-27 23:14:25,606 INFO L175 Difference]: Start difference. First operand has 148 places, 242 transitions, 2782 flow. Second operand 8 states and 139 transitions. [2024-06-27 23:14:25,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 255 transitions, 3294 flow [2024-06-27 23:14:25,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 255 transitions, 3230 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 23:14:25,691 INFO L231 Difference]: Finished difference. Result has 152 places, 245 transitions, 2802 flow [2024-06-27 23:14:25,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2802, PETRI_PLACES=152, PETRI_TRANSITIONS=245} [2024-06-27 23:14:25,692 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2024-06-27 23:14:25,692 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 245 transitions, 2802 flow [2024-06-27 23:14:25,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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 23:14:25,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:25,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:25,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 23:14:25,693 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:25,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash -413843244, now seen corresponding path program 2 times [2024-06-27 23:14:25,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:25,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486231203] [2024-06-27 23:14:25,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:26,787 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 23:14:26,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486231203] [2024-06-27 23:14:26,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486231203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:26,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:26,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868412855] [2024-06-27 23:14:26,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:26,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:26,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:26,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:26,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:14:26,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:26,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 245 transitions, 2802 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:26,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:26,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:26,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:27,660 INFO L124 PetriNetUnfolderBase]: 2561/4043 cut-off events. [2024-06-27 23:14:27,661 INFO L125 PetriNetUnfolderBase]: For 128690/128692 co-relation queries the response was YES. [2024-06-27 23:14:27,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26380 conditions, 4043 events. 2561/4043 cut-off events. For 128690/128692 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22619 event pairs, 645 based on Foata normal form. 4/4041 useless extension candidates. Maximal degree in co-relation 26311. Up to 2610 conditions per place. [2024-06-27 23:14:27,692 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 161 selfloop transitions, 123 changer transitions 0/289 dead transitions. [2024-06-27 23:14:27,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 289 transitions, 3696 flow [2024-06-27 23:14:27,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2024-06-27 23:14:27,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973544973544973 [2024-06-27 23:14:27,693 INFO L175 Difference]: Start difference. First operand has 152 places, 245 transitions, 2802 flow. Second operand 9 states and 188 transitions. [2024-06-27 23:14:27,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 289 transitions, 3696 flow [2024-06-27 23:14:27,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 289 transitions, 3634 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-27 23:14:27,801 INFO L231 Difference]: Finished difference. Result has 156 places, 249 transitions, 3100 flow [2024-06-27 23:14:27,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2740, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3100, PETRI_PLACES=156, PETRI_TRANSITIONS=249} [2024-06-27 23:14:27,802 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places. [2024-06-27 23:14:27,802 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 249 transitions, 3100 flow [2024-06-27 23:14:27,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:27,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:27,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:27,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 23:14:27,802 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:27,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1489491544, now seen corresponding path program 3 times [2024-06-27 23:14:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562872067] [2024-06-27 23:14:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:27,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:28,959 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 23:14:28,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:28,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562872067] [2024-06-27 23:14:28,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562872067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:28,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:28,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:28,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728437975] [2024-06-27 23:14:28,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:28,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:28,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:28,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:28,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:14:29,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:29,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 249 transitions, 3100 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:29,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:29,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:29,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:30,149 INFO L124 PetriNetUnfolderBase]: 2578/4064 cut-off events. [2024-06-27 23:14:30,149 INFO L125 PetriNetUnfolderBase]: For 139846/139848 co-relation queries the response was YES. [2024-06-27 23:14:30,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27923 conditions, 4064 events. 2578/4064 cut-off events. For 139846/139848 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22672 event pairs, 621 based on Foata normal form. 4/4067 useless extension candidates. Maximal degree in co-relation 27852. Up to 3087 conditions per place. [2024-06-27 23:14:30,186 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 157 selfloop transitions, 125 changer transitions 0/287 dead transitions. [2024-06-27 23:14:30,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 287 transitions, 3848 flow [2024-06-27 23:14:30,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-27 23:14:30,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947089947089947 [2024-06-27 23:14:30,187 INFO L175 Difference]: Start difference. First operand has 156 places, 249 transitions, 3100 flow. Second operand 9 states and 187 transitions. [2024-06-27 23:14:30,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 287 transitions, 3848 flow [2024-06-27 23:14:30,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 287 transitions, 3699 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-27 23:14:30,315 INFO L231 Difference]: Finished difference. Result has 160 places, 251 transitions, 3245 flow [2024-06-27 23:14:30,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2953, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3245, PETRI_PLACES=160, PETRI_TRANSITIONS=251} [2024-06-27 23:14:30,316 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-27 23:14:30,316 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 251 transitions, 3245 flow [2024-06-27 23:14:30,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:30,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:30,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:30,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 23:14:30,317 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:30,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash 112813366, now seen corresponding path program 4 times [2024-06-27 23:14:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992025120] [2024-06-27 23:14:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:31,220 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 23:14:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992025120] [2024-06-27 23:14:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992025120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:31,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:31,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:14:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626209085] [2024-06-27 23:14:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:31,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:14:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:14:31,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:14:31,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-27 23:14:31,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 251 transitions, 3245 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 23:14:31,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:31,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-27 23:14:31,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:32,256 INFO L124 PetriNetUnfolderBase]: 2314/3922 cut-off events. [2024-06-27 23:14:32,256 INFO L125 PetriNetUnfolderBase]: For 172787/172887 co-relation queries the response was YES. [2024-06-27 23:14:32,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28524 conditions, 3922 events. 2314/3922 cut-off events. For 172787/172887 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 24050 event pairs, 414 based on Foata normal form. 68/3936 useless extension candidates. Maximal degree in co-relation 28451. Up to 1717 conditions per place. [2024-06-27 23:14:32,293 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 123 selfloop transitions, 104 changer transitions 0/289 dead transitions. [2024-06-27 23:14:32,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 289 transitions, 4095 flow [2024-06-27 23:14:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-06-27 23:14:32,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-27 23:14:32,295 INFO L175 Difference]: Start difference. First operand has 160 places, 251 transitions, 3245 flow. Second operand 8 states and 182 transitions. [2024-06-27 23:14:32,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 289 transitions, 4095 flow [2024-06-27 23:14:32,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 289 transitions, 3829 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-27 23:14:32,450 INFO L231 Difference]: Finished difference. Result has 162 places, 254 transitions, 3291 flow [2024-06-27 23:14:32,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2979, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3291, PETRI_PLACES=162, PETRI_TRANSITIONS=254} [2024-06-27 23:14:32,450 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places. [2024-06-27 23:14:32,450 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 254 transitions, 3291 flow [2024-06-27 23:14:32,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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 23:14:32,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:32,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:32,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 23:14:32,451 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:32,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash -150520433, now seen corresponding path program 1 times [2024-06-27 23:14:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961191689] [2024-06-27 23:14:32,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:33,400 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 23:14:33,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:33,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961191689] [2024-06-27 23:14:33,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961191689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:33,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:33,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:14:33,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169539086] [2024-06-27 23:14:33,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:33,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:14:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:33,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:14:33,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:14:33,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:33,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 254 transitions, 3291 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:14:33,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:33,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:33,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:34,267 INFO L124 PetriNetUnfolderBase]: 2769/4405 cut-off events. [2024-06-27 23:14:34,268 INFO L125 PetriNetUnfolderBase]: For 168949/168955 co-relation queries the response was YES. [2024-06-27 23:14:34,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31442 conditions, 4405 events. 2769/4405 cut-off events. For 168949/168955 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 25301 event pairs, 797 based on Foata normal form. 8/4412 useless extension candidates. Maximal degree in co-relation 31367. Up to 3981 conditions per place. [2024-06-27 23:14:34,309 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 214 selfloop transitions, 68 changer transitions 0/287 dead transitions. [2024-06-27 23:14:34,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 287 transitions, 4112 flow [2024-06-27 23:14:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 23:14:34,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-27 23:14:34,310 INFO L175 Difference]: Start difference. First operand has 162 places, 254 transitions, 3291 flow. Second operand 8 states and 156 transitions. [2024-06-27 23:14:34,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 287 transitions, 4112 flow [2024-06-27 23:14:34,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 287 transitions, 3962 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-27 23:14:34,503 INFO L231 Difference]: Finished difference. Result has 167 places, 264 transitions, 3513 flow [2024-06-27 23:14:34,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3167, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3513, PETRI_PLACES=167, PETRI_TRANSITIONS=264} [2024-06-27 23:14:34,504 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 124 predicate places. [2024-06-27 23:14:34,504 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 264 transitions, 3513 flow [2024-06-27 23:14:34,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:14:34,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:34,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:34,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 23:14:34,505 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:34,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2065252280, now seen corresponding path program 5 times [2024-06-27 23:14:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:34,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730450449] [2024-06-27 23:14:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:34,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:35,684 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 23:14:35,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:35,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730450449] [2024-06-27 23:14:35,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730450449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:35,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:35,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:35,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373463089] [2024-06-27 23:14:35,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:35,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:35,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:14:35,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:35,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 264 transitions, 3513 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:35,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:35,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:35,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:36,848 INFO L124 PetriNetUnfolderBase]: 2919/4655 cut-off events. [2024-06-27 23:14:36,848 INFO L125 PetriNetUnfolderBase]: For 188486/188490 co-relation queries the response was YES. [2024-06-27 23:14:36,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33587 conditions, 4655 events. 2919/4655 cut-off events. For 188486/188490 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 27168 event pairs, 674 based on Foata normal form. 6/4655 useless extension candidates. Maximal degree in co-relation 33510. Up to 3516 conditions per place. [2024-06-27 23:14:36,889 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 175 selfloop transitions, 133 changer transitions 0/313 dead transitions. [2024-06-27 23:14:36,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 313 transitions, 4559 flow [2024-06-27 23:14:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-06-27 23:14:36,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052910052910053 [2024-06-27 23:14:36,890 INFO L175 Difference]: Start difference. First operand has 167 places, 264 transitions, 3513 flow. Second operand 9 states and 191 transitions. [2024-06-27 23:14:36,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 313 transitions, 4559 flow [2024-06-27 23:14:37,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 313 transitions, 4386 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-27 23:14:37,074 INFO L231 Difference]: Finished difference. Result has 172 places, 273 transitions, 3801 flow [2024-06-27 23:14:37,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3340, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3801, PETRI_PLACES=172, PETRI_TRANSITIONS=273} [2024-06-27 23:14:37,075 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places. [2024-06-27 23:14:37,075 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 273 transitions, 3801 flow [2024-06-27 23:14:37,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:37,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:37,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:37,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 23:14:37,076 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:37,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2059742030, now seen corresponding path program 6 times [2024-06-27 23:14:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195088830] [2024-06-27 23:14:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:38,380 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 23:14:38,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:38,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195088830] [2024-06-27 23:14:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195088830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:38,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:38,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:14:38,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276616140] [2024-06-27 23:14:38,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:38,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:14:38,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:14:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:14:38,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:38,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 273 transitions, 3801 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:14:38,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:38,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:38,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:39,760 INFO L124 PetriNetUnfolderBase]: 2994/4774 cut-off events. [2024-06-27 23:14:39,760 INFO L125 PetriNetUnfolderBase]: For 210449/210451 co-relation queries the response was YES. [2024-06-27 23:14:39,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35081 conditions, 4774 events. 2994/4774 cut-off events. For 210449/210451 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 27958 event pairs, 683 based on Foata normal form. 20/4793 useless extension candidates. Maximal degree in co-relation 35002. Up to 3829 conditions per place. [2024-06-27 23:14:39,805 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 186 selfloop transitions, 124 changer transitions 0/315 dead transitions. [2024-06-27 23:14:39,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 315 transitions, 4628 flow [2024-06-27 23:14:39,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-27 23:14:39,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-27 23:14:39,807 INFO L175 Difference]: Start difference. First operand has 172 places, 273 transitions, 3801 flow. Second operand 10 states and 203 transitions. [2024-06-27 23:14:39,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 315 transitions, 4628 flow [2024-06-27 23:14:40,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 315 transitions, 4455 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-27 23:14:40,038 INFO L231 Difference]: Finished difference. Result has 177 places, 275 transitions, 3931 flow [2024-06-27 23:14:40,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3628, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3931, PETRI_PLACES=177, PETRI_TRANSITIONS=275} [2024-06-27 23:14:40,038 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-27 23:14:40,038 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 275 transitions, 3931 flow [2024-06-27 23:14:40,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:14:40,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:40,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:40,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 23:14:40,039 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:40,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash -475800018, now seen corresponding path program 7 times [2024-06-27 23:14:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:40,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174390731] [2024-06-27 23:14:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:41,311 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 23:14:41,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:41,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174390731] [2024-06-27 23:14:41,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174390731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:41,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:41,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:41,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486491465] [2024-06-27 23:14:41,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:41,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:41,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:41,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:41,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:14:41,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:41,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 275 transitions, 3931 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:41,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:41,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:41,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:42,477 INFO L124 PetriNetUnfolderBase]: 3030/4841 cut-off events. [2024-06-27 23:14:42,477 INFO L125 PetriNetUnfolderBase]: For 218634/218638 co-relation queries the response was YES. [2024-06-27 23:14:42,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36065 conditions, 4841 events. 3030/4841 cut-off events. For 218634/218638 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28496 event pairs, 691 based on Foata normal form. 22/4862 useless extension candidates. Maximal degree in co-relation 35984. Up to 3885 conditions per place. [2024-06-27 23:14:42,525 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 181 selfloop transitions, 128 changer transitions 0/314 dead transitions. [2024-06-27 23:14:42,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 314 transitions, 4750 flow [2024-06-27 23:14:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-27 23:14:42,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947089947089947 [2024-06-27 23:14:42,526 INFO L175 Difference]: Start difference. First operand has 177 places, 275 transitions, 3931 flow. Second operand 9 states and 187 transitions. [2024-06-27 23:14:42,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 314 transitions, 4750 flow [2024-06-27 23:14:42,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 314 transitions, 4490 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-27 23:14:42,756 INFO L231 Difference]: Finished difference. Result has 178 places, 277 transitions, 3986 flow [2024-06-27 23:14:42,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3671, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3986, PETRI_PLACES=178, PETRI_TRANSITIONS=277} [2024-06-27 23:14:42,757 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 135 predicate places. [2024-06-27 23:14:42,757 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 277 transitions, 3986 flow [2024-06-27 23:14:42,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:42,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:42,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:42,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 23:14:42,758 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:42,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1365070265, now seen corresponding path program 2 times [2024-06-27 23:14:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:42,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371885399] [2024-06-27 23:14:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:43,567 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 23:14:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371885399] [2024-06-27 23:14:43,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371885399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:43,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:43,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:14:43,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520190834] [2024-06-27 23:14:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:43,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:14:43,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:43,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:14:43,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:14:43,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:43,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 277 transitions, 3986 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:14:43,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:43,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:43,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:44,625 INFO L124 PetriNetUnfolderBase]: 3050/4868 cut-off events. [2024-06-27 23:14:44,625 INFO L125 PetriNetUnfolderBase]: For 217053/217057 co-relation queries the response was YES. [2024-06-27 23:14:44,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36395 conditions, 4868 events. 3050/4868 cut-off events. For 217053/217057 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28733 event pairs, 746 based on Foata normal form. 6/4873 useless extension candidates. Maximal degree in co-relation 36313. Up to 4428 conditions per place. [2024-06-27 23:14:44,662 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 234 selfloop transitions, 67 changer transitions 0/306 dead transitions. [2024-06-27 23:14:44,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 306 transitions, 4732 flow [2024-06-27 23:14:44,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-27 23:14:44,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2024-06-27 23:14:44,663 INFO L175 Difference]: Start difference. First operand has 178 places, 277 transitions, 3986 flow. Second operand 8 states and 155 transitions. [2024-06-27 23:14:44,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 306 transitions, 4732 flow [2024-06-27 23:14:44,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 306 transitions, 4518 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 23:14:44,852 INFO L231 Difference]: Finished difference. Result has 180 places, 285 transitions, 4013 flow [2024-06-27 23:14:44,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3772, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4013, PETRI_PLACES=180, PETRI_TRANSITIONS=285} [2024-06-27 23:14:44,853 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places. [2024-06-27 23:14:44,853 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 285 transitions, 4013 flow [2024-06-27 23:14:44,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:14:44,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:44,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:44,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 23:14:44,854 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:44,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1382933302, now seen corresponding path program 1 times [2024-06-27 23:14:44,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416585496] [2024-06-27 23:14:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:44,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:46,193 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 23:14:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:46,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416585496] [2024-06-27 23:14:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416585496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:46,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:46,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119669296] [2024-06-27 23:14:46,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:46,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:14:46,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:14:46,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 285 transitions, 4013 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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 23:14:46,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:46,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:14:46,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:47,165 INFO L124 PetriNetUnfolderBase]: 2881/4671 cut-off events. [2024-06-27 23:14:47,165 INFO L125 PetriNetUnfolderBase]: For 225081/225110 co-relation queries the response was YES. [2024-06-27 23:14:47,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35239 conditions, 4671 events. 2881/4671 cut-off events. For 225081/225110 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 28289 event pairs, 990 based on Foata normal form. 10/4644 useless extension candidates. Maximal degree in co-relation 35156. Up to 4245 conditions per place. [2024-06-27 23:14:47,213 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 240 selfloop transitions, 27 changer transitions 0/306 dead transitions. [2024-06-27 23:14:47,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 306 transitions, 4651 flow [2024-06-27 23:14:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 23:14:47,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-27 23:14:47,214 INFO L175 Difference]: Start difference. First operand has 180 places, 285 transitions, 4013 flow. Second operand 8 states and 151 transitions. [2024-06-27 23:14:47,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 306 transitions, 4651 flow [2024-06-27 23:14:47,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 306 transitions, 4439 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-27 23:14:47,415 INFO L231 Difference]: Finished difference. Result has 182 places, 288 transitions, 3916 flow [2024-06-27 23:14:47,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3801, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3916, PETRI_PLACES=182, PETRI_TRANSITIONS=288} [2024-06-27 23:14:47,417 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places. [2024-06-27 23:14:47,417 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 288 transitions, 3916 flow [2024-06-27 23:14:47,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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 23:14:47,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:47,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:47,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 23:14:47,418 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:47,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1382933705, now seen corresponding path program 3 times [2024-06-27 23:14:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172160667] [2024-06-27 23:14:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:48,460 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 23:14:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172160667] [2024-06-27 23:14:48,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172160667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:48,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:48,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:14:48,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335199951] [2024-06-27 23:14:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:48,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:14:48,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:48,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:14:48,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:14:48,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:48,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 288 transitions, 3916 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:14:48,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:48,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:48,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:49,390 INFO L124 PetriNetUnfolderBase]: 3083/4913 cut-off events. [2024-06-27 23:14:49,390 INFO L125 PetriNetUnfolderBase]: For 233732/233734 co-relation queries the response was YES. [2024-06-27 23:14:49,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37293 conditions, 4913 events. 3083/4913 cut-off events. For 233732/233734 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 28919 event pairs, 754 based on Foata normal form. 4/4916 useless extension candidates. Maximal degree in co-relation 37209. Up to 4421 conditions per place. [2024-06-27 23:14:49,437 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 239 selfloop transitions, 71 changer transitions 0/315 dead transitions. [2024-06-27 23:14:49,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 315 transitions, 4812 flow [2024-06-27 23:14:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-27 23:14:49,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-27 23:14:49,439 INFO L175 Difference]: Start difference. First operand has 182 places, 288 transitions, 3916 flow. Second operand 8 states and 153 transitions. [2024-06-27 23:14:49,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 315 transitions, 4812 flow [2024-06-27 23:14:49,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 315 transitions, 4729 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 23:14:49,699 INFO L231 Difference]: Finished difference. Result has 186 places, 296 transitions, 4159 flow [2024-06-27 23:14:49,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3833, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4159, PETRI_PLACES=186, PETRI_TRANSITIONS=296} [2024-06-27 23:14:49,700 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places. [2024-06-27 23:14:49,700 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 296 transitions, 4159 flow [2024-06-27 23:14:49,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:14:49,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:49,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:49,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 23:14:49,701 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:49,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -789205440, now seen corresponding path program 8 times [2024-06-27 23:14:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140893213] [2024-06-27 23:14:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:49,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:51,026 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 23:14:51,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:51,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140893213] [2024-06-27 23:14:51,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140893213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:51,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:51,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:51,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043196275] [2024-06-27 23:14:51,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:51,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:51,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:51,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:51,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:14:51,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:51,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 296 transitions, 4159 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:51,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:51,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:51,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:52,576 INFO L124 PetriNetUnfolderBase]: 3355/5361 cut-off events. [2024-06-27 23:14:52,577 INFO L125 PetriNetUnfolderBase]: For 289770/289772 co-relation queries the response was YES. [2024-06-27 23:14:52,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40887 conditions, 5361 events. 3355/5361 cut-off events. For 289770/289772 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 32363 event pairs, 793 based on Foata normal form. 48/5401 useless extension candidates. Maximal degree in co-relation 40801. Up to 4186 conditions per place. [2024-06-27 23:14:52,620 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 201 selfloop transitions, 128 changer transitions 0/334 dead transitions. [2024-06-27 23:14:52,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 334 transitions, 5120 flow [2024-06-27 23:14:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-27 23:14:52,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-06-27 23:14:52,622 INFO L175 Difference]: Start difference. First operand has 186 places, 296 transitions, 4159 flow. Second operand 9 states and 177 transitions. [2024-06-27 23:14:52,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 334 transitions, 5120 flow [2024-06-27 23:14:52,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 334 transitions, 4985 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-27 23:14:52,853 INFO L231 Difference]: Finished difference. Result has 191 places, 305 transitions, 4466 flow [2024-06-27 23:14:52,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4026, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4466, PETRI_PLACES=191, PETRI_TRANSITIONS=305} [2024-06-27 23:14:52,854 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places. [2024-06-27 23:14:52,854 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 305 transitions, 4466 flow [2024-06-27 23:14:52,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:52,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:52,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:52,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 23:14:52,855 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:52,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash -789353310, now seen corresponding path program 9 times [2024-06-27 23:14:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:52,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177873843] [2024-06-27 23:14:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:54,075 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 23:14:54,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177873843] [2024-06-27 23:14:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177873843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:54,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:54,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296606658] [2024-06-27 23:14:54,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:54,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:54,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:14:54,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:54,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 305 transitions, 4466 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:54,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:54,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:54,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:55,394 INFO L124 PetriNetUnfolderBase]: 3405/5437 cut-off events. [2024-06-27 23:14:55,394 INFO L125 PetriNetUnfolderBase]: For 275015/275017 co-relation queries the response was YES. [2024-06-27 23:14:55,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42872 conditions, 5437 events. 3405/5437 cut-off events. For 275015/275017 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 32889 event pairs, 790 based on Foata normal form. 8/5437 useless extension candidates. Maximal degree in co-relation 42784. Up to 4157 conditions per place. [2024-06-27 23:14:55,448 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 199 selfloop transitions, 140 changer transitions 0/344 dead transitions. [2024-06-27 23:14:55,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 344 transitions, 5452 flow [2024-06-27 23:14:55,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-27 23:14:55,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708994708994709 [2024-06-27 23:14:55,450 INFO L175 Difference]: Start difference. First operand has 191 places, 305 transitions, 4466 flow. Second operand 9 states and 178 transitions. [2024-06-27 23:14:55,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 344 transitions, 5452 flow [2024-06-27 23:14:55,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 344 transitions, 5149 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-27 23:14:55,759 INFO L231 Difference]: Finished difference. Result has 193 places, 312 transitions, 4594 flow [2024-06-27 23:14:55,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4163, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4594, PETRI_PLACES=193, PETRI_TRANSITIONS=312} [2024-06-27 23:14:55,760 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places. [2024-06-27 23:14:55,760 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 312 transitions, 4594 flow [2024-06-27 23:14:55,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:55,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:55,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:55,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 23:14:55,760 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:55,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash -877919070, now seen corresponding path program 10 times [2024-06-27 23:14:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:55,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81544638] [2024-06-27 23:14:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:56,980 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 23:14:56,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:56,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81544638] [2024-06-27 23:14:56,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81544638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:56,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651290339] [2024-06-27 23:14:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:56,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:14:57,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:57,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 312 transitions, 4594 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:57,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:57,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:57,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:58,322 INFO L124 PetriNetUnfolderBase]: 3787/6068 cut-off events. [2024-06-27 23:14:58,322 INFO L125 PetriNetUnfolderBase]: For 319088/319090 co-relation queries the response was YES. [2024-06-27 23:14:58,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48096 conditions, 6068 events. 3787/6068 cut-off events. For 319088/319090 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 37567 event pairs, 936 based on Foata normal form. 6/6066 useless extension candidates. Maximal degree in co-relation 48008. Up to 3795 conditions per place. [2024-06-27 23:14:58,391 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 199 selfloop transitions, 158 changer transitions 0/362 dead transitions. [2024-06-27 23:14:58,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 362 transitions, 5904 flow [2024-06-27 23:14:58,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-27 23:14:58,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47354497354497355 [2024-06-27 23:14:58,393 INFO L175 Difference]: Start difference. First operand has 193 places, 312 transitions, 4594 flow. Second operand 9 states and 179 transitions. [2024-06-27 23:14:58,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 362 transitions, 5904 flow [2024-06-27 23:14:58,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 362 transitions, 5559 flow, removed 38 selfloop flow, removed 7 redundant places. [2024-06-27 23:14:58,750 INFO L231 Difference]: Finished difference. Result has 196 places, 328 transitions, 4955 flow [2024-06-27 23:14:58,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4249, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4955, PETRI_PLACES=196, PETRI_TRANSITIONS=328} [2024-06-27 23:14:58,751 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 153 predicate places. [2024-06-27 23:14:58,751 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 328 transitions, 4955 flow [2024-06-27 23:14:58,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:14:58,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:58,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:58,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 23:14:58,751 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:58,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:58,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1510294336, now seen corresponding path program 11 times [2024-06-27 23:14:58,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:58,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233267006] [2024-06-27 23:14:58,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:58,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:59,979 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 23:14:59,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:59,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233267006] [2024-06-27 23:14:59,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233267006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:59,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:59,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:59,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205950864] [2024-06-27 23:14:59,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:59,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:59,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:59,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:59,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:15:00,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:00,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 328 transitions, 4955 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:15:00,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:00,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:00,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:01,579 INFO L124 PetriNetUnfolderBase]: 3967/6398 cut-off events. [2024-06-27 23:15:01,579 INFO L125 PetriNetUnfolderBase]: For 366372/366374 co-relation queries the response was YES. [2024-06-27 23:15:01,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52660 conditions, 6398 events. 3967/6398 cut-off events. For 366372/366374 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 40449 event pairs, 976 based on Foata normal form. 8/6403 useless extension candidates. Maximal degree in co-relation 52570. Up to 4736 conditions per place. [2024-06-27 23:15:01,643 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 214 selfloop transitions, 152 changer transitions 0/371 dead transitions. [2024-06-27 23:15:01,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 371 transitions, 6263 flow [2024-06-27 23:15:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:15:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:15:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-27 23:15:01,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-27 23:15:01,645 INFO L175 Difference]: Start difference. First operand has 196 places, 328 transitions, 4955 flow. Second operand 9 states and 182 transitions. [2024-06-27 23:15:01,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 371 transitions, 6263 flow [2024-06-27 23:15:01,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 371 transitions, 6072 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-27 23:15:01,979 INFO L231 Difference]: Finished difference. Result has 200 places, 336 transitions, 5316 flow [2024-06-27 23:15:01,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4766, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5316, PETRI_PLACES=200, PETRI_TRANSITIONS=336} [2024-06-27 23:15:01,980 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places. [2024-06-27 23:15:01,980 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 336 transitions, 5316 flow [2024-06-27 23:15:01,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:15:01,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:01,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:01,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 23:15:01,980 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:01,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1510146466, now seen corresponding path program 12 times [2024-06-27 23:15:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:01,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340968774] [2024-06-27 23:15:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:03,232 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 23:15:03,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340968774] [2024-06-27 23:15:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340968774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:03,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:03,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:15:03,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425662856] [2024-06-27 23:15:03,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:03,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:15:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:03,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:15:03,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:15:03,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:03,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 336 transitions, 5316 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:15:03,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:03,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:03,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:05,030 INFO L124 PetriNetUnfolderBase]: 4140/6690 cut-off events. [2024-06-27 23:15:05,031 INFO L125 PetriNetUnfolderBase]: For 419051/419053 co-relation queries the response was YES. [2024-06-27 23:15:05,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55730 conditions, 6690 events. 4140/6690 cut-off events. For 419051/419053 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 42890 event pairs, 1066 based on Foata normal form. 40/6727 useless extension candidates. Maximal degree in co-relation 55638. Up to 5494 conditions per place. [2024-06-27 23:15:05,103 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 235 selfloop transitions, 132 changer transitions 0/372 dead transitions. [2024-06-27 23:15:05,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 372 transitions, 6378 flow [2024-06-27 23:15:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:15:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:15:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-27 23:15:05,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708994708994709 [2024-06-27 23:15:05,105 INFO L175 Difference]: Start difference. First operand has 200 places, 336 transitions, 5316 flow. Second operand 9 states and 178 transitions. [2024-06-27 23:15:05,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 372 transitions, 6378 flow [2024-06-27 23:15:05,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 372 transitions, 6147 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-27 23:15:05,569 INFO L231 Difference]: Finished difference. Result has 204 places, 341 transitions, 5515 flow [2024-06-27 23:15:05,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5085, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5515, PETRI_PLACES=204, PETRI_TRANSITIONS=341} [2024-06-27 23:15:05,570 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places. [2024-06-27 23:15:05,570 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 341 transitions, 5515 flow [2024-06-27 23:15:05,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 23:15:05,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:05,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:05,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 23:15:05,570 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:05,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:05,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1504784086, now seen corresponding path program 13 times [2024-06-27 23:15:05,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:05,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666444044] [2024-06-27 23:15:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:07,064 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 23:15:07,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:07,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666444044] [2024-06-27 23:15:07,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666444044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:07,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:07,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:15:07,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389443530] [2024-06-27 23:15:07,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:07,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:15:07,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:07,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:15:07,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:15:07,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:07,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 341 transitions, 5515 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:07,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:07,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:07,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:08,846 INFO L124 PetriNetUnfolderBase]: 4362/7067 cut-off events. [2024-06-27 23:15:08,847 INFO L125 PetriNetUnfolderBase]: For 457794/457796 co-relation queries the response was YES. [2024-06-27 23:15:08,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59406 conditions, 7067 events. 4362/7067 cut-off events. For 457794/457796 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 46095 event pairs, 1150 based on Foata normal form. 50/7114 useless extension candidates. Maximal degree in co-relation 59312. Up to 5794 conditions per place. [2024-06-27 23:15:08,929 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 249 selfloop transitions, 128 changer transitions 0/382 dead transitions. [2024-06-27 23:15:08,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 382 transitions, 6693 flow [2024-06-27 23:15:08,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-27 23:15:08,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-27 23:15:08,931 INFO L175 Difference]: Start difference. First operand has 204 places, 341 transitions, 5515 flow. Second operand 10 states and 194 transitions. [2024-06-27 23:15:08,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 382 transitions, 6693 flow [2024-06-27 23:15:09,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 382 transitions, 6432 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 23:15:09,525 INFO L231 Difference]: Finished difference. Result has 208 places, 348 transitions, 5753 flow [2024-06-27 23:15:09,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5254, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5753, PETRI_PLACES=208, PETRI_TRANSITIONS=348} [2024-06-27 23:15:09,526 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places. [2024-06-27 23:15:09,526 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 348 transitions, 5753 flow [2024-06-27 23:15:09,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:09,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:09,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:09,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 23:15:09,526 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:09,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -377221231, now seen corresponding path program 4 times [2024-06-27 23:15:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:09,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242516303] [2024-06-27 23:15:09,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:10,364 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 23:15:10,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:10,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242516303] [2024-06-27 23:15:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242516303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:10,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:10,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:15:10,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062072031] [2024-06-27 23:15:10,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:10,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:15:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:15:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:15:10,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:10,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 348 transitions, 5753 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:15:10,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:10,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:10,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:11,840 INFO L124 PetriNetUnfolderBase]: 4387/7102 cut-off events. [2024-06-27 23:15:11,840 INFO L125 PetriNetUnfolderBase]: For 422548/422550 co-relation queries the response was YES. [2024-06-27 23:15:11,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59762 conditions, 7102 events. 4387/7102 cut-off events. For 422548/422550 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 46318 event pairs, 1194 based on Foata normal form. 4/7103 useless extension candidates. Maximal degree in co-relation 59667. Up to 6572 conditions per place. [2024-06-27 23:15:11,912 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 300 selfloop transitions, 69 changer transitions 0/374 dead transitions. [2024-06-27 23:15:11,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 374 transitions, 6674 flow [2024-06-27 23:15:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:15:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:15:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-27 23:15:11,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-06-27 23:15:11,913 INFO L175 Difference]: Start difference. First operand has 208 places, 348 transitions, 5753 flow. Second operand 7 states and 138 transitions. [2024-06-27 23:15:11,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 374 transitions, 6674 flow [2024-06-27 23:15:12,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 374 transitions, 6337 flow, removed 49 selfloop flow, removed 8 redundant places. [2024-06-27 23:15:12,352 INFO L231 Difference]: Finished difference. Result has 207 places, 359 transitions, 5730 flow [2024-06-27 23:15:12,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5416, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5730, PETRI_PLACES=207, PETRI_TRANSITIONS=359} [2024-06-27 23:15:12,353 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 164 predicate places. [2024-06-27 23:15:12,353 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 359 transitions, 5730 flow [2024-06-27 23:15:12,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:15:12,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:12,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:12,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 23:15:12,360 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:12,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash -376892941, now seen corresponding path program 5 times [2024-06-27 23:15:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:12,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684597927] [2024-06-27 23:15:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:13,280 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 23:15:13,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:13,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684597927] [2024-06-27 23:15:13,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684597927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:13,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:13,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:15:13,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176632831] [2024-06-27 23:15:13,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:13,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:15:13,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:13,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:15:13,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:15:13,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:13,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 359 transitions, 5730 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:15:13,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:13,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:13,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:14,652 INFO L124 PetriNetUnfolderBase]: 4443/7191 cut-off events. [2024-06-27 23:15:14,653 INFO L125 PetriNetUnfolderBase]: For 431400/431402 co-relation queries the response was YES. [2024-06-27 23:15:14,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60244 conditions, 7191 events. 4443/7191 cut-off events. For 431400/431402 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 46966 event pairs, 1206 based on Foata normal form. 4/7192 useless extension candidates. Maximal degree in co-relation 60148. Up to 6592 conditions per place. [2024-06-27 23:15:14,729 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 307 selfloop transitions, 76 changer transitions 0/388 dead transitions. [2024-06-27 23:15:14,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 388 transitions, 6888 flow [2024-06-27 23:15:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:15:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:15:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-27 23:15:14,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-27 23:15:14,731 INFO L175 Difference]: Start difference. First operand has 207 places, 359 transitions, 5730 flow. Second operand 7 states and 136 transitions. [2024-06-27 23:15:14,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 388 transitions, 6888 flow [2024-06-27 23:15:15,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 388 transitions, 6736 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 23:15:15,268 INFO L231 Difference]: Finished difference. Result has 211 places, 375 transitions, 6059 flow [2024-06-27 23:15:15,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5578, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6059, PETRI_PLACES=211, PETRI_TRANSITIONS=375} [2024-06-27 23:15:15,269 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 168 predicate places. [2024-06-27 23:15:15,269 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 375 transitions, 6059 flow [2024-06-27 23:15:15,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:15:15,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:15,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:15,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 23:15:15,270 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:15,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:15,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1571750956, now seen corresponding path program 2 times [2024-06-27 23:15:15,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:15,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583999924] [2024-06-27 23:15:15,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:15,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:16,391 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 23:15:16,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:16,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583999924] [2024-06-27 23:15:16,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583999924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:16,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:15:16,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582830693] [2024-06-27 23:15:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:16,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:15:16,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:15:16,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:15:16,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:15:16,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 375 transitions, 6059 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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 23:15:16,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:16,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:15:16,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:17,706 INFO L124 PetriNetUnfolderBase]: 4205/6888 cut-off events. [2024-06-27 23:15:17,707 INFO L125 PetriNetUnfolderBase]: For 456742/456815 co-relation queries the response was YES. [2024-06-27 23:15:17,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59478 conditions, 6888 events. 4205/6888 cut-off events. For 456742/456815 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 45893 event pairs, 1470 based on Foata normal form. 37/6847 useless extension candidates. Maximal degree in co-relation 59379. Up to 6330 conditions per place. [2024-06-27 23:15:17,793 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 317 selfloop transitions, 29 changer transitions 0/393 dead transitions. [2024-06-27 23:15:17,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 393 transitions, 6865 flow [2024-06-27 23:15:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:15:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:15:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 23:15:17,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 23:15:17,794 INFO L175 Difference]: Start difference. First operand has 211 places, 375 transitions, 6059 flow. Second operand 7 states and 133 transitions. [2024-06-27 23:15:17,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 393 transitions, 6865 flow [2024-06-27 23:15:18,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 393 transitions, 6750 flow, removed 41 selfloop flow, removed 2 redundant places. [2024-06-27 23:15:18,308 INFO L231 Difference]: Finished difference. Result has 216 places, 381 transitions, 6102 flow [2024-06-27 23:15:18,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5944, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6102, PETRI_PLACES=216, PETRI_TRANSITIONS=381} [2024-06-27 23:15:18,309 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places. [2024-06-27 23:15:18,309 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 381 transitions, 6102 flow [2024-06-27 23:15:18,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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 23:15:18,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:18,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:18,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 23:15:18,310 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:18,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:18,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1816950656, now seen corresponding path program 14 times [2024-06-27 23:15:18,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:18,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073832870] [2024-06-27 23:15:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:18,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:19,745 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 23:15:19,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:19,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073832870] [2024-06-27 23:15:19,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073832870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:19,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:19,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:15:19,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547823396] [2024-06-27 23:15:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:19,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:15:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:19,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:15:19,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:15:19,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:19,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 381 transitions, 6102 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:19,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:19,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:19,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:21,861 INFO L124 PetriNetUnfolderBase]: 4675/7583 cut-off events. [2024-06-27 23:15:21,861 INFO L125 PetriNetUnfolderBase]: For 534053/534053 co-relation queries the response was YES. [2024-06-27 23:15:21,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64939 conditions, 7583 events. 4675/7583 cut-off events. For 534053/534053 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 50290 event pairs, 1172 based on Foata normal form. 50/7629 useless extension candidates. Maximal degree in co-relation 64838. Up to 6345 conditions per place. [2024-06-27 23:15:21,942 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 283 selfloop transitions, 141 changer transitions 0/429 dead transitions. [2024-06-27 23:15:21,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 429 transitions, 7433 flow [2024-06-27 23:15:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:15:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:15:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-27 23:15:21,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-27 23:15:21,944 INFO L175 Difference]: Start difference. First operand has 216 places, 381 transitions, 6102 flow. Second operand 11 states and 210 transitions. [2024-06-27 23:15:21,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 429 transitions, 7433 flow [2024-06-27 23:15:22,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 429 transitions, 7336 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-27 23:15:22,630 INFO L231 Difference]: Finished difference. Result has 223 places, 388 transitions, 6540 flow [2024-06-27 23:15:22,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6005, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6540, PETRI_PLACES=223, PETRI_TRANSITIONS=388} [2024-06-27 23:15:22,630 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 180 predicate places. [2024-06-27 23:15:22,631 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 388 transitions, 6540 flow [2024-06-27 23:15:22,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:22,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:22,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:22,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 23:15:22,631 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:22,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash 270794950, now seen corresponding path program 15 times [2024-06-27 23:15:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:22,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050717090] [2024-06-27 23:15:22,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:24,073 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 23:15:24,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:24,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050717090] [2024-06-27 23:15:24,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050717090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:24,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:24,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:15:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330978934] [2024-06-27 23:15:24,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:24,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:15:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:24,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:15:24,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:15:24,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:24,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 388 transitions, 6540 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:24,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:24,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:24,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:26,217 INFO L124 PetriNetUnfolderBase]: 4570/7399 cut-off events. [2024-06-27 23:15:26,217 INFO L125 PetriNetUnfolderBase]: For 495638/495638 co-relation queries the response was YES. [2024-06-27 23:15:26,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62390 conditions, 7399 events. 4570/7399 cut-off events. For 495638/495638 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 48753 event pairs, 1099 based on Foata normal form. 50/7446 useless extension candidates. Maximal degree in co-relation 62288. Up to 6190 conditions per place. [2024-06-27 23:15:26,302 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 283 selfloop transitions, 137 changer transitions 0/425 dead transitions. [2024-06-27 23:15:26,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 425 transitions, 7644 flow [2024-06-27 23:15:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-27 23:15:26,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595238095238095 [2024-06-27 23:15:26,304 INFO L175 Difference]: Start difference. First operand has 223 places, 388 transitions, 6540 flow. Second operand 10 states and 193 transitions. [2024-06-27 23:15:26,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 425 transitions, 7644 flow [2024-06-27 23:15:26,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 425 transitions, 7191 flow, removed 92 selfloop flow, removed 9 redundant places. [2024-06-27 23:15:26,958 INFO L231 Difference]: Finished difference. Result has 224 places, 388 transitions, 6378 flow [2024-06-27 23:15:26,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6087, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6378, PETRI_PLACES=224, PETRI_TRANSITIONS=388} [2024-06-27 23:15:26,959 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 181 predicate places. [2024-06-27 23:15:26,959 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 388 transitions, 6378 flow [2024-06-27 23:15:26,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:26,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:26,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:26,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 23:15:26,960 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:26,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:26,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1137248891, now seen corresponding path program 1 times [2024-06-27 23:15:26,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:26,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203041659] [2024-06-27 23:15:26,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:28,301 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 23:15:28,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:28,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203041659] [2024-06-27 23:15:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203041659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:28,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:28,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:15:28,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46382881] [2024-06-27 23:15:28,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:28,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:15:28,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:28,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:15:28,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:15:28,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:28,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 388 transitions, 6378 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:28,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:28,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:28,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:30,053 INFO L124 PetriNetUnfolderBase]: 4609/7458 cut-off events. [2024-06-27 23:15:30,053 INFO L125 PetriNetUnfolderBase]: For 443191/443191 co-relation queries the response was YES. [2024-06-27 23:15:30,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61822 conditions, 7458 events. 4609/7458 cut-off events. For 443191/443191 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 49273 event pairs, 1107 based on Foata normal form. 8/7463 useless extension candidates. Maximal degree in co-relation 61719. Up to 6503 conditions per place. [2024-06-27 23:15:30,139 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 285 selfloop transitions, 139 changer transitions 0/429 dead transitions. [2024-06-27 23:15:30,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 429 transitions, 7636 flow [2024-06-27 23:15:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:15:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:15:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-27 23:15:30,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708994708994709 [2024-06-27 23:15:30,141 INFO L175 Difference]: Start difference. First operand has 224 places, 388 transitions, 6378 flow. Second operand 9 states and 178 transitions. [2024-06-27 23:15:30,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 429 transitions, 7636 flow [2024-06-27 23:15:30,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 429 transitions, 7305 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-27 23:15:30,824 INFO L231 Difference]: Finished difference. Result has 226 places, 397 transitions, 6558 flow [2024-06-27 23:15:30,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6055, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6558, PETRI_PLACES=226, PETRI_TRANSITIONS=397} [2024-06-27 23:15:30,825 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places. [2024-06-27 23:15:30,825 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 397 transitions, 6558 flow [2024-06-27 23:15:30,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:30,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:30,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:30,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 23:15:30,826 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:30,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:30,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1338338141, now seen corresponding path program 2 times [2024-06-27 23:15:30,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:30,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099019219] [2024-06-27 23:15:30,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:32,277 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 23:15:32,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:32,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099019219] [2024-06-27 23:15:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099019219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:32,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:32,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:15:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023432110] [2024-06-27 23:15:32,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:32,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:15:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:32,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:15:32,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:15:32,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:32,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 397 transitions, 6558 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:32,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:32,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:32,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:34,092 INFO L124 PetriNetUnfolderBase]: 4666/7562 cut-off events. [2024-06-27 23:15:34,092 INFO L125 PetriNetUnfolderBase]: For 460264/460264 co-relation queries the response was YES. [2024-06-27 23:15:34,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62921 conditions, 7562 events. 4666/7562 cut-off events. For 460264/460264 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 50201 event pairs, 1119 based on Foata normal form. 8/7567 useless extension candidates. Maximal degree in co-relation 62816. Up to 6576 conditions per place. [2024-06-27 23:15:34,180 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 283 selfloop transitions, 166 changer transitions 0/454 dead transitions. [2024-06-27 23:15:34,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 454 transitions, 8120 flow [2024-06-27 23:15:34,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-27 23:15:34,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-27 23:15:34,181 INFO L175 Difference]: Start difference. First operand has 226 places, 397 transitions, 6558 flow. Second operand 10 states and 188 transitions. [2024-06-27 23:15:34,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 454 transitions, 8120 flow [2024-06-27 23:15:34,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 454 transitions, 7688 flow, removed 59 selfloop flow, removed 6 redundant places. [2024-06-27 23:15:34,880 INFO L231 Difference]: Finished difference. Result has 231 places, 424 transitions, 7026 flow [2024-06-27 23:15:34,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6170, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7026, PETRI_PLACES=231, PETRI_TRANSITIONS=424} [2024-06-27 23:15:34,881 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places. [2024-06-27 23:15:34,881 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 424 transitions, 7026 flow [2024-06-27 23:15:34,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:34,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:34,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:34,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 23:15:34,881 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:34,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:34,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1025317479, now seen corresponding path program 3 times [2024-06-27 23:15:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:34,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331953847] [2024-06-27 23:15:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:34,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:36,291 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 23:15:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331953847] [2024-06-27 23:15:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331953847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:15:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078322863] [2024-06-27 23:15:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:36,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:15:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:15:36,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:15:36,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:36,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 424 transitions, 7026 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:36,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:36,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:36,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:38,111 INFO L124 PetriNetUnfolderBase]: 4653/7538 cut-off events. [2024-06-27 23:15:38,112 INFO L125 PetriNetUnfolderBase]: For 463242/463242 co-relation queries the response was YES. [2024-06-27 23:15:38,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62829 conditions, 7538 events. 4653/7538 cut-off events. For 463242/463242 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 49969 event pairs, 948 based on Foata normal form. 6/7541 useless extension candidates. Maximal degree in co-relation 62722. Up to 6030 conditions per place. [2024-06-27 23:15:38,204 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 282 selfloop transitions, 186 changer transitions 0/473 dead transitions. [2024-06-27 23:15:38,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 473 transitions, 8666 flow [2024-06-27 23:15:38,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-27 23:15:38,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-27 23:15:38,206 INFO L175 Difference]: Start difference. First operand has 231 places, 424 transitions, 7026 flow. Second operand 10 states and 194 transitions. [2024-06-27 23:15:38,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 473 transitions, 8666 flow [2024-06-27 23:15:38,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 473 transitions, 8280 flow, removed 66 selfloop flow, removed 5 redundant places. [2024-06-27 23:15:38,993 INFO L231 Difference]: Finished difference. Result has 237 places, 436 transitions, 7413 flow [2024-06-27 23:15:38,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6644, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7413, PETRI_PLACES=237, PETRI_TRANSITIONS=436} [2024-06-27 23:15:38,993 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places. [2024-06-27 23:15:38,994 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 436 transitions, 7413 flow [2024-06-27 23:15:38,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:38,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:38,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:38,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 23:15:38,994 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:38,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash 759293769, now seen corresponding path program 4 times [2024-06-27 23:15:38,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:38,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216098177] [2024-06-27 23:15:38,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:38,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:40,382 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 23:15:40,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:40,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216098177] [2024-06-27 23:15:40,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216098177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:40,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:40,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:15:40,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78572050] [2024-06-27 23:15:40,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:40,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:15:40,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:40,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:15:40,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:15:40,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:40,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 436 transitions, 7413 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:40,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:40,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:40,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:42,222 INFO L124 PetriNetUnfolderBase]: 4635/7508 cut-off events. [2024-06-27 23:15:42,223 INFO L125 PetriNetUnfolderBase]: For 465638/465638 co-relation queries the response was YES. [2024-06-27 23:15:42,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62170 conditions, 7508 events. 4635/7508 cut-off events. For 465638/465638 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 49797 event pairs, 1113 based on Foata normal form. 8/7513 useless extension candidates. Maximal degree in co-relation 62061. Up to 6531 conditions per place. [2024-06-27 23:15:42,315 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 296 selfloop transitions, 165 changer transitions 0/466 dead transitions. [2024-06-27 23:15:42,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 466 transitions, 8485 flow [2024-06-27 23:15:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:15:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:15:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-27 23:15:42,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708994708994709 [2024-06-27 23:15:42,317 INFO L175 Difference]: Start difference. First operand has 237 places, 436 transitions, 7413 flow. Second operand 9 states and 178 transitions. [2024-06-27 23:15:42,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 466 transitions, 8485 flow [2024-06-27 23:15:43,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 466 transitions, 8015 flow, removed 73 selfloop flow, removed 7 redundant places. [2024-06-27 23:15:43,233 INFO L231 Difference]: Finished difference. Result has 240 places, 437 transitions, 7309 flow [2024-06-27 23:15:43,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6945, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7309, PETRI_PLACES=240, PETRI_TRANSITIONS=437} [2024-06-27 23:15:43,234 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places. [2024-06-27 23:15:43,234 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 437 transitions, 7309 flow [2024-06-27 23:15:43,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 23:15:43,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:43,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:43,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 23:15:43,235 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:43,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash 4959308, now seen corresponding path program 3 times [2024-06-27 23:15:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:43,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465527262] [2024-06-27 23:15:43,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:43,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:44,580 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 23:15:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465527262] [2024-06-27 23:15:44,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465527262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:44,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:44,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:15:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485440253] [2024-06-27 23:15:44,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:44,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:15:44,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:15:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:15:44,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:15:44,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 437 transitions, 7309 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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 23:15:44,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:44,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:15:44,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:46,235 INFO L124 PetriNetUnfolderBase]: 4392/7228 cut-off events. [2024-06-27 23:15:46,235 INFO L125 PetriNetUnfolderBase]: For 471975/472045 co-relation queries the response was YES. [2024-06-27 23:15:46,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59839 conditions, 7228 events. 4392/7228 cut-off events. For 471975/472045 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 49060 event pairs, 1459 based on Foata normal form. 34/7184 useless extension candidates. Maximal degree in co-relation 59728. Up to 6625 conditions per place. [2024-06-27 23:15:46,311 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 358 selfloop transitions, 48 changer transitions 0/453 dead transitions. [2024-06-27 23:15:46,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 453 transitions, 8415 flow [2024-06-27 23:15:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:15:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:15:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 23:15:46,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-27 23:15:46,316 INFO L175 Difference]: Start difference. First operand has 240 places, 437 transitions, 7309 flow. Second operand 8 states and 143 transitions. [2024-06-27 23:15:46,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 453 transitions, 8415 flow [2024-06-27 23:15:47,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 453 transitions, 8033 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-27 23:15:47,032 INFO L231 Difference]: Finished difference. Result has 242 places, 443 transitions, 7187 flow [2024-06-27 23:15:47,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6927, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7187, PETRI_PLACES=242, PETRI_TRANSITIONS=443} [2024-06-27 23:15:47,033 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 199 predicate places. [2024-06-27 23:15:47,033 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 443 transitions, 7187 flow [2024-06-27 23:15:47,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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 23:15:47,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:47,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:47,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 23:15:47,033 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:47,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash 4513435, now seen corresponding path program 6 times [2024-06-27 23:15:47,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:47,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942992701] [2024-06-27 23:15:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:47,990 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 23:15:47,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:47,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942992701] [2024-06-27 23:15:47,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942992701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:47,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:47,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:15:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639625650] [2024-06-27 23:15:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:47,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:15:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:47,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:15:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:15:48,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:48,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 443 transitions, 7187 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:15:48,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:48,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:48,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:49,563 INFO L124 PetriNetUnfolderBase]: 4644/7551 cut-off events. [2024-06-27 23:15:49,563 INFO L125 PetriNetUnfolderBase]: For 473147/473149 co-relation queries the response was YES. [2024-06-27 23:15:49,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61547 conditions, 7551 events. 4644/7551 cut-off events. For 473147/473149 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 50256 event pairs, 1187 based on Foata normal form. 4/7552 useless extension candidates. Maximal degree in co-relation 61435. Up to 6855 conditions per place. [2024-06-27 23:15:49,645 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 356 selfloop transitions, 101 changer transitions 0/462 dead transitions. [2024-06-27 23:15:49,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 462 transitions, 8559 flow [2024-06-27 23:15:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:15:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:15:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 23:15:49,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557823129251701 [2024-06-27 23:15:49,649 INFO L175 Difference]: Start difference. First operand has 242 places, 443 transitions, 7187 flow. Second operand 7 states and 134 transitions. [2024-06-27 23:15:49,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 462 transitions, 8559 flow [2024-06-27 23:15:50,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 462 transitions, 8446 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-06-27 23:15:50,345 INFO L231 Difference]: Finished difference. Result has 246 places, 451 transitions, 7500 flow [2024-06-27 23:15:50,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7074, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7500, PETRI_PLACES=246, PETRI_TRANSITIONS=451} [2024-06-27 23:15:50,345 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places. [2024-06-27 23:15:50,346 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 451 transitions, 7500 flow [2024-06-27 23:15:50,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:15:50,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:50,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:50,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 23:15:50,346 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:50,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:50,347 INFO L85 PathProgramCache]: Analyzing trace with hash 4513838, now seen corresponding path program 4 times [2024-06-27 23:15:50,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:50,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036137186] [2024-06-27 23:15:50,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:50,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:51,691 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 23:15:51,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:51,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036137186] [2024-06-27 23:15:51,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036137186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:51,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:51,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:15:51,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26030188] [2024-06-27 23:15:51,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:51,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:15:51,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:51,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:15:51,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:15:51,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:15:51,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 451 transitions, 7500 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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 23:15:51,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:51,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:15:51,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:53,232 INFO L124 PetriNetUnfolderBase]: 4395/7233 cut-off events. [2024-06-27 23:15:53,232 INFO L125 PetriNetUnfolderBase]: For 498295/498365 co-relation queries the response was YES. [2024-06-27 23:15:53,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60594 conditions, 7233 events. 4395/7233 cut-off events. For 498295/498365 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 49073 event pairs, 1461 based on Foata normal form. 34/7189 useless extension candidates. Maximal degree in co-relation 60479. Up to 6640 conditions per place. [2024-06-27 23:15:53,324 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 377 selfloop transitions, 34 changer transitions 0/460 dead transitions. [2024-06-27 23:15:53,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 460 transitions, 8348 flow [2024-06-27 23:15:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:15:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:15:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 23:15:53,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2024-06-27 23:15:53,325 INFO L175 Difference]: Start difference. First operand has 246 places, 451 transitions, 7500 flow. Second operand 8 states and 141 transitions. [2024-06-27 23:15:53,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 460 transitions, 8348 flow [2024-06-27 23:15:54,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 460 transitions, 8004 flow, removed 89 selfloop flow, removed 4 redundant places. [2024-06-27 23:15:54,101 INFO L231 Difference]: Finished difference. Result has 250 places, 451 transitions, 7230 flow [2024-06-27 23:15:54,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7156, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7230, PETRI_PLACES=250, PETRI_TRANSITIONS=451} [2024-06-27 23:15:54,101 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places. [2024-06-27 23:15:54,101 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 451 transitions, 7230 flow [2024-06-27 23:15:54,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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 23:15:54,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:54,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:54,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 23:15:54,102 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:54,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -199726453, now seen corresponding path program 1 times [2024-06-27 23:15:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615160402] [2024-06-27 23:15:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:54,959 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 23:15:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:54,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615160402] [2024-06-27 23:15:54,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615160402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:54,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:15:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603547236] [2024-06-27 23:15:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:54,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:15:54,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:54,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:15:54,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:15:55,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:55,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 451 transitions, 7230 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:15:55,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:55,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:55,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:56,521 INFO L124 PetriNetUnfolderBase]: 4651/7563 cut-off events. [2024-06-27 23:15:56,522 INFO L125 PetriNetUnfolderBase]: For 497049/497049 co-relation queries the response was YES. [2024-06-27 23:15:56,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61544 conditions, 7563 events. 4651/7563 cut-off events. For 497049/497049 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 50466 event pairs, 1867 based on Foata normal form. 2/7564 useless extension candidates. Maximal degree in co-relation 61428. Up to 7163 conditions per place. [2024-06-27 23:15:56,604 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 446 selfloop transitions, 19 changer transitions 0/470 dead transitions. [2024-06-27 23:15:56,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 470 transitions, 8276 flow [2024-06-27 23:15:56,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:15:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:15:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 23:15:56,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-27 23:15:56,606 INFO L175 Difference]: Start difference. First operand has 250 places, 451 transitions, 7230 flow. Second operand 7 states and 129 transitions. [2024-06-27 23:15:56,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 470 transitions, 8276 flow [2024-06-27 23:15:57,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 470 transitions, 8176 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-27 23:15:57,388 INFO L231 Difference]: Finished difference. Result has 250 places, 455 transitions, 7250 flow [2024-06-27 23:15:57,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7130, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7250, PETRI_PLACES=250, PETRI_TRANSITIONS=455} [2024-06-27 23:15:57,388 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places. [2024-06-27 23:15:57,389 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 455 transitions, 7250 flow [2024-06-27 23:15:57,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:15:57,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:57,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:57,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 23:15:57,389 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:57,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:57,390 INFO L85 PathProgramCache]: Analyzing trace with hash -199576723, now seen corresponding path program 2 times [2024-06-27 23:15:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:57,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121133998] [2024-06-27 23:15:57,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:57,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:58,298 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 23:15:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121133998] [2024-06-27 23:15:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121133998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:58,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:58,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:15:58,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461693554] [2024-06-27 23:15:58,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:58,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:15:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:58,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:15:58,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:15:58,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:58,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 455 transitions, 7250 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:15:58,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:58,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:58,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:59,901 INFO L124 PetriNetUnfolderBase]: 4656/7570 cut-off events. [2024-06-27 23:15:59,901 INFO L125 PetriNetUnfolderBase]: For 509258/509258 co-relation queries the response was YES. [2024-06-27 23:15:59,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62429 conditions, 7570 events. 4656/7570 cut-off events. For 509258/509258 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 50537 event pairs, 1867 based on Foata normal form. 1/7570 useless extension candidates. Maximal degree in co-relation 62312. Up to 7164 conditions per place. [2024-06-27 23:15:59,991 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 441 selfloop transitions, 24 changer transitions 0/470 dead transitions. [2024-06-27 23:15:59,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 470 transitions, 8284 flow [2024-06-27 23:15:59,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:15:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:15:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 23:15:59,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2024-06-27 23:15:59,993 INFO L175 Difference]: Start difference. First operand has 250 places, 455 transitions, 7250 flow. Second operand 7 states and 128 transitions. [2024-06-27 23:15:59,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 470 transitions, 8284 flow [2024-06-27 23:16:00,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 470 transitions, 8194 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-27 23:16:00,940 INFO L231 Difference]: Finished difference. Result has 252 places, 458 transitions, 7286 flow [2024-06-27 23:16:00,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7160, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7286, PETRI_PLACES=252, PETRI_TRANSITIONS=458} [2024-06-27 23:16:00,940 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 209 predicate places. [2024-06-27 23:16:00,941 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 458 transitions, 7286 flow [2024-06-27 23:16:00,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:00,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:00,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:00,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 23:16:00,941 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:00,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:00,942 INFO L85 PathProgramCache]: Analyzing trace with hash -274716, now seen corresponding path program 1 times [2024-06-27 23:16:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:00,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516550148] [2024-06-27 23:16:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:02,259 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 23:16:02,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:02,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516550148] [2024-06-27 23:16:02,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516550148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:02,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:02,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:16:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578181903] [2024-06-27 23:16:02,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:02,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:16:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:02,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:16:02,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:16:02,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:02,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 458 transitions, 7286 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:02,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:02,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:02,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:03,825 INFO L124 PetriNetUnfolderBase]: 4661/7577 cut-off events. [2024-06-27 23:16:03,825 INFO L125 PetriNetUnfolderBase]: For 524761/524761 co-relation queries the response was YES. [2024-06-27 23:16:03,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62953 conditions, 7577 events. 4661/7577 cut-off events. For 524761/524761 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 50501 event pairs, 1866 based on Foata normal form. 1/7577 useless extension candidates. Maximal degree in co-relation 62835. Up to 7195 conditions per place. [2024-06-27 23:16:03,926 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 452 selfloop transitions, 16 changer transitions 0/473 dead transitions. [2024-06-27 23:16:03,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 473 transitions, 8314 flow [2024-06-27 23:16:03,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:16:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:16:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-27 23:16:03,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2024-06-27 23:16:03,928 INFO L175 Difference]: Start difference. First operand has 252 places, 458 transitions, 7286 flow. Second operand 7 states and 124 transitions. [2024-06-27 23:16:03,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 473 transitions, 8314 flow [2024-06-27 23:16:04,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 473 transitions, 8210 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-27 23:16:04,845 INFO L231 Difference]: Finished difference. Result has 254 places, 461 transitions, 7280 flow [2024-06-27 23:16:04,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7182, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7280, PETRI_PLACES=254, PETRI_TRANSITIONS=461} [2024-06-27 23:16:04,845 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 211 predicate places. [2024-06-27 23:16:04,845 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 461 transitions, 7280 flow [2024-06-27 23:16:04,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:04,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:04,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:04,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 23:16:04,846 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:04,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:04,846 INFO L85 PathProgramCache]: Analyzing trace with hash 4698350, now seen corresponding path program 2 times [2024-06-27 23:16:04,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:04,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493300027] [2024-06-27 23:16:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:04,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:06,425 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 23:16:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:06,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493300027] [2024-06-27 23:16:06,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493300027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:06,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:06,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:16:06,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856127173] [2024-06-27 23:16:06,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:06,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:16:06,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:06,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:16:06,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:16:06,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:06,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 461 transitions, 7280 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:06,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:06,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:06,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:07,989 INFO L124 PetriNetUnfolderBase]: 4666/7585 cut-off events. [2024-06-27 23:16:07,989 INFO L125 PetriNetUnfolderBase]: For 537850/537852 co-relation queries the response was YES. [2024-06-27 23:16:08,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63421 conditions, 7585 events. 4666/7585 cut-off events. For 537850/537852 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 50626 event pairs, 1870 based on Foata normal form. 3/7587 useless extension candidates. Maximal degree in co-relation 63302. Up to 7196 conditions per place. [2024-06-27 23:16:08,086 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 447 selfloop transitions, 21 changer transitions 0/473 dead transitions. [2024-06-27 23:16:08,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 473 transitions, 8302 flow [2024-06-27 23:16:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:16:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:16:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-27 23:16:08,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2024-06-27 23:16:08,087 INFO L175 Difference]: Start difference. First operand has 254 places, 461 transitions, 7280 flow. Second operand 7 states and 123 transitions. [2024-06-27 23:16:08,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 473 transitions, 8302 flow [2024-06-27 23:16:09,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 473 transitions, 8226 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 23:16:09,009 INFO L231 Difference]: Finished difference. Result has 256 places, 464 transitions, 7318 flow [2024-06-27 23:16:09,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7204, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7318, PETRI_PLACES=256, PETRI_TRANSITIONS=464} [2024-06-27 23:16:09,009 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places. [2024-06-27 23:16:09,010 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 464 transitions, 7318 flow [2024-06-27 23:16:09,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:09,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:09,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:09,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 23:16:09,010 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:09,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 4698133, now seen corresponding path program 3 times [2024-06-27 23:16:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124517494] [2024-06-27 23:16:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:10,136 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 23:16:10,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:10,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124517494] [2024-06-27 23:16:10,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124517494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:10,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:10,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:16:10,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048883728] [2024-06-27 23:16:10,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:10,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:16:10,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:10,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:16:10,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:16:10,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:10,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 464 transitions, 7318 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:10,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:10,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:10,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:11,756 INFO L124 PetriNetUnfolderBase]: 4663/7581 cut-off events. [2024-06-27 23:16:11,756 INFO L125 PetriNetUnfolderBase]: For 549365/549367 co-relation queries the response was YES. [2024-06-27 23:16:11,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63758 conditions, 7581 events. 4663/7581 cut-off events. For 549365/549367 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 50561 event pairs, 1878 based on Foata normal form. 1/7581 useless extension candidates. Maximal degree in co-relation 63638. Up to 7165 conditions per place. [2024-06-27 23:16:11,855 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 440 selfloop transitions, 31 changer transitions 0/476 dead transitions. [2024-06-27 23:16:11,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 476 transitions, 8362 flow [2024-06-27 23:16:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:16:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:16:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 23:16:11,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-27 23:16:11,857 INFO L175 Difference]: Start difference. First operand has 256 places, 464 transitions, 7318 flow. Second operand 7 states and 127 transitions. [2024-06-27 23:16:11,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 476 transitions, 8362 flow [2024-06-27 23:16:12,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 476 transitions, 8270 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-27 23:16:12,843 INFO L231 Difference]: Finished difference. Result has 258 places, 467 transitions, 7376 flow [2024-06-27 23:16:12,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7226, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7376, PETRI_PLACES=258, PETRI_TRANSITIONS=467} [2024-06-27 23:16:12,844 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 215 predicate places. [2024-06-27 23:16:12,844 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 467 transitions, 7376 flow [2024-06-27 23:16:12,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:12,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:12,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:12,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 23:16:12,844 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:12,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash 4965260, now seen corresponding path program 3 times [2024-06-27 23:16:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:12,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333498136] [2024-06-27 23:16:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:14,367 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 23:16:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333498136] [2024-06-27 23:16:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333498136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:16:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642727343] [2024-06-27 23:16:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:14,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:16:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:16:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:16:14,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:16:14,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 467 transitions, 7376 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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 23:16:14,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:14,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:16:14,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:15,943 INFO L124 PetriNetUnfolderBase]: 4585/7506 cut-off events. [2024-06-27 23:16:15,943 INFO L125 PetriNetUnfolderBase]: For 567531/567533 co-relation queries the response was YES. [2024-06-27 23:16:16,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63818 conditions, 7506 events. 4585/7506 cut-off events. For 567531/567533 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 50516 event pairs, 1815 based on Foata normal form. 5/7510 useless extension candidates. Maximal degree in co-relation 63697. Up to 6993 conditions per place. [2024-06-27 23:16:16,038 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 439 selfloop transitions, 32 changer transitions 0/485 dead transitions. [2024-06-27 23:16:16,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 485 transitions, 8596 flow [2024-06-27 23:16:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:16:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:16:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 23:16:16,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 23:16:16,040 INFO L175 Difference]: Start difference. First operand has 258 places, 467 transitions, 7376 flow. Second operand 8 states and 144 transitions. [2024-06-27 23:16:16,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 485 transitions, 8596 flow [2024-06-27 23:16:17,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 485 transitions, 8468 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-27 23:16:17,167 INFO L231 Difference]: Finished difference. Result has 261 places, 473 transitions, 7441 flow [2024-06-27 23:16:17,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7248, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7441, PETRI_PLACES=261, PETRI_TRANSITIONS=473} [2024-06-27 23:16:17,167 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 218 predicate places. [2024-06-27 23:16:17,167 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 473 transitions, 7441 flow [2024-06-27 23:16:17,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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 23:16:17,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:17,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:17,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 23:16:17,168 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:17,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:17,169 INFO L85 PathProgramCache]: Analyzing trace with hash -370559210, now seen corresponding path program 1 times [2024-06-27 23:16:17,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:17,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210074568] [2024-06-27 23:16:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:18,318 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 23:16:18,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210074568] [2024-06-27 23:16:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210074568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:16:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314950962] [2024-06-27 23:16:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:18,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:16:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:16:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:16:18,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:18,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 473 transitions, 7441 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 23:16:18,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:18,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:18,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:20,188 INFO L124 PetriNetUnfolderBase]: 4680/7605 cut-off events. [2024-06-27 23:16:20,189 INFO L125 PetriNetUnfolderBase]: For 577937/577941 co-relation queries the response was YES. [2024-06-27 23:16:20,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64850 conditions, 7605 events. 4680/7605 cut-off events. For 577937/577941 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 50720 event pairs, 1251 based on Foata normal form. 6/7610 useless extension candidates. Maximal degree in co-relation 64728. Up to 7029 conditions per place. [2024-06-27 23:16:20,287 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 417 selfloop transitions, 79 changer transitions 0/501 dead transitions. [2024-06-27 23:16:20,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 501 transitions, 8603 flow [2024-06-27 23:16:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:16:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:16:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-27 23:16:20,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 23:16:20,288 INFO L175 Difference]: Start difference. First operand has 261 places, 473 transitions, 7441 flow. Second operand 9 states and 171 transitions. [2024-06-27 23:16:20,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 501 transitions, 8603 flow [2024-06-27 23:16:21,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 501 transitions, 8523 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-27 23:16:21,295 INFO L231 Difference]: Finished difference. Result has 265 places, 477 transitions, 7630 flow [2024-06-27 23:16:21,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7361, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7630, PETRI_PLACES=265, PETRI_TRANSITIONS=477} [2024-06-27 23:16:21,296 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 222 predicate places. [2024-06-27 23:16:21,296 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 477 transitions, 7630 flow [2024-06-27 23:16:21,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 23:16:21,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:21,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:21,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 23:16:21,297 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:21,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash 401690121, now seen corresponding path program 1 times [2024-06-27 23:16:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:21,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015775874] [2024-06-27 23:16:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:21,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:22,527 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 23:16:22,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:22,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015775874] [2024-06-27 23:16:22,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015775874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:22,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:22,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:16:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664146097] [2024-06-27 23:16:22,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:22,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:16:22,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:22,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:16:22,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:16:22,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:22,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 477 transitions, 7630 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:16:22,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:22,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:22,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:24,770 INFO L124 PetriNetUnfolderBase]: 4761/7755 cut-off events. [2024-06-27 23:16:24,770 INFO L125 PetriNetUnfolderBase]: For 622888/622892 co-relation queries the response was YES. [2024-06-27 23:16:24,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66895 conditions, 7755 events. 4761/7755 cut-off events. For 622888/622892 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 51963 event pairs, 1073 based on Foata normal form. 14/7768 useless extension candidates. Maximal degree in co-relation 66772. Up to 5923 conditions per place. [2024-06-27 23:16:24,867 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 360 selfloop transitions, 164 changer transitions 0/529 dead transitions. [2024-06-27 23:16:24,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 529 transitions, 9219 flow [2024-06-27 23:16:24,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2024-06-27 23:16:24,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976190476190476 [2024-06-27 23:16:24,869 INFO L175 Difference]: Start difference. First operand has 265 places, 477 transitions, 7630 flow. Second operand 10 states and 209 transitions. [2024-06-27 23:16:24,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 529 transitions, 9219 flow [2024-06-27 23:16:26,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 529 transitions, 8996 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-27 23:16:26,026 INFO L231 Difference]: Finished difference. Result has 269 places, 479 transitions, 7806 flow [2024-06-27 23:16:26,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7407, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7806, PETRI_PLACES=269, PETRI_TRANSITIONS=479} [2024-06-27 23:16:26,027 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 226 predicate places. [2024-06-27 23:16:26,027 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 479 transitions, 7806 flow [2024-06-27 23:16:26,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:16:26,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:26,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:26,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 23:16:26,027 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:26,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash 406274091, now seen corresponding path program 2 times [2024-06-27 23:16:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:26,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658186361] [2024-06-27 23:16:26,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:26,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:27,362 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 23:16:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658186361] [2024-06-27 23:16:27,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658186361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:27,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:27,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:16:27,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875078041] [2024-06-27 23:16:27,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:27,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:16:27,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:27,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:16:27,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:16:27,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:27,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 479 transitions, 7806 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:16:27,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:27,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:27,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:29,628 INFO L124 PetriNetUnfolderBase]: 4802/7836 cut-off events. [2024-06-27 23:16:29,628 INFO L125 PetriNetUnfolderBase]: For 645170/645174 co-relation queries the response was YES. [2024-06-27 23:16:29,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68023 conditions, 7836 events. 4802/7836 cut-off events. For 645170/645174 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 52725 event pairs, 1096 based on Foata normal form. 14/7849 useless extension candidates. Maximal degree in co-relation 67899. Up to 6589 conditions per place. [2024-06-27 23:16:29,728 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 369 selfloop transitions, 153 changer transitions 0/527 dead transitions. [2024-06-27 23:16:29,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 527 transitions, 9158 flow [2024-06-27 23:16:29,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-06-27 23:16:29,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-27 23:16:29,729 INFO L175 Difference]: Start difference. First operand has 269 places, 479 transitions, 7806 flow. Second operand 10 states and 205 transitions. [2024-06-27 23:16:29,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 527 transitions, 9158 flow [2024-06-27 23:16:30,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 527 transitions, 8951 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 23:16:30,866 INFO L231 Difference]: Finished difference. Result has 273 places, 480 transitions, 7947 flow [2024-06-27 23:16:30,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7599, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7947, PETRI_PLACES=273, PETRI_TRANSITIONS=480} [2024-06-27 23:16:30,867 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 230 predicate places. [2024-06-27 23:16:30,867 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 480 transitions, 7947 flow [2024-06-27 23:16:30,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:16:30,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:30,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:30,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 23:16:30,867 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:30,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash 572507871, now seen corresponding path program 3 times [2024-06-27 23:16:30,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:30,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919795861] [2024-06-27 23:16:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:30,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:32,260 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 23:16:32,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:32,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919795861] [2024-06-27 23:16:32,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919795861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:32,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:32,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767006327] [2024-06-27 23:16:32,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:32,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:32,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:32,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:32,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:32,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:32,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 480 transitions, 7947 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:16:32,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:32,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:32,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:34,552 INFO L124 PetriNetUnfolderBase]: 4822/7870 cut-off events. [2024-06-27 23:16:34,552 INFO L125 PetriNetUnfolderBase]: For 656798/656800 co-relation queries the response was YES. [2024-06-27 23:16:34,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68736 conditions, 7870 events. 4822/7870 cut-off events. For 656798/656800 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 52952 event pairs, 1096 based on Foata normal form. 12/7881 useless extension candidates. Maximal degree in co-relation 68610. Up to 6621 conditions per place. [2024-06-27 23:16:34,654 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 381 selfloop transitions, 145 changer transitions 0/531 dead transitions. [2024-06-27 23:16:34,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 531 transitions, 9306 flow [2024-06-27 23:16:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:16:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:16:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions. [2024-06-27 23:16:34,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47835497835497837 [2024-06-27 23:16:34,655 INFO L175 Difference]: Start difference. First operand has 273 places, 480 transitions, 7947 flow. Second operand 11 states and 221 transitions. [2024-06-27 23:16:34,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 531 transitions, 9306 flow [2024-06-27 23:16:35,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 531 transitions, 8987 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 23:16:35,822 INFO L231 Difference]: Finished difference. Result has 277 places, 481 transitions, 7962 flow [2024-06-27 23:16:35,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7628, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7962, PETRI_PLACES=277, PETRI_TRANSITIONS=481} [2024-06-27 23:16:35,823 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 234 predicate places. [2024-06-27 23:16:35,823 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 481 transitions, 7962 flow [2024-06-27 23:16:35,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:16:35,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:35,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:35,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 23:16:35,824 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:35,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:35,825 INFO L85 PathProgramCache]: Analyzing trace with hash 496378184, now seen corresponding path program 1 times [2024-06-27 23:16:35,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:35,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727044614] [2024-06-27 23:16:35,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:35,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:36,631 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 23:16:36,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:36,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727044614] [2024-06-27 23:16:36,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727044614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:36,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:36,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:16:36,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031402008] [2024-06-27 23:16:36,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:36,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:16:36,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:36,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:16:36,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:16:36,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:36,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 481 transitions, 7962 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:36,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:36,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:36,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:38,456 INFO L124 PetriNetUnfolderBase]: 4842/7895 cut-off events. [2024-06-27 23:16:38,457 INFO L125 PetriNetUnfolderBase]: For 661602/661604 co-relation queries the response was YES. [2024-06-27 23:16:38,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69181 conditions, 7895 events. 4842/7895 cut-off events. For 661602/661604 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 53157 event pairs, 1197 based on Foata normal form. 6/7900 useless extension candidates. Maximal degree in co-relation 69054. Up to 7310 conditions per place. [2024-06-27 23:16:38,562 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 438 selfloop transitions, 67 changer transitions 0/510 dead transitions. [2024-06-27 23:16:38,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 510 transitions, 9198 flow [2024-06-27 23:16:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:16:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:16:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 23:16:38,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 23:16:38,564 INFO L175 Difference]: Start difference. First operand has 277 places, 481 transitions, 7962 flow. Second operand 8 states and 154 transitions. [2024-06-27 23:16:38,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 510 transitions, 9198 flow [2024-06-27 23:16:39,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 510 transitions, 8893 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-27 23:16:39,778 INFO L231 Difference]: Finished difference. Result has 277 places, 489 transitions, 7977 flow [2024-06-27 23:16:39,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7657, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7977, PETRI_PLACES=277, PETRI_TRANSITIONS=489} [2024-06-27 23:16:39,779 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 234 predicate places. [2024-06-27 23:16:39,779 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 489 transitions, 7977 flow [2024-06-27 23:16:39,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:39,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:39,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:39,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 23:16:39,779 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:39,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash -607442157, now seen corresponding path program 1 times [2024-06-27 23:16:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:39,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875991614] [2024-06-27 23:16:39,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:39,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:41,301 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 23:16:41,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:41,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875991614] [2024-06-27 23:16:41,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875991614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:41,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:41,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:41,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210797410] [2024-06-27 23:16:41,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:41,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:41,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:41,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:41,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:41,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 489 transitions, 7977 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:16:41,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:41,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:41,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:43,569 INFO L124 PetriNetUnfolderBase]: 4849/7917 cut-off events. [2024-06-27 23:16:43,569 INFO L125 PetriNetUnfolderBase]: For 681074/681076 co-relation queries the response was YES. [2024-06-27 23:16:43,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68450 conditions, 7917 events. 4849/7917 cut-off events. For 681074/681076 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 53385 event pairs, 1076 based on Foata normal form. 18/7934 useless extension candidates. Maximal degree in co-relation 68322. Up to 6485 conditions per place. [2024-06-27 23:16:43,671 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 395 selfloop transitions, 154 changer transitions 0/554 dead transitions. [2024-06-27 23:16:43,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 554 transitions, 9552 flow [2024-06-27 23:16:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 23:16:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 23:16:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 254 transitions. [2024-06-27 23:16:43,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652014652014652 [2024-06-27 23:16:43,673 INFO L175 Difference]: Start difference. First operand has 277 places, 489 transitions, 7977 flow. Second operand 13 states and 254 transitions. [2024-06-27 23:16:43,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 554 transitions, 9552 flow [2024-06-27 23:16:44,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 554 transitions, 9336 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-27 23:16:44,756 INFO L231 Difference]: Finished difference. Result has 287 places, 498 transitions, 8321 flow [2024-06-27 23:16:44,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7761, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8321, PETRI_PLACES=287, PETRI_TRANSITIONS=498} [2024-06-27 23:16:44,757 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 244 predicate places. [2024-06-27 23:16:44,757 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 498 transitions, 8321 flow [2024-06-27 23:16:44,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:16:44,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:44,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:44,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 23:16:44,758 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:44,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:44,758 INFO L85 PathProgramCache]: Analyzing trace with hash 78733188, now seen corresponding path program 2 times [2024-06-27 23:16:44,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:44,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486273443] [2024-06-27 23:16:44,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:44,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:45,744 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 23:16:45,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:45,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486273443] [2024-06-27 23:16:45,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486273443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:45,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:45,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:16:45,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603439238] [2024-06-27 23:16:45,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:45,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:16:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:45,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:16:45,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:16:45,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:45,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 498 transitions, 8321 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:45,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:45,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:45,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:47,557 INFO L124 PetriNetUnfolderBase]: 4851/7919 cut-off events. [2024-06-27 23:16:47,557 INFO L125 PetriNetUnfolderBase]: For 673089/673091 co-relation queries the response was YES. [2024-06-27 23:16:47,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69311 conditions, 7919 events. 4851/7919 cut-off events. For 673089/673091 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 53438 event pairs, 1207 based on Foata normal form. 6/7924 useless extension candidates. Maximal degree in co-relation 69179. Up to 7242 conditions per place. [2024-06-27 23:16:47,662 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 418 selfloop transitions, 98 changer transitions 0/521 dead transitions. [2024-06-27 23:16:47,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 521 transitions, 9643 flow [2024-06-27 23:16:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:16:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:16:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-27 23:16:47,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-27 23:16:47,663 INFO L175 Difference]: Start difference. First operand has 287 places, 498 transitions, 8321 flow. Second operand 8 states and 153 transitions. [2024-06-27 23:16:47,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 521 transitions, 9643 flow [2024-06-27 23:16:48,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 521 transitions, 9277 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-27 23:16:48,869 INFO L231 Difference]: Finished difference. Result has 287 places, 502 transitions, 8260 flow [2024-06-27 23:16:48,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7955, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8260, PETRI_PLACES=287, PETRI_TRANSITIONS=502} [2024-06-27 23:16:48,870 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 244 predicate places. [2024-06-27 23:16:48,870 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 502 transitions, 8260 flow [2024-06-27 23:16:48,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:16:48,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:48,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:48,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 23:16:48,870 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:48,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2056500162, now seen corresponding path program 2 times [2024-06-27 23:16:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:48,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154713257] [2024-06-27 23:16:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:48,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:50,072 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 23:16:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:50,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154713257] [2024-06-27 23:16:50,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154713257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:50,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:50,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:16:50,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202824602] [2024-06-27 23:16:50,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:50,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:16:50,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:16:50,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:16:50,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:50,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 502 transitions, 8260 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 23:16:50,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:50,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:50,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:51,913 INFO L124 PetriNetUnfolderBase]: 4871/7953 cut-off events. [2024-06-27 23:16:51,914 INFO L125 PetriNetUnfolderBase]: For 677272/677276 co-relation queries the response was YES. [2024-06-27 23:16:51,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68983 conditions, 7953 events. 4871/7953 cut-off events. For 677272/677276 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 53715 event pairs, 1196 based on Foata normal form. 6/7958 useless extension candidates. Maximal degree in co-relation 68850. Up to 7332 conditions per place. [2024-06-27 23:16:52,019 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 448 selfloop transitions, 79 changer transitions 0/532 dead transitions. [2024-06-27 23:16:52,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 532 transitions, 9500 flow [2024-06-27 23:16:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:16:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:16:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-27 23:16:52,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2024-06-27 23:16:52,021 INFO L175 Difference]: Start difference. First operand has 287 places, 502 transitions, 8260 flow. Second operand 9 states and 170 transitions. [2024-06-27 23:16:52,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 532 transitions, 9500 flow [2024-06-27 23:16:53,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 532 transitions, 9266 flow, removed 54 selfloop flow, removed 5 redundant places. [2024-06-27 23:16:53,235 INFO L231 Difference]: Finished difference. Result has 291 places, 510 transitions, 8331 flow [2024-06-27 23:16:53,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8026, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8331, PETRI_PLACES=291, PETRI_TRANSITIONS=510} [2024-06-27 23:16:53,236 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 248 predicate places. [2024-06-27 23:16:53,236 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 510 transitions, 8331 flow [2024-06-27 23:16:53,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 23:16:53,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:53,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:53,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 23:16:53,236 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:53,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:53,237 INFO L85 PathProgramCache]: Analyzing trace with hash 632854282, now seen corresponding path program 3 times [2024-06-27 23:16:53,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:53,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495291921] [2024-06-27 23:16:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:54,814 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 23:16:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495291921] [2024-06-27 23:16:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495291921] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:16:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490019327] [2024-06-27 23:16:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:54,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:16:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:16:54,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:16:54,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:54,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 510 transitions, 8331 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:16:54,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:54,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:54,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:56,605 INFO L124 PetriNetUnfolderBase]: 4907/8002 cut-off events. [2024-06-27 23:16:56,605 INFO L125 PetriNetUnfolderBase]: For 703138/703140 co-relation queries the response was YES. [2024-06-27 23:16:56,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70443 conditions, 8002 events. 4907/8002 cut-off events. For 703138/703140 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 53975 event pairs, 1207 based on Foata normal form. 4/8005 useless extension candidates. Maximal degree in co-relation 70309. Up to 7229 conditions per place. [2024-06-27 23:16:56,718 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 427 selfloop transitions, 108 changer transitions 0/540 dead transitions. [2024-06-27 23:16:56,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 540 transitions, 10015 flow [2024-06-27 23:16:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:16:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:16:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-27 23:16:56,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2024-06-27 23:16:56,720 INFO L175 Difference]: Start difference. First operand has 291 places, 510 transitions, 8331 flow. Second operand 9 states and 170 transitions. [2024-06-27 23:16:56,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 540 transitions, 10015 flow [2024-06-27 23:16:58,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 540 transitions, 9782 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-27 23:16:58,081 INFO L231 Difference]: Finished difference. Result has 294 places, 518 transitions, 8577 flow [2024-06-27 23:16:58,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8098, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8577, PETRI_PLACES=294, PETRI_TRANSITIONS=518} [2024-06-27 23:16:58,082 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 251 predicate places. [2024-06-27 23:16:58,082 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 518 transitions, 8577 flow [2024-06-27 23:16:58,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:16:58,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:58,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:58,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 23:16:58,082 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:58,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:58,083 INFO L85 PathProgramCache]: Analyzing trace with hash 78742116, now seen corresponding path program 1 times [2024-06-27 23:16:58,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:58,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37839125] [2024-06-27 23:16:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:58,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:59,577 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 23:16:59,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:59,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37839125] [2024-06-27 23:16:59,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37839125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:59,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:59,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:59,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991814450] [2024-06-27 23:16:59,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:59,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:59,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:59,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:59,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:59,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-27 23:16:59,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 518 transitions, 8577 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 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 23:16:59,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:59,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-27 23:16:59,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:01,467 INFO L124 PetriNetUnfolderBase]: 4690/7717 cut-off events. [2024-06-27 23:17:01,467 INFO L125 PetriNetUnfolderBase]: For 746986/747082 co-relation queries the response was YES. [2024-06-27 23:17:01,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69637 conditions, 7717 events. 4690/7717 cut-off events. For 746986/747082 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 53003 event pairs, 1527 based on Foata normal form. 50/7690 useless extension candidates. Maximal degree in co-relation 69501. Up to 7026 conditions per place. [2024-06-27 23:17:01,575 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 439 selfloop transitions, 37 changer transitions 0/537 dead transitions. [2024-06-27 23:17:01,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 537 transitions, 9667 flow [2024-06-27 23:17:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:17:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:17:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 23:17:01,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-27 23:17:01,576 INFO L175 Difference]: Start difference. First operand has 294 places, 518 transitions, 8577 flow. Second operand 8 states and 156 transitions. [2024-06-27 23:17:01,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 537 transitions, 9667 flow [2024-06-27 23:17:02,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 537 transitions, 9436 flow, removed 62 selfloop flow, removed 5 redundant places. [2024-06-27 23:17:02,913 INFO L231 Difference]: Finished difference. Result has 297 places, 521 transitions, 8524 flow [2024-06-27 23:17:02,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8346, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8524, PETRI_PLACES=297, PETRI_TRANSITIONS=521} [2024-06-27 23:17:02,914 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 254 predicate places. [2024-06-27 23:17:02,914 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 521 transitions, 8524 flow [2024-06-27 23:17:02,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 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 23:17:02,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:02,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:02,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 23:17:02,915 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:02,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1057153428, now seen corresponding path program 4 times [2024-06-27 23:17:02,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:02,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125081895] [2024-06-27 23:17:02,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:02,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:04,249 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 23:17:04,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:04,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125081895] [2024-06-27 23:17:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125081895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:04,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:04,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:17:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976184031] [2024-06-27 23:17:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:04,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:17:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:04,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:17:04,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:17:04,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:04,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 521 transitions, 8524 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:17:04,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:04,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:04,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:06,091 INFO L124 PetriNetUnfolderBase]: 4921/8022 cut-off events. [2024-06-27 23:17:06,091 INFO L125 PetriNetUnfolderBase]: For 737360/737362 co-relation queries the response was YES. [2024-06-27 23:17:06,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71903 conditions, 8022 events. 4921/8022 cut-off events. For 737360/737362 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 54142 event pairs, 1208 based on Foata normal form. 4/8025 useless extension candidates. Maximal degree in co-relation 71765. Up to 7329 conditions per place. [2024-06-27 23:17:06,211 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 440 selfloop transitions, 100 changer transitions 0/545 dead transitions. [2024-06-27 23:17:06,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 545 transitions, 9925 flow [2024-06-27 23:17:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:17:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:17:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 23:17:06,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 23:17:06,212 INFO L175 Difference]: Start difference. First operand has 297 places, 521 transitions, 8524 flow. Second operand 9 states and 168 transitions. [2024-06-27 23:17:06,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 545 transitions, 9925 flow [2024-06-27 23:17:07,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 545 transitions, 9773 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-27 23:17:07,587 INFO L231 Difference]: Finished difference. Result has 300 places, 525 transitions, 8697 flow [2024-06-27 23:17:07,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8372, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8697, PETRI_PLACES=300, PETRI_TRANSITIONS=525} [2024-06-27 23:17:07,587 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 257 predicate places. [2024-06-27 23:17:07,588 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 525 transitions, 8697 flow [2024-06-27 23:17:07,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:17:07,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:07,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:07,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 23:17:07,588 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:07,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash 166456803, now seen corresponding path program 4 times [2024-06-27 23:17:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:07,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175003910] [2024-06-27 23:17:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:09,008 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 23:17:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175003910] [2024-06-27 23:17:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175003910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:09,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:09,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:17:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145958313] [2024-06-27 23:17:09,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:09,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:17:09,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:09,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:17:09,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:17:09,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:09,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 525 transitions, 8697 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:17:09,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:09,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:09,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:11,240 INFO L124 PetriNetUnfolderBase]: 5016/8193 cut-off events. [2024-06-27 23:17:11,240 INFO L125 PetriNetUnfolderBase]: For 795760/795762 co-relation queries the response was YES. [2024-06-27 23:17:11,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73233 conditions, 8193 events. 5016/8193 cut-off events. For 795760/795762 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 55562 event pairs, 1152 based on Foata normal form. 18/8208 useless extension candidates. Maximal degree in co-relation 73094. Up to 6686 conditions per place. [2024-06-27 23:17:11,357 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 402 selfloop transitions, 158 changer transitions 0/565 dead transitions. [2024-06-27 23:17:11,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 565 transitions, 10130 flow [2024-06-27 23:17:11,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:17:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:17:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-27 23:17:11,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-27 23:17:11,359 INFO L175 Difference]: Start difference. First operand has 300 places, 525 transitions, 8697 flow. Second operand 10 states and 195 transitions. [2024-06-27 23:17:11,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 565 transitions, 10130 flow [2024-06-27 23:17:13,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 565 transitions, 9893 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-27 23:17:13,040 INFO L231 Difference]: Finished difference. Result has 304 places, 528 transitions, 8875 flow [2024-06-27 23:17:13,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8462, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8875, PETRI_PLACES=304, PETRI_TRANSITIONS=528} [2024-06-27 23:17:13,041 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 261 predicate places. [2024-06-27 23:17:13,041 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 528 transitions, 8875 flow [2024-06-27 23:17:13,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:17:13,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:13,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:13,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 23:17:13,041 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:13,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 161872833, now seen corresponding path program 5 times [2024-06-27 23:17:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:13,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527612257] [2024-06-27 23:17:13,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:13,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:14,437 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 23:17:14,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:14,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527612257] [2024-06-27 23:17:14,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527612257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:14,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:14,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:17:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760344827] [2024-06-27 23:17:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:14,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:17:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:14,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:17:14,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:17:14,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:14,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 528 transitions, 8875 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:17:14,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:14,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:14,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:16,880 INFO L124 PetriNetUnfolderBase]: 5111/8368 cut-off events. [2024-06-27 23:17:16,880 INFO L125 PetriNetUnfolderBase]: For 820186/820188 co-relation queries the response was YES. [2024-06-27 23:17:16,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74841 conditions, 8368 events. 5111/8368 cut-off events. For 820186/820188 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 57149 event pairs, 1165 based on Foata normal form. 18/8383 useless extension candidates. Maximal degree in co-relation 74701. Up to 6587 conditions per place. [2024-06-27 23:17:16,982 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 396 selfloop transitions, 170 changer transitions 0/571 dead transitions. [2024-06-27 23:17:16,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 571 transitions, 10350 flow [2024-06-27 23:17:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:17:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:17:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-06-27 23:17:16,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-27 23:17:16,984 INFO L175 Difference]: Start difference. First operand has 304 places, 528 transitions, 8875 flow. Second operand 10 states and 196 transitions. [2024-06-27 23:17:16,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 571 transitions, 10350 flow [2024-06-27 23:17:18,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 571 transitions, 9999 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-27 23:17:18,368 INFO L231 Difference]: Finished difference. Result has 307 places, 531 transitions, 8967 flow [2024-06-27 23:17:18,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8524, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8967, PETRI_PLACES=307, PETRI_TRANSITIONS=531} [2024-06-27 23:17:18,369 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 264 predicate places. [2024-06-27 23:17:18,369 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 531 transitions, 8967 flow [2024-06-27 23:17:18,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:17:18,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:18,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:18,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 23:17:18,370 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:18,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash 48369123, now seen corresponding path program 6 times [2024-06-27 23:17:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:18,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350151981] [2024-06-27 23:17:18,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:18,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:19,775 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 23:17:19,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:19,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350151981] [2024-06-27 23:17:19,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350151981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:19,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:19,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:17:19,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737679561] [2024-06-27 23:17:19,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:19,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:17:19,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:19,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:17:19,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:17:19,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:19,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 531 transitions, 8967 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:17:19,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:19,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:19,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:22,099 INFO L124 PetriNetUnfolderBase]: 5347/8808 cut-off events. [2024-06-27 23:17:22,099 INFO L125 PetriNetUnfolderBase]: For 871663/871665 co-relation queries the response was YES. [2024-06-27 23:17:22,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77935 conditions, 8808 events. 5347/8808 cut-off events. For 871663/871665 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 60972 event pairs, 1280 based on Foata normal form. 18/8823 useless extension candidates. Maximal degree in co-relation 77794. Up to 4513 conditions per place. [2024-06-27 23:17:22,221 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 363 selfloop transitions, 213 changer transitions 0/581 dead transitions. [2024-06-27 23:17:22,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 581 transitions, 10802 flow [2024-06-27 23:17:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:17:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:17:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-27 23:17:22,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46904761904761905 [2024-06-27 23:17:22,223 INFO L175 Difference]: Start difference. First operand has 307 places, 531 transitions, 8967 flow. Second operand 10 states and 197 transitions. [2024-06-27 23:17:22,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 581 transitions, 10802 flow [2024-06-27 23:17:23,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 581 transitions, 10404 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-27 23:17:23,913 INFO L231 Difference]: Finished difference. Result has 310 places, 539 transitions, 9333 flow [2024-06-27 23:17:23,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8569, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9333, PETRI_PLACES=310, PETRI_TRANSITIONS=539} [2024-06-27 23:17:23,914 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 267 predicate places. [2024-06-27 23:17:23,915 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 539 transitions, 9333 flow [2024-06-27 23:17:23,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:17:23,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:23,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:23,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 23:17:23,915 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:23,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash 425517201, now seen corresponding path program 7 times [2024-06-27 23:17:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:23,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320720295] [2024-06-27 23:17:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:25,314 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 23:17:25,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:25,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320720295] [2024-06-27 23:17:25,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320720295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:17:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625296941] [2024-06-27 23:17:25,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:25,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:17:25,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:25,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:17:25,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:17:25,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:25,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 539 transitions, 9333 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:17:25,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:25,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:25,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:27,678 INFO L124 PetriNetUnfolderBase]: 5415/8950 cut-off events. [2024-06-27 23:17:27,678 INFO L125 PetriNetUnfolderBase]: For 899374/899376 co-relation queries the response was YES. [2024-06-27 23:17:27,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80167 conditions, 8950 events. 5415/8950 cut-off events. For 899374/899376 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 62538 event pairs, 1305 based on Foata normal form. 18/8965 useless extension candidates. Maximal degree in co-relation 80024. Up to 5968 conditions per place. [2024-06-27 23:17:27,803 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 383 selfloop transitions, 196 changer transitions 0/584 dead transitions. [2024-06-27 23:17:27,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 584 transitions, 11073 flow [2024-06-27 23:17:27,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:17:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:17:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 200 transitions. [2024-06-27 23:17:27,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 23:17:27,805 INFO L175 Difference]: Start difference. First operand has 310 places, 539 transitions, 9333 flow. Second operand 10 states and 200 transitions. [2024-06-27 23:17:27,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 584 transitions, 11073 flow [2024-06-27 23:17:29,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 584 transitions, 10844 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-27 23:17:29,741 INFO L231 Difference]: Finished difference. Result has 314 places, 541 transitions, 9585 flow [2024-06-27 23:17:29,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9104, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9585, PETRI_PLACES=314, PETRI_TRANSITIONS=541} [2024-06-27 23:17:29,742 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 271 predicate places. [2024-06-27 23:17:29,742 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 541 transitions, 9585 flow [2024-06-27 23:17:29,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:17:29,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:29,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:29,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 23:17:29,743 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:29,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash 430101171, now seen corresponding path program 8 times [2024-06-27 23:17:29,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:29,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341207656] [2024-06-27 23:17:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:29,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:31,123 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 23:17:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341207656] [2024-06-27 23:17:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341207656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:31,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:31,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:17:31,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393451065] [2024-06-27 23:17:31,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:31,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:17:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:17:31,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:17:31,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:31,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 541 transitions, 9585 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:17:31,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:31,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:31,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:33,540 INFO L124 PetriNetUnfolderBase]: 5483/9094 cut-off events. [2024-06-27 23:17:33,541 INFO L125 PetriNetUnfolderBase]: For 923971/923973 co-relation queries the response was YES. [2024-06-27 23:17:33,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81960 conditions, 9094 events. 5483/9094 cut-off events. For 923971/923973 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 64071 event pairs, 1408 based on Foata normal form. 18/9109 useless extension candidates. Maximal degree in co-relation 81815. Up to 7524 conditions per place. [2024-06-27 23:17:33,670 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 413 selfloop transitions, 164 changer transitions 0/582 dead transitions. [2024-06-27 23:17:33,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 582 transitions, 11071 flow [2024-06-27 23:17:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:17:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:17:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-06-27 23:17:33,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-27 23:17:33,672 INFO L175 Difference]: Start difference. First operand has 314 places, 541 transitions, 9585 flow. Second operand 10 states and 196 transitions. [2024-06-27 23:17:33,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 582 transitions, 11071 flow [2024-06-27 23:17:35,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 582 transitions, 10569 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-06-27 23:17:35,462 INFO L231 Difference]: Finished difference. Result has 316 places, 543 transitions, 9508 flow [2024-06-27 23:17:35,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9087, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9508, PETRI_PLACES=316, PETRI_TRANSITIONS=543} [2024-06-27 23:17:35,463 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 273 predicate places. [2024-06-27 23:17:35,463 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 543 transitions, 9508 flow [2024-06-27 23:17:35,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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 23:17:35,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:35,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:35,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 23:17:35,464 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:35,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:35,464 INFO L85 PathProgramCache]: Analyzing trace with hash 596334951, now seen corresponding path program 9 times [2024-06-27 23:17:35,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:35,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622113199] [2024-06-27 23:17:35,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:35,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:36,983 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 23:17:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622113199] [2024-06-27 23:17:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622113199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:36,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:36,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:17:36,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29026200] [2024-06-27 23:17:36,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:36,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:17:36,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:36,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:17:36,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:17:37,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:37,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 543 transitions, 9508 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:17:37,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:37,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:37,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:39,822 INFO L124 PetriNetUnfolderBase]: 5578/9284 cut-off events. [2024-06-27 23:17:39,822 INFO L125 PetriNetUnfolderBase]: For 960679/960681 co-relation queries the response was YES. [2024-06-27 23:17:39,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82624 conditions, 9284 events. 5578/9284 cut-off events. For 960679/960681 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 65950 event pairs, 1444 based on Foata normal form. 24/9305 useless extension candidates. Maximal degree in co-relation 82478. Up to 7584 conditions per place. [2024-06-27 23:17:39,935 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 427 selfloop transitions, 156 changer transitions 0/588 dead transitions. [2024-06-27 23:17:39,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 588 transitions, 11073 flow [2024-06-27 23:17:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:17:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:17:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-27 23:17:39,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4588744588744589 [2024-06-27 23:17:39,936 INFO L175 Difference]: Start difference. First operand has 316 places, 543 transitions, 9508 flow. Second operand 11 states and 212 transitions. [2024-06-27 23:17:39,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 588 transitions, 11073 flow [2024-06-27 23:17:41,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 588 transitions, 10628 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-06-27 23:17:41,649 INFO L231 Difference]: Finished difference. Result has 318 places, 546 transitions, 9516 flow [2024-06-27 23:17:41,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9063, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9516, PETRI_PLACES=318, PETRI_TRANSITIONS=546} [2024-06-27 23:17:41,649 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 275 predicate places. [2024-06-27 23:17:41,650 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 546 transitions, 9516 flow [2024-06-27 23:17:41,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:17:41,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:41,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:41,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 23:17:41,650 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:41,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash -259812892, now seen corresponding path program 3 times [2024-06-27 23:17:41,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:41,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38543272] [2024-06-27 23:17:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:41,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:42,492 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 23:17:42,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38543272] [2024-06-27 23:17:42,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38543272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:42,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:42,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:17:42,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729370794] [2024-06-27 23:17:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:42,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:17:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:42,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:17:42,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:17:42,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:42,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 546 transitions, 9516 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:17:42,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:42,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:42,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:44,794 INFO L124 PetriNetUnfolderBase]: 5590/9298 cut-off events. [2024-06-27 23:17:44,794 INFO L125 PetriNetUnfolderBase]: For 919678/919680 co-relation queries the response was YES. [2024-06-27 23:17:44,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82684 conditions, 9298 events. 5590/9298 cut-off events. For 919678/919680 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 66047 event pairs, 1618 based on Foata normal form. 6/9301 useless extension candidates. Maximal degree in co-relation 82537. Up to 8550 conditions per place. [2024-06-27 23:17:44,915 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 496 selfloop transitions, 67 changer transitions 0/568 dead transitions. [2024-06-27 23:17:44,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 568 transitions, 10874 flow [2024-06-27 23:17:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:17:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:17:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 23:17:44,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-27 23:17:44,916 INFO L175 Difference]: Start difference. First operand has 318 places, 546 transitions, 9516 flow. Second operand 8 states and 147 transitions. [2024-06-27 23:17:44,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 568 transitions, 10874 flow [2024-06-27 23:17:46,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 568 transitions, 10484 flow, removed 43 selfloop flow, removed 9 redundant places. [2024-06-27 23:17:46,717 INFO L231 Difference]: Finished difference. Result has 317 places, 553 transitions, 9458 flow [2024-06-27 23:17:46,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9126, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9458, PETRI_PLACES=317, PETRI_TRANSITIONS=553} [2024-06-27 23:17:46,718 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 274 predicate places. [2024-06-27 23:17:46,718 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 553 transitions, 9458 flow [2024-06-27 23:17:46,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:17:46,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:46,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:46,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 23:17:46,719 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:46,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1201225800, now seen corresponding path program 4 times [2024-06-27 23:17:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463367204] [2024-06-27 23:17:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:47,580 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 23:17:47,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:47,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463367204] [2024-06-27 23:17:47,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463367204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:47,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:47,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:17:47,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825436365] [2024-06-27 23:17:47,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:47,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:17:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:47,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:17:47,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:17:47,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:47,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 553 transitions, 9458 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:17:47,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:47,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:47,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:49,839 INFO L124 PetriNetUnfolderBase]: 5592/9301 cut-off events. [2024-06-27 23:17:49,839 INFO L125 PetriNetUnfolderBase]: For 918442/918444 co-relation queries the response was YES. [2024-06-27 23:17:49,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81937 conditions, 9301 events. 5592/9301 cut-off events. For 918442/918444 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 66061 event pairs, 1533 based on Foata normal form. 4/9302 useless extension candidates. Maximal degree in co-relation 81789. Up to 8479 conditions per place. [2024-06-27 23:17:49,962 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 472 selfloop transitions, 92 changer transitions 0/569 dead transitions. [2024-06-27 23:17:49,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 569 transitions, 10868 flow [2024-06-27 23:17:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:17:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:17:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-27 23:17:49,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-27 23:17:49,963 INFO L175 Difference]: Start difference. First operand has 317 places, 553 transitions, 9458 flow. Second operand 7 states and 136 transitions. [2024-06-27 23:17:49,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 569 transitions, 10868 flow [2024-06-27 23:17:52,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 569 transitions, 10647 flow, removed 51 selfloop flow, removed 6 redundant places. [2024-06-27 23:17:52,195 INFO L231 Difference]: Finished difference. Result has 318 places, 556 transitions, 9516 flow [2024-06-27 23:17:52,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9237, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9516, PETRI_PLACES=318, PETRI_TRANSITIONS=556} [2024-06-27 23:17:52,195 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 275 predicate places. [2024-06-27 23:17:52,195 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 556 transitions, 9516 flow [2024-06-27 23:17:52,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:17:52,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:52,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:52,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 23:17:52,196 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:52,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash -944798161, now seen corresponding path program 2 times [2024-06-27 23:17:52,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:52,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270631409] [2024-06-27 23:17:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:52,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:53,828 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 23:17:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270631409] [2024-06-27 23:17:53,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270631409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:53,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:53,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:17:53,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476014640] [2024-06-27 23:17:53,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:53,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:17:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:17:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:17:53,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:53,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 556 transitions, 9516 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:17:53,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:53,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:53,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:56,633 INFO L124 PetriNetUnfolderBase]: 5687/9491 cut-off events. [2024-06-27 23:17:56,633 INFO L125 PetriNetUnfolderBase]: For 1008391/1008393 co-relation queries the response was YES. [2024-06-27 23:17:56,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83510 conditions, 9491 events. 5687/9491 cut-off events. For 1008391/1008393 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 67998 event pairs, 1477 based on Foata normal form. 24/9512 useless extension candidates. Maximal degree in co-relation 83361. Up to 7539 conditions per place. [2024-06-27 23:17:56,777 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 447 selfloop transitions, 167 changer transitions 0/619 dead transitions. [2024-06-27 23:17:56,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 619 transitions, 11409 flow [2024-06-27 23:17:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 23:17:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 23:17:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 245 transitions. [2024-06-27 23:17:56,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2024-06-27 23:17:56,779 INFO L175 Difference]: Start difference. First operand has 318 places, 556 transitions, 9516 flow. Second operand 13 states and 245 transitions. [2024-06-27 23:17:56,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 619 transitions, 11409 flow [2024-06-27 23:17:58,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 619 transitions, 11227 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-27 23:17:58,749 INFO L231 Difference]: Finished difference. Result has 330 places, 572 transitions, 10126 flow [2024-06-27 23:17:58,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9334, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10126, PETRI_PLACES=330, PETRI_TRANSITIONS=572} [2024-06-27 23:17:58,750 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 287 predicate places. [2024-06-27 23:17:58,750 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 572 transitions, 10126 flow [2024-06-27 23:17:58,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:17:58,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:58,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:58,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 23:17:58,750 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:58,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1191045214, now seen corresponding path program 5 times [2024-06-27 23:17:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152387180] [2024-06-27 23:17:58,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:00,396 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 23:18:00,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:00,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152387180] [2024-06-27 23:18:00,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152387180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:00,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:00,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:18:00,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221465969] [2024-06-27 23:18:00,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:00,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:18:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:00,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:18:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:18:00,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:00,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 572 transitions, 10126 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:18:00,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:00,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:00,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:02,655 INFO L124 PetriNetUnfolderBase]: 5712/9525 cut-off events. [2024-06-27 23:18:02,656 INFO L125 PetriNetUnfolderBase]: For 973375/973377 co-relation queries the response was YES. [2024-06-27 23:18:02,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85071 conditions, 9525 events. 5712/9525 cut-off events. For 973375/973377 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 68262 event pairs, 1615 based on Foata normal form. 4/9526 useless extension candidates. Maximal degree in co-relation 84918. Up to 8731 conditions per place. [2024-06-27 23:18:02,810 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 513 selfloop transitions, 81 changer transitions 0/599 dead transitions. [2024-06-27 23:18:02,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 599 transitions, 11541 flow [2024-06-27 23:18:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:18:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:18:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 23:18:02,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312169312169312 [2024-06-27 23:18:02,812 INFO L175 Difference]: Start difference. First operand has 330 places, 572 transitions, 10126 flow. Second operand 9 states and 163 transitions. [2024-06-27 23:18:02,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 599 transitions, 11541 flow [2024-06-27 23:18:05,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 599 transitions, 11075 flow, removed 55 selfloop flow, removed 12 redundant places. [2024-06-27 23:18:05,321 INFO L231 Difference]: Finished difference. Result has 327 places, 583 transitions, 10040 flow [2024-06-27 23:18:05,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9660, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10040, PETRI_PLACES=327, PETRI_TRANSITIONS=583} [2024-06-27 23:18:05,322 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 284 predicate places. [2024-06-27 23:18:05,322 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 583 transitions, 10040 flow [2024-06-27 23:18:05,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:18:05,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:05,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:05,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 23:18:05,322 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:05,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash -259567248, now seen corresponding path program 6 times [2024-06-27 23:18:05,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:05,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459447362] [2024-06-27 23:18:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:05,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:06,698 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 23:18:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459447362] [2024-06-27 23:18:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459447362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:06,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:06,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:18:06,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269079645] [2024-06-27 23:18:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:06,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:18:06,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:06,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:18:06,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:18:06,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:06,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 583 transitions, 10040 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:18:06,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:06,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:06,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:08,945 INFO L124 PetriNetUnfolderBase]: 5786/9634 cut-off events. [2024-06-27 23:18:08,945 INFO L125 PetriNetUnfolderBase]: For 1006388/1006390 co-relation queries the response was YES. [2024-06-27 23:18:09,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86213 conditions, 9634 events. 5786/9634 cut-off events. For 1006388/1006390 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 69020 event pairs, 1571 based on Foata normal form. 4/9635 useless extension candidates. Maximal degree in co-relation 86062. Up to 8673 conditions per place. [2024-06-27 23:18:09,092 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 499 selfloop transitions, 115 changer transitions 0/619 dead transitions. [2024-06-27 23:18:09,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 619 transitions, 12103 flow [2024-06-27 23:18:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:18:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:18:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 23:18:09,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312169312169312 [2024-06-27 23:18:09,093 INFO L175 Difference]: Start difference. First operand has 327 places, 583 transitions, 10040 flow. Second operand 9 states and 163 transitions. [2024-06-27 23:18:09,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 619 transitions, 12103 flow [2024-06-27 23:18:11,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 619 transitions, 11724 flow, removed 46 selfloop flow, removed 10 redundant places. [2024-06-27 23:18:11,761 INFO L231 Difference]: Finished difference. Result has 327 places, 602 transitions, 10366 flow [2024-06-27 23:18:11,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9661, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10366, PETRI_PLACES=327, PETRI_TRANSITIONS=602} [2024-06-27 23:18:11,761 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 284 predicate places. [2024-06-27 23:18:11,761 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 602 transitions, 10366 flow [2024-06-27 23:18:11,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:18:11,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:11,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:11,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 23:18:11,762 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:11,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1201222204, now seen corresponding path program 7 times [2024-06-27 23:18:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705243136] [2024-06-27 23:18:11,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:13,243 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 23:18:13,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:13,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705243136] [2024-06-27 23:18:13,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705243136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:13,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:18:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061840841] [2024-06-27 23:18:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:13,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:18:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:18:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:18:13,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:13,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 602 transitions, 10366 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:18:13,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:13,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:13,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:15,768 INFO L124 PetriNetUnfolderBase]: 5790/9640 cut-off events. [2024-06-27 23:18:15,768 INFO L125 PetriNetUnfolderBase]: For 1028607/1028609 co-relation queries the response was YES. [2024-06-27 23:18:15,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87192 conditions, 9640 events. 5790/9640 cut-off events. For 1028607/1028609 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 69099 event pairs, 1571 based on Foata normal form. 4/9641 useless extension candidates. Maximal degree in co-relation 87040. Up to 8770 conditions per place. [2024-06-27 23:18:15,905 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 514 selfloop transitions, 102 changer transitions 0/621 dead transitions. [2024-06-27 23:18:15,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 621 transitions, 11959 flow [2024-06-27 23:18:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:18:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:18:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 23:18:15,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-27 23:18:15,906 INFO L175 Difference]: Start difference. First operand has 327 places, 602 transitions, 10366 flow. Second operand 9 states and 161 transitions. [2024-06-27 23:18:15,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 621 transitions, 11959 flow [2024-06-27 23:18:17,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 621 transitions, 11710 flow, removed 75 selfloop flow, removed 5 redundant places. [2024-06-27 23:18:17,933 INFO L231 Difference]: Finished difference. Result has 331 places, 607 transitions, 10488 flow [2024-06-27 23:18:17,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10131, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10488, PETRI_PLACES=331, PETRI_TRANSITIONS=607} [2024-06-27 23:18:17,934 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 288 predicate places. [2024-06-27 23:18:17,934 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 607 transitions, 10488 flow [2024-06-27 23:18:17,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:18:17,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:17,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:17,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 23:18:17,935 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:17,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:17,935 INFO L85 PathProgramCache]: Analyzing trace with hash 486480901, now seen corresponding path program 10 times [2024-06-27 23:18:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:17,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892767097] [2024-06-27 23:18:17,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:17,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:19,700 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 23:18:19,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:19,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892767097] [2024-06-27 23:18:19,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892767097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:18:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118402272] [2024-06-27 23:18:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:19,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:18:19,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:19,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:18:19,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:18:19,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:19,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 607 transitions, 10488 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:18:19,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:19,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:19,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:22,619 INFO L124 PetriNetUnfolderBase]: 5885/9800 cut-off events. [2024-06-27 23:18:22,620 INFO L125 PetriNetUnfolderBase]: For 1124633/1124633 co-relation queries the response was YES. [2024-06-27 23:18:22,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88802 conditions, 9800 events. 5885/9800 cut-off events. For 1124633/1124633 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 70462 event pairs, 1474 based on Foata normal form. 24/9821 useless extension candidates. Maximal degree in co-relation 88648. Up to 8171 conditions per place. [2024-06-27 23:18:22,764 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 470 selfloop transitions, 176 changer transitions 0/651 dead transitions. [2024-06-27 23:18:22,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 651 transitions, 12180 flow [2024-06-27 23:18:22,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:18:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:18:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2024-06-27 23:18:22,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2024-06-27 23:18:22,765 INFO L175 Difference]: Start difference. First operand has 331 places, 607 transitions, 10488 flow. Second operand 11 states and 211 transitions. [2024-06-27 23:18:22,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 651 transitions, 12180 flow [2024-06-27 23:18:25,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 651 transitions, 11864 flow, removed 51 selfloop flow, removed 8 redundant places. [2024-06-27 23:18:25,377 INFO L231 Difference]: Finished difference. Result has 334 places, 610 transitions, 10669 flow [2024-06-27 23:18:25,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10172, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10669, PETRI_PLACES=334, PETRI_TRANSITIONS=610} [2024-06-27 23:18:25,378 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 291 predicate places. [2024-06-27 23:18:25,378 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 610 transitions, 10669 flow [2024-06-27 23:18:25,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:18:25,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:25,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:25,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 23:18:25,378 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:25,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:25,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1713273519, now seen corresponding path program 11 times [2024-06-27 23:18:25,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:25,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798137959] [2024-06-27 23:18:25,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:25,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:26,964 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 23:18:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798137959] [2024-06-27 23:18:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798137959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:26,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:26,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:18:26,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811480068] [2024-06-27 23:18:26,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:26,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:18:26,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:26,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:18:26,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:18:27,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:27,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 610 transitions, 10669 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:18:27,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:27,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:27,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:29,889 INFO L124 PetriNetUnfolderBase]: 5839/9760 cut-off events. [2024-06-27 23:18:29,889 INFO L125 PetriNetUnfolderBase]: For 1069105/1069105 co-relation queries the response was YES. [2024-06-27 23:18:29,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86952 conditions, 9760 events. 5839/9760 cut-off events. For 1069105/1069105 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 70564 event pairs, 1521 based on Foata normal form. 24/9781 useless extension candidates. Maximal degree in co-relation 86797. Up to 8101 conditions per place. [2024-06-27 23:18:30,032 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 471 selfloop transitions, 180 changer transitions 0/656 dead transitions. [2024-06-27 23:18:30,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 656 transitions, 12267 flow [2024-06-27 23:18:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:18:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:18:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 228 transitions. [2024-06-27 23:18:30,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 23:18:30,034 INFO L175 Difference]: Start difference. First operand has 334 places, 610 transitions, 10669 flow. Second operand 12 states and 228 transitions. [2024-06-27 23:18:30,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 656 transitions, 12267 flow [2024-06-27 23:18:32,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 656 transitions, 11777 flow, removed 72 selfloop flow, removed 9 redundant places. [2024-06-27 23:18:32,493 INFO L231 Difference]: Finished difference. Result has 337 places, 610 transitions, 10549 flow [2024-06-27 23:18:32,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10179, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10549, PETRI_PLACES=337, PETRI_TRANSITIONS=610} [2024-06-27 23:18:32,494 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 294 predicate places. [2024-06-27 23:18:32,494 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 610 transitions, 10549 flow [2024-06-27 23:18:32,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:18:32,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:32,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:32,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 23:18:32,495 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:32,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1904297912, now seen corresponding path program 5 times [2024-06-27 23:18:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:32,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704302481] [2024-06-27 23:18:32,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:33,354 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 23:18:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704302481] [2024-06-27 23:18:33,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704302481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:33,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:33,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:18:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812379746] [2024-06-27 23:18:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:33,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:18:33,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:33,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:18:33,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:18:33,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:33,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 610 transitions, 10549 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:18:33,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:33,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:33,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:35,705 INFO L124 PetriNetUnfolderBase]: 5825/9725 cut-off events. [2024-06-27 23:18:35,706 INFO L125 PetriNetUnfolderBase]: For 995365/995365 co-relation queries the response was YES. [2024-06-27 23:18:35,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86022 conditions, 9725 events. 5825/9725 cut-off events. For 995365/995365 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 70072 event pairs, 1711 based on Foata normal form. 2/9724 useless extension candidates. Maximal degree in co-relation 85866. Up to 8941 conditions per place. [2024-06-27 23:18:35,841 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 552 selfloop transitions, 68 changer transitions 0/625 dead transitions. [2024-06-27 23:18:35,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 625 transitions, 11856 flow [2024-06-27 23:18:35,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:18:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:18:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 23:18:35,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557823129251701 [2024-06-27 23:18:35,842 INFO L175 Difference]: Start difference. First operand has 337 places, 610 transitions, 10549 flow. Second operand 7 states and 134 transitions. [2024-06-27 23:18:35,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 625 transitions, 11856 flow [2024-06-27 23:18:38,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 625 transitions, 11152 flow, removed 52 selfloop flow, removed 12 redundant places. [2024-06-27 23:18:38,416 INFO L231 Difference]: Finished difference. Result has 332 places, 610 transitions, 9991 flow [2024-06-27 23:18:38,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9845, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9991, PETRI_PLACES=332, PETRI_TRANSITIONS=610} [2024-06-27 23:18:38,417 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 289 predicate places. [2024-06-27 23:18:38,417 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 610 transitions, 9991 flow [2024-06-27 23:18:38,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:18:38,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:38,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:38,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 23:18:38,417 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:38,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:38,418 INFO L85 PathProgramCache]: Analyzing trace with hash -82265662, now seen corresponding path program 6 times [2024-06-27 23:18:38,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:38,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574560668] [2024-06-27 23:18:38,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:38,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:39,324 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 23:18:39,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:39,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574560668] [2024-06-27 23:18:39,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574560668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:39,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:39,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:18:39,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969587236] [2024-06-27 23:18:39,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:39,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:18:39,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:39,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:18:39,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:18:39,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:39,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 610 transitions, 9991 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:18:39,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:39,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:39,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:41,519 INFO L124 PetriNetUnfolderBase]: 5830/9732 cut-off events. [2024-06-27 23:18:41,519 INFO L125 PetriNetUnfolderBase]: For 1000131/1000131 co-relation queries the response was YES. [2024-06-27 23:18:41,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84093 conditions, 9732 events. 5830/9732 cut-off events. For 1000131/1000131 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 70158 event pairs, 1709 based on Foata normal form. 1/9730 useless extension candidates. Maximal degree in co-relation 83937. Up to 8918 conditions per place. [2024-06-27 23:18:41,668 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 531 selfloop transitions, 89 changer transitions 0/625 dead transitions. [2024-06-27 23:18:41,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 625 transitions, 11341 flow [2024-06-27 23:18:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:18:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:18:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 23:18:41,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-27 23:18:41,669 INFO L175 Difference]: Start difference. First operand has 332 places, 610 transitions, 9991 flow. Second operand 8 states and 143 transitions. [2024-06-27 23:18:41,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 625 transitions, 11341 flow [2024-06-27 23:18:44,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 625 transitions, 11055 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-27 23:18:44,218 INFO L231 Difference]: Finished difference. Result has 333 places, 613 transitions, 9967 flow [2024-06-27 23:18:44,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9705, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9967, PETRI_PLACES=333, PETRI_TRANSITIONS=613} [2024-06-27 23:18:44,218 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 290 predicate places. [2024-06-27 23:18:44,218 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 613 transitions, 9967 flow [2024-06-27 23:18:44,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:18:44,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:44,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:44,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 23:18:44,219 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:44,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:44,219 INFO L85 PathProgramCache]: Analyzing trace with hash 219371592, now seen corresponding path program 7 times [2024-06-27 23:18:44,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:44,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458123369] [2024-06-27 23:18:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:44,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:45,215 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 23:18:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:45,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458123369] [2024-06-27 23:18:45,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458123369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:45,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:45,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:18:45,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277928522] [2024-06-27 23:18:45,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:45,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:18:45,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:45,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:18:45,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:18:45,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:45,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 613 transitions, 9967 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:18:45,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:45,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:45,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:47,374 INFO L124 PetriNetUnfolderBase]: 5835/9747 cut-off events. [2024-06-27 23:18:47,375 INFO L125 PetriNetUnfolderBase]: For 1019084/1019086 co-relation queries the response was YES. [2024-06-27 23:18:47,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84346 conditions, 9747 events. 5835/9747 cut-off events. For 1019084/1019086 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 70306 event pairs, 1594 based on Foata normal form. 3/9747 useless extension candidates. Maximal degree in co-relation 84189. Up to 8792 conditions per place. [2024-06-27 23:18:47,523 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 485 selfloop transitions, 136 changer transitions 0/626 dead transitions. [2024-06-27 23:18:47,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 626 transitions, 11501 flow [2024-06-27 23:18:47,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:18:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:18:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-27 23:18:47,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-27 23:18:47,525 INFO L175 Difference]: Start difference. First operand has 333 places, 613 transitions, 9967 flow. Second operand 8 states and 142 transitions. [2024-06-27 23:18:47,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 626 transitions, 11501 flow [2024-06-27 23:18:49,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 626 transitions, 11217 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-27 23:18:49,789 INFO L231 Difference]: Finished difference. Result has 334 places, 616 transitions, 10039 flow [2024-06-27 23:18:49,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9683, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10039, PETRI_PLACES=334, PETRI_TRANSITIONS=616} [2024-06-27 23:18:49,790 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 291 predicate places. [2024-06-27 23:18:49,790 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 616 transitions, 10039 flow [2024-06-27 23:18:49,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:18:49,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:49,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:49,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 23:18:49,790 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:49,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash 213657672, now seen corresponding path program 8 times [2024-06-27 23:18:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218469291] [2024-06-27 23:18:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:50,740 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 23:18:50,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:50,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218469291] [2024-06-27 23:18:50,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218469291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:50,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:50,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:18:50,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275172514] [2024-06-27 23:18:50,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:50,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:18:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:50,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:18:50,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:18:50,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:50,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 616 transitions, 10039 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:18:50,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:50,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:50,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:52,874 INFO L124 PetriNetUnfolderBase]: 5827/9737 cut-off events. [2024-06-27 23:18:52,874 INFO L125 PetriNetUnfolderBase]: For 1033119/1033121 co-relation queries the response was YES. [2024-06-27 23:18:52,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84299 conditions, 9737 events. 5827/9737 cut-off events. For 1033119/1033121 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 70285 event pairs, 1595 based on Foata normal form. 4/9738 useless extension candidates. Maximal degree in co-relation 84141. Up to 8784 conditions per place. [2024-06-27 23:18:53,023 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 499 selfloop transitions, 121 changer transitions 0/625 dead transitions. [2024-06-27 23:18:53,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 625 transitions, 11305 flow [2024-06-27 23:18:53,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:18:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:18:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 23:18:53,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-27 23:18:53,024 INFO L175 Difference]: Start difference. First operand has 334 places, 616 transitions, 10039 flow. Second operand 7 states and 132 transitions. [2024-06-27 23:18:53,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 625 transitions, 11305 flow [2024-06-27 23:18:55,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 625 transitions, 10941 flow, removed 65 selfloop flow, removed 5 redundant places. [2024-06-27 23:18:56,005 INFO L231 Difference]: Finished difference. Result has 336 places, 616 transitions, 9925 flow [2024-06-27 23:18:56,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9675, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9925, PETRI_PLACES=336, PETRI_TRANSITIONS=616} [2024-06-27 23:18:56,006 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 293 predicate places. [2024-06-27 23:18:56,006 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 616 transitions, 9925 flow [2024-06-27 23:18:56,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 23:18:56,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:56,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:56,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 23:18:56,006 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:56,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1186151363, now seen corresponding path program 3 times [2024-06-27 23:18:56,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:56,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894289960] [2024-06-27 23:18:56,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:56,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:57,490 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 23:18:57,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894289960] [2024-06-27 23:18:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894289960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:57,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:57,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:18:57,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682414048] [2024-06-27 23:18:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:57,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:18:57,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:57,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:18:57,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:18:57,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:57,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 616 transitions, 9925 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:18:57,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:57,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:57,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:00,521 INFO L124 PetriNetUnfolderBase]: 5922/9901 cut-off events. [2024-06-27 23:19:00,522 INFO L125 PetriNetUnfolderBase]: For 1136490/1136490 co-relation queries the response was YES. [2024-06-27 23:19:00,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85767 conditions, 9901 events. 5922/9901 cut-off events. For 1136490/1136490 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 71891 event pairs, 1498 based on Foata normal form. 24/9922 useless extension candidates. Maximal degree in co-relation 85608. Up to 8261 conditions per place. [2024-06-27 23:19:00,673 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 488 selfloop transitions, 185 changer transitions 0/678 dead transitions. [2024-06-27 23:19:00,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 678 transitions, 11916 flow [2024-06-27 23:19:00,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 23:19:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 23:19:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 243 transitions. [2024-06-27 23:19:00,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44505494505494503 [2024-06-27 23:19:00,675 INFO L175 Difference]: Start difference. First operand has 336 places, 616 transitions, 9925 flow. Second operand 13 states and 243 transitions. [2024-06-27 23:19:00,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 678 transitions, 11916 flow [2024-06-27 23:19:03,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 678 transitions, 11630 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 23:19:03,973 INFO L231 Difference]: Finished difference. Result has 344 places, 630 transitions, 10404 flow [2024-06-27 23:19:03,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9639, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10404, PETRI_PLACES=344, PETRI_TRANSITIONS=630} [2024-06-27 23:19:03,973 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 301 predicate places. [2024-06-27 23:19:03,973 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 630 transitions, 10404 flow [2024-06-27 23:19:03,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:19:03,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:03,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:03,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 23:19:03,974 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:03,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2063271503, now seen corresponding path program 4 times [2024-06-27 23:19:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:03,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177406145] [2024-06-27 23:19:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:03,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:05,624 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 23:19:05,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:05,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177406145] [2024-06-27 23:19:05,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177406145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:05,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:05,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:19:05,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372827272] [2024-06-27 23:19:05,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:05,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:19:05,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:19:05,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:19:05,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:19:05,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 630 transitions, 10404 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:19:05,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:05,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:19:05,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:09,054 INFO L124 PetriNetUnfolderBase]: 6214/10457 cut-off events. [2024-06-27 23:19:09,054 INFO L125 PetriNetUnfolderBase]: For 1180472/1180472 co-relation queries the response was YES. [2024-06-27 23:19:09,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90379 conditions, 10457 events. 6214/10457 cut-off events. For 1180472/1180472 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 77545 event pairs, 1702 based on Foata normal form. 24/10478 useless extension candidates. Maximal degree in co-relation 90217. Up to 8734 conditions per place. [2024-06-27 23:19:09,211 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 496 selfloop transitions, 198 changer transitions 0/699 dead transitions. [2024-06-27 23:19:09,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 699 transitions, 12518 flow [2024-06-27 23:19:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 23:19:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 23:19:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 262 transitions. [2024-06-27 23:19:09,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-27 23:19:09,212 INFO L175 Difference]: Start difference. First operand has 344 places, 630 transitions, 10404 flow. Second operand 14 states and 262 transitions. [2024-06-27 23:19:09,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 699 transitions, 12518 flow [2024-06-27 23:19:12,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 699 transitions, 12036 flow, removed 58 selfloop flow, removed 9 redundant places. [2024-06-27 23:19:12,525 INFO L231 Difference]: Finished difference. Result has 351 places, 647 transitions, 10800 flow [2024-06-27 23:19:12,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9940, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10800, PETRI_PLACES=351, PETRI_TRANSITIONS=647} [2024-06-27 23:19:12,525 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 308 predicate places. [2024-06-27 23:19:12,525 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 647 transitions, 10800 flow [2024-06-27 23:19:12,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:19:12,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:12,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:12,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 23:19:12,526 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:12,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2101619211, now seen corresponding path program 5 times [2024-06-27 23:19:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397839110] [2024-06-27 23:19:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:12,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:14,091 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 23:19:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397839110] [2024-06-27 23:19:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397839110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:14,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:14,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:19:14,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905720807] [2024-06-27 23:19:14,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:14,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:19:14,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:14,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:19:14,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:19:14,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:19:14,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 647 transitions, 10800 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:19:14,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:14,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:19:14,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:17,132 INFO L124 PetriNetUnfolderBase]: 6168/10385 cut-off events. [2024-06-27 23:19:17,133 INFO L125 PetriNetUnfolderBase]: For 1105400/1105400 co-relation queries the response was YES. [2024-06-27 23:19:17,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87703 conditions, 10385 events. 6168/10385 cut-off events. For 1105400/1105400 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 76913 event pairs, 1639 based on Foata normal form. 24/10406 useless extension candidates. Maximal degree in co-relation 87538. Up to 8664 conditions per place. [2024-06-27 23:19:17,293 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 494 selfloop transitions, 212 changer transitions 0/711 dead transitions. [2024-06-27 23:19:17,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 711 transitions, 12737 flow [2024-06-27 23:19:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 23:19:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 23:19:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 260 transitions. [2024-06-27 23:19:17,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-27 23:19:17,295 INFO L175 Difference]: Start difference. First operand has 351 places, 647 transitions, 10800 flow. Second operand 14 states and 260 transitions. [2024-06-27 23:19:17,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 711 transitions, 12737 flow [2024-06-27 23:19:20,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 711 transitions, 12209 flow, removed 71 selfloop flow, removed 10 redundant places. [2024-06-27 23:19:20,937 INFO L231 Difference]: Finished difference. Result has 356 places, 657 transitions, 10941 flow [2024-06-27 23:19:20,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10284, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10941, PETRI_PLACES=356, PETRI_TRANSITIONS=657} [2024-06-27 23:19:20,938 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 313 predicate places. [2024-06-27 23:19:20,938 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 657 transitions, 10941 flow [2024-06-27 23:19:20,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:19:20,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:20,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:20,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 23:19:20,938 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:20,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:20,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1720071921, now seen corresponding path program 6 times [2024-06-27 23:19:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875448053] [2024-06-27 23:19:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:22,656 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 23:19:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:22,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875448053] [2024-06-27 23:19:22,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875448053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:22,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:22,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:19:22,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052348636] [2024-06-27 23:19:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:22,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:19:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:22,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:19:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:19:22,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:19:22,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 657 transitions, 10941 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:19:22,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:22,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:19:22,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:25,540 INFO L124 PetriNetUnfolderBase]: 6135/10331 cut-off events. [2024-06-27 23:19:25,540 INFO L125 PetriNetUnfolderBase]: For 1020496/1020496 co-relation queries the response was YES. [2024-06-27 23:19:25,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85443 conditions, 10331 events. 6135/10331 cut-off events. For 1020496/1020496 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 76288 event pairs, 1520 based on Foata normal form. 18/10346 useless extension candidates. Maximal degree in co-relation 85276. Up to 6571 conditions per place. [2024-06-27 23:19:25,694 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 450 selfloop transitions, 253 changer transitions 0/708 dead transitions. [2024-06-27 23:19:25,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 708 transitions, 12528 flow [2024-06-27 23:19:25,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 23:19:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 23:19:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 243 transitions. [2024-06-27 23:19:25,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44505494505494503 [2024-06-27 23:19:25,696 INFO L175 Difference]: Start difference. First operand has 356 places, 657 transitions, 10941 flow. Second operand 13 states and 243 transitions. [2024-06-27 23:19:25,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 708 transitions, 12528 flow [2024-06-27 23:19:29,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 708 transitions, 11740 flow, removed 50 selfloop flow, removed 11 redundant places. [2024-06-27 23:19:29,893 INFO L231 Difference]: Finished difference. Result has 357 places, 656 transitions, 10546 flow [2024-06-27 23:19:29,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10035, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10546, PETRI_PLACES=357, PETRI_TRANSITIONS=656} [2024-06-27 23:19:29,893 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 314 predicate places. [2024-06-27 23:19:29,894 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 656 transitions, 10546 flow [2024-06-27 23:19:29,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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 23:19:29,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:29,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:29,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 23:19:29,894 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:29,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1821751984, now seen corresponding path program 2 times [2024-06-27 23:19:29,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:29,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24815578] [2024-06-27 23:19:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:29,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:31,431 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 23:19:31,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:31,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24815578] [2024-06-27 23:19:31,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24815578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:31,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:31,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:19:31,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034706821] [2024-06-27 23:19:31,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:31,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:19:31,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:31,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:19:31,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:19:31,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-27 23:19:31,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 656 transitions, 10546 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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 23:19:31,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:31,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-27 23:19:31,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:33,756 INFO L124 PetriNetUnfolderBase]: 5935/10044 cut-off events. [2024-06-27 23:19:33,756 INFO L125 PetriNetUnfolderBase]: For 1011208/1011274 co-relation queries the response was YES. [2024-06-27 23:19:33,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83124 conditions, 10044 events. 5935/10044 cut-off events. For 1011208/1011274 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 75172 event pairs, 2180 based on Foata normal form. 31/9974 useless extension candidates. Maximal degree in co-relation 82957. Up to 9025 conditions per place. [2024-06-27 23:19:33,910 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 549 selfloop transitions, 56 changer transitions 0/680 dead transitions. [2024-06-27 23:19:33,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 680 transitions, 12508 flow [2024-06-27 23:19:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:19:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:19:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-27 23:19:33,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2024-06-27 23:19:33,911 INFO L175 Difference]: Start difference. First operand has 357 places, 656 transitions, 10546 flow. Second operand 8 states and 158 transitions. [2024-06-27 23:19:33,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 680 transitions, 12508 flow [2024-06-27 23:19:37,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 680 transitions, 11761 flow, removed 25 selfloop flow, removed 12 redundant places. [2024-06-27 23:19:37,457 INFO L231 Difference]: Finished difference. Result has 353 places, 665 transitions, 10241 flow [2024-06-27 23:19:37,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9799, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10241, PETRI_PLACES=353, PETRI_TRANSITIONS=665} [2024-06-27 23:19:37,457 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 310 predicate places. [2024-06-27 23:19:37,457 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 665 transitions, 10241 flow [2024-06-27 23:19:37,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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 23:19:37,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:37,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:37,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 23:19:37,458 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:37,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash 227475736, now seen corresponding path program 8 times [2024-06-27 23:19:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:37,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102886402] [2024-06-27 23:19:37,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:37,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:38,935 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 23:19:38,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:38,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102886402] [2024-06-27 23:19:38,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102886402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:38,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:38,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:19:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031177114] [2024-06-27 23:19:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:38,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:19:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:19:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:19:38,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:19:38,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 665 transitions, 10241 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 23:19:38,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:38,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:19:38,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:42,052 INFO L124 PetriNetUnfolderBase]: 6189/10396 cut-off events. [2024-06-27 23:19:42,053 INFO L125 PetriNetUnfolderBase]: For 1007839/1007841 co-relation queries the response was YES. [2024-06-27 23:19:42,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83382 conditions, 10396 events. 6189/10396 cut-off events. For 1007839/1007841 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 76773 event pairs, 1743 based on Foata normal form. 4/10397 useless extension candidates. Maximal degree in co-relation 83215. Up to 9158 conditions per place. [2024-06-27 23:19:42,208 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 501 selfloop transitions, 186 changer transitions 0/692 dead transitions. [2024-06-27 23:19:42,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 692 transitions, 12523 flow [2024-06-27 23:19:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:19:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:19:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 23:19:42,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 23:19:42,209 INFO L175 Difference]: Start difference. First operand has 353 places, 665 transitions, 10241 flow. Second operand 8 states and 150 transitions. [2024-06-27 23:19:42,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 692 transitions, 12523 flow [2024-06-27 23:19:45,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 692 transitions, 12368 flow, removed 61 selfloop flow, removed 3 redundant places. [2024-06-27 23:19:45,342 INFO L231 Difference]: Finished difference. Result has 360 places, 678 transitions, 10955 flow [2024-06-27 23:19:45,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10086, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10955, PETRI_PLACES=360, PETRI_TRANSITIONS=678} [2024-06-27 23:19:45,342 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 317 predicate places. [2024-06-27 23:19:45,342 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 678 transitions, 10955 flow [2024-06-27 23:19:45,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 23:19:45,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:45,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:45,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 23:19:45,343 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:45,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash 139917972, now seen corresponding path program 9 times [2024-06-27 23:19:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:45,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231604278] [2024-06-27 23:19:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:47,150 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 23:19:47,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:47,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231604278] [2024-06-27 23:19:47,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231604278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:47,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:47,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:19:47,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487939931] [2024-06-27 23:19:47,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:47,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:19:47,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:47,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:19:47,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:19:47,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:19:47,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 678 transitions, 10955 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:19:47,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:47,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:19:47,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:50,441 INFO L124 PetriNetUnfolderBase]: 6199/10414 cut-off events. [2024-06-27 23:19:50,441 INFO L125 PetriNetUnfolderBase]: For 1034254/1034256 co-relation queries the response was YES. [2024-06-27 23:19:50,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85156 conditions, 10414 events. 6199/10414 cut-off events. For 1034254/1034256 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 76931 event pairs, 1752 based on Foata normal form. 4/10415 useless extension candidates. Maximal degree in co-relation 84985. Up to 9388 conditions per place. [2024-06-27 23:19:50,577 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 560 selfloop transitions, 127 changer transitions 0/692 dead transitions. [2024-06-27 23:19:50,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 692 transitions, 12510 flow [2024-06-27 23:19:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:19:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:19:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-27 23:19:50,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2024-06-27 23:19:50,579 INFO L175 Difference]: Start difference. First operand has 360 places, 678 transitions, 10955 flow. Second operand 9 states and 156 transitions. [2024-06-27 23:19:50,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 692 transitions, 12510 flow [2024-06-27 23:19:53,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 692 transitions, 12166 flow, removed 104 selfloop flow, removed 3 redundant places. [2024-06-27 23:19:53,878 INFO L231 Difference]: Finished difference. Result has 366 places, 682 transitions, 11033 flow [2024-06-27 23:19:53,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10623, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11033, PETRI_PLACES=366, PETRI_TRANSITIONS=682} [2024-06-27 23:19:53,878 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 323 predicate places. [2024-06-27 23:19:53,878 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 682 transitions, 11033 flow [2024-06-27 23:19:53,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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 23:19:53,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:53,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:53,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 23:19:53,879 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:53,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash 154215296, now seen corresponding path program 3 times [2024-06-27 23:19:53,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:53,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799498260] [2024-06-27 23:19:53,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:55,632 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 23:19:55,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799498260] [2024-06-27 23:19:55,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799498260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:55,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:55,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:19:55,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433773659] [2024-06-27 23:19:55,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:55,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:19:55,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:55,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:19:55,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:19:55,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:19:55,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 682 transitions, 11033 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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 23:19:55,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:55,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:19:55,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:58,896 INFO L124 PetriNetUnfolderBase]: 5963/10083 cut-off events. [2024-06-27 23:19:58,897 INFO L125 PetriNetUnfolderBase]: For 1065413/1065497 co-relation queries the response was YES. [2024-06-27 23:19:59,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81821 conditions, 10083 events. 5963/10083 cut-off events. For 1065413/1065497 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 75647 event pairs, 2521 based on Foata normal form. 38/10019 useless extension candidates. Maximal degree in co-relation 81648. Up to 9136 conditions per place. [2024-06-27 23:19:59,041 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 595 selfloop transitions, 19 changer transitions 0/694 dead transitions. [2024-06-27 23:19:59,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 694 transitions, 12293 flow [2024-06-27 23:19:59,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:19:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:19:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 23:19:59,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-27 23:19:59,042 INFO L175 Difference]: Start difference. First operand has 366 places, 682 transitions, 11033 flow. Second operand 9 states and 154 transitions. [2024-06-27 23:19:59,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 694 transitions, 12293 flow [2024-06-27 23:20:02,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 694 transitions, 11838 flow, removed 103 selfloop flow, removed 7 redundant places. [2024-06-27 23:20:02,534 INFO L231 Difference]: Finished difference. Result has 368 places, 682 transitions, 10622 flow [2024-06-27 23:20:02,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10578, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10622, PETRI_PLACES=368, PETRI_TRANSITIONS=682} [2024-06-27 23:20:02,535 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 325 predicate places. [2024-06-27 23:20:02,535 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 682 transitions, 10622 flow [2024-06-27 23:20:02,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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 23:20:02,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:20:02,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:20:02,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 23:20:02,535 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:20:02,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:20:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash 213666166, now seen corresponding path program 10 times [2024-06-27 23:20:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:20:02,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604508051] [2024-06-27 23:20:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:20:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:20:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:20:03,910 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 23:20:03,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:20:03,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604508051] [2024-06-27 23:20:03,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604508051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:20:03,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:20:03,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:20:03,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936892847] [2024-06-27 23:20:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:20:03,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:20:03,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:20:03,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:20:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:20:04,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:20:04,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 682 transitions, 10622 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 23:20:04,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:20:04,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:20:04,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:20:06,861 INFO L124 PetriNetUnfolderBase]: 6197/10413 cut-off events. [2024-06-27 23:20:06,861 INFO L125 PetriNetUnfolderBase]: For 1038982/1038984 co-relation queries the response was YES. [2024-06-27 23:20:06,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83500 conditions, 10413 events. 6197/10413 cut-off events. For 1038982/1038984 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 76894 event pairs, 1750 based on Foata normal form. 4/10414 useless extension candidates. Maximal degree in co-relation 83326. Up to 9358 conditions per place. [2024-06-27 23:20:07,025 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 563 selfloop transitions, 131 changer transitions 0/699 dead transitions. [2024-06-27 23:20:07,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 699 transitions, 12470 flow [2024-06-27 23:20:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:20:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:20:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-27 23:20:07,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2024-06-27 23:20:07,026 INFO L175 Difference]: Start difference. First operand has 368 places, 682 transitions, 10622 flow. Second operand 9 states and 158 transitions. [2024-06-27 23:20:07,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 699 transitions, 12470 flow [2024-06-27 23:20:10,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 699 transitions, 12424 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-27 23:20:10,475 INFO L231 Difference]: Finished difference. Result has 370 places, 688 transitions, 11091 flow [2024-06-27 23:20:10,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10576, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11091, PETRI_PLACES=370, PETRI_TRANSITIONS=688} [2024-06-27 23:20:10,475 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 327 predicate places. [2024-06-27 23:20:10,475 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 688 transitions, 11091 flow [2024-06-27 23:20:10,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 23:20:10,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:20:10,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:20:10,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 23:20:10,476 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:20:10,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:20:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash 213666600, now seen corresponding path program 4 times [2024-06-27 23:20:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:20:10,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257898469] [2024-06-27 23:20:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:20:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:20:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:20:12,215 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 23:20:12,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:20:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257898469] [2024-06-27 23:20:12,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257898469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:20:12,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:20:12,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:20:12,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164569701] [2024-06-27 23:20:12,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:20:12,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:20:12,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:20:12,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:20:12,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:20:12,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-27 23:20:12,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 688 transitions, 11091 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 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 23:20:12,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:20:12,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-27 23:20:12,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand