./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/mix001.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/mix001.oepc.i ./goblint.2024-05-21_14-57-05.files/protection/mix001.oepc.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-cde23df-m [2024-06-14 11:46:03,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 11:46:03,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 11:46:03,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 11:46:03,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 11:46:03,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 11:46:03,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 11:46:03,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 11:46:03,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 11:46:03,822 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 11:46:03,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 11:46:03,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 11:46:03,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 11:46:03,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 11:46:03,825 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 11:46:03,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 11:46:03,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 11:46:03,825 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 11:46:03,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 11:46:03,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 11:46:03,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 11:46:03,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 11:46:03,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 11:46:03,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 11:46:03,827 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 11:46:03,827 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 11:46:03,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 11:46:03,828 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 11:46:03,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 11:46:03,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 11:46:03,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 11:46:03,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 11:46:03,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:46:03,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 11:46:03,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 11:46:03,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 11:46:03,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 11:46:03,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 11:46:03,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 11:46:03,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 11:46:03,832 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 11:46:03,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 11:46:03,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 11:46:03,832 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-14 11:46:04,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 11:46:04,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 11:46:04,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 11:46:04,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 11:46:04,126 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 11:46:04,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2024-06-14 11:46:05,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 11:46:05,522 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 11:46:05,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2024-06-14 11:46:05,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84adc1388/b4c7daa80599446083c86ab5d9aaa0a9/FLAG95dbcc884 [2024-06-14 11:46:05,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84adc1388/b4c7daa80599446083c86ab5d9aaa0a9 [2024-06-14 11:46:05,554 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 11:46:05,555 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 11:46:05,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/mix001.oepc.yml/witness.yml [2024-06-14 11:46:05,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 11:46:05,752 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 11:46:05,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 11:46:05,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 11:46:05,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 11:46:05,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:46:05" (1/2) ... [2024-06-14 11:46:05,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508a9123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:46:05, skipping insertion in model container [2024-06-14 11:46:05,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:46:05" (1/2) ... [2024-06-14 11:46:05,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5fb77bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:46:05, skipping insertion in model container [2024-06-14 11:46:05,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:46:05" (2/2) ... [2024-06-14 11:46:05,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508a9123 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:05, skipping insertion in model container [2024-06-14 11:46:05,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:46:05" (2/2) ... [2024-06-14 11:46:05,765 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 11:46:05,884 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 11:46:05,886 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] (((((((((((((((((((((! multithreaded || z$r_buff1_thd0 == (_Bool)0) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-14 11:46:05,886 INFO L97 edCorrectnessWitness]: Location invariant before [L867-L867] (((((((((((((((((((((! multithreaded || z$r_buff1_thd0 == (_Bool)0) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-14 11:46:05,886 INFO L97 edCorrectnessWitness]: Location invariant before [L870-L870] (((((((((((((((((((((! multithreaded || z$r_buff1_thd0 == (_Bool)0) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-14 11:46:05,886 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 11:46:05,887 INFO L106 edCorrectnessWitness]: ghost_update [L865-L865] multithreaded = 1; [2024-06-14 11:46:05,933 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 11:46:06,296 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:46:06,305 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 11:46:06,451 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:46:06,491 INFO L206 MainTranslator]: Completed translation [2024-06-14 11:46:06,492 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06 WrapperNode [2024-06-14 11:46:06,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 11:46:06,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 11:46:06,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 11:46:06,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 11:46:06,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,581 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-06-14 11:46:06,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 11:46:06,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 11:46:06,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 11:46:06,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 11:46:06,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,645 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-14 11:46:06,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 11:46:06,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 11:46:06,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 11:46:06,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 11:46:06,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (1/1) ... [2024-06-14 11:46:06,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:46:06,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:46:06,759 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-14 11:46:06,765 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-14 11:46:06,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 11:46:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 11:46:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 11:46:06,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 11:46:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 11:46:06,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 11:46:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 11:46:06,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 11:46:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 11:46:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 11:46:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 11:46:06,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 11:46:06,807 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 11:46:06,961 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 11:46:06,963 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 11:46:07,403 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 11:46:07,405 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 11:46:07,599 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 11:46:07,600 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 11:46:07,600 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:46:07 BoogieIcfgContainer [2024-06-14 11:46:07,600 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 11:46:07,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 11:46:07,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 11:46:07,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 11:46:07,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 11:46:05" (1/4) ... [2024-06-14 11:46:07,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108aab94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 11:46:07, skipping insertion in model container [2024-06-14 11:46:07,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:46:05" (2/4) ... [2024-06-14 11:46:07,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108aab94 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:46:07, skipping insertion in model container [2024-06-14 11:46:07,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:46:06" (3/4) ... [2024-06-14 11:46:07,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108aab94 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:46:07, skipping insertion in model container [2024-06-14 11:46:07,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:46:07" (4/4) ... [2024-06-14 11:46:07,611 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2024-06-14 11:46:07,626 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 11:46:07,626 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 11:46:07,626 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 11:46:07,677 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 11:46:07,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 100 flow [2024-06-14 11:46:07,745 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2024-06-14 11:46:07,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 11:46:07,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 11:46:07,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 44 transitions, 100 flow [2024-06-14 11:46:07,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow [2024-06-14 11:46:07,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 11:46:07,772 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;@1b083111, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 11:46:07,772 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 11:46:07,776 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 11:46:07,777 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 11:46:07,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 11:46:07,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:07,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 11:46:07,778 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-14 11:46:07,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash 154931612, now seen corresponding path program 1 times [2024-06-14 11:46:07,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:07,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081069453] [2024-06-14 11:46:07,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:07,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:08,909 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-14 11:46:08,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:08,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081069453] [2024-06-14 11:46:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081069453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:08,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:08,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 11:46:08,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162179388] [2024-06-14 11:46:08,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:08,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 11:46:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:08,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 11:46:08,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 11:46:09,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-14 11:46:09,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:46:09,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:09,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-14 11:46:09,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:09,542 INFO L124 PetriNetUnfolderBase]: 1363/2134 cut-off events. [2024-06-14 11:46:09,543 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-14 11:46:09,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 2134 events. 1363/2134 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10821 event pairs, 964 based on Foata normal form. 1/2079 useless extension candidates. Maximal degree in co-relation 4245. Up to 2037 conditions per place. [2024-06-14 11:46:09,563 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 34 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-14 11:46:09,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 181 flow [2024-06-14 11:46:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 11:46:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 11:46:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-14 11:46:09,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-06-14 11:46:09,576 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 80 transitions. [2024-06-14 11:46:09,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 181 flow [2024-06-14 11:46:09,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 11:46:09,583 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 106 flow [2024-06-14 11:46:09,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-14 11:46:09,588 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-06-14 11:46:09,588 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 106 flow [2024-06-14 11:46:09,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:46:09,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:09,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:09,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 11:46:09,589 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-14 11:46:09,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1434532229, now seen corresponding path program 1 times [2024-06-14 11:46:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:09,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091685021] [2024-06-14 11:46:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:10,541 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-14 11:46:10,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:10,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091685021] [2024-06-14 11:46:10,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091685021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:10,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:10,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:46:10,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308631210] [2024-06-14 11:46:10,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:10,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:46:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:46:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:46:10,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-14 11:46:10,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-14 11:46:10,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:10,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-14 11:46:10,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:11,055 INFO L124 PetriNetUnfolderBase]: 1357/2135 cut-off events. [2024-06-14 11:46:11,055 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2024-06-14 11:46:11,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4804 conditions, 2135 events. 1357/2135 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10830 event pairs, 840 based on Foata normal form. 3/2122 useless extension candidates. Maximal degree in co-relation 4789. Up to 2013 conditions per place. [2024-06-14 11:46:11,068 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 41 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-06-14 11:46:11,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 248 flow [2024-06-14 11:46:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:46:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:46:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-06-14 11:46:11,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727 [2024-06-14 11:46:11,070 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 106 flow. Second operand 4 states and 103 transitions. [2024-06-14 11:46:11,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 248 flow [2024-06-14 11:46:11,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:46:11,073 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 142 flow [2024-06-14 11:46:11,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-06-14 11:46:11,074 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-14 11:46:11,074 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 142 flow [2024-06-14 11:46:11,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-14 11:46:11,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:11,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:11,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 11:46:11,075 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-14 11:46:11,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1520824703, now seen corresponding path program 1 times [2024-06-14 11:46:11,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:11,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163217425] [2024-06-14 11:46:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:12,493 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-14 11:46:12,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:12,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163217425] [2024-06-14 11:46:12,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163217425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:12,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:46:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386299269] [2024-06-14 11:46:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:12,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 11:46:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:12,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 11:46:12,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-14 11:46:12,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-14 11:46:12,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-14 11:46:12,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:12,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-14 11:46:12,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:13,053 INFO L124 PetriNetUnfolderBase]: 1351/2142 cut-off events. [2024-06-14 11:46:13,053 INFO L125 PetriNetUnfolderBase]: For 1162/1162 co-relation queries the response was YES. [2024-06-14 11:46:13,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5337 conditions, 2142 events. 1351/2142 cut-off events. For 1162/1162 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10944 event pairs, 716 based on Foata normal form. 3/2135 useless extension candidates. Maximal degree in co-relation 5320. Up to 1989 conditions per place. [2024-06-14 11:46:13,067 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 48 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2024-06-14 11:46:13,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 326 flow [2024-06-14 11:46:13,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:46:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:46:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-06-14 11:46:13,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2024-06-14 11:46:13,077 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 142 flow. Second operand 5 states and 126 transitions. [2024-06-14 11:46:13,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 326 flow [2024-06-14 11:46:13,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 11:46:13,082 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 178 flow [2024-06-14 11:46:13,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-14 11:46:13,083 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-06-14 11:46:13,084 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 178 flow [2024-06-14 11:46:13,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-14 11:46:13,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:13,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:13,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 11:46:13,085 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-14 11:46:13,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:13,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1223611968, now seen corresponding path program 1 times [2024-06-14 11:46:13,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:13,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977498817] [2024-06-14 11:46:13,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:14,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-14 11:46:14,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:14,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977498817] [2024-06-14 11:46:14,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977498817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:14,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:14,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:46:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139426142] [2024-06-14 11:46:14,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:14,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:46:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:14,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:46:14,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:46:15,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 11:46:15,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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-14 11:46:15,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:15,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 11:46:15,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:15,715 INFO L124 PetriNetUnfolderBase]: 1586/2499 cut-off events. [2024-06-14 11:46:15,715 INFO L125 PetriNetUnfolderBase]: For 2479/2479 co-relation queries the response was YES. [2024-06-14 11:46:15,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6773 conditions, 2499 events. 1586/2499 cut-off events. For 2479/2479 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12821 event pairs, 667 based on Foata normal form. 3/2481 useless extension candidates. Maximal degree in co-relation 6755. Up to 2302 conditions per place. [2024-06-14 11:46:15,732 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 63 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2024-06-14 11:46:15,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 464 flow [2024-06-14 11:46:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-14 11:46:15,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538961038961039 [2024-06-14 11:46:15,735 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 178 flow. Second operand 7 states and 166 transitions. [2024-06-14 11:46:15,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 464 flow [2024-06-14 11:46:15,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 430 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 11:46:15,741 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 236 flow [2024-06-14 11:46:15,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2024-06-14 11:46:15,742 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2024-06-14 11:46:15,743 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 236 flow [2024-06-14 11:46:15,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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-14 11:46:15,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:15,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:15,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 11:46:15,744 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-14 11:46:15,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2087886214, now seen corresponding path program 1 times [2024-06-14 11:46:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:15,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611317450] [2024-06-14 11:46:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:16,562 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-14 11:46:16,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:16,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611317450] [2024-06-14 11:46:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611317450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:16,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:16,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:46:16,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467172601] [2024-06-14 11:46:16,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:16,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:46:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:16,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:46:16,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:46:16,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:16,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 236 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-14 11:46:16,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:16,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:16,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:17,339 INFO L124 PetriNetUnfolderBase]: 1930/2978 cut-off events. [2024-06-14 11:46:17,340 INFO L125 PetriNetUnfolderBase]: For 4641/4641 co-relation queries the response was YES. [2024-06-14 11:46:17,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8825 conditions, 2978 events. 1930/2978 cut-off events. For 4641/4641 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14843 event pairs, 825 based on Foata normal form. 2/2979 useless extension candidates. Maximal degree in co-relation 8805. Up to 2849 conditions per place. [2024-06-14 11:46:17,369 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 51 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2024-06-14 11:46:17,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 398 flow [2024-06-14 11:46:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:46:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:46:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-06-14 11:46:17,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-14 11:46:17,372 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 236 flow. Second operand 5 states and 99 transitions. [2024-06-14 11:46:17,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 398 flow [2024-06-14 11:46:17,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 360 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 11:46:17,381 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 244 flow [2024-06-14 11:46:17,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-06-14 11:46:17,384 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2024-06-14 11:46:17,384 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 244 flow [2024-06-14 11:46:17,384 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-14 11:46:17,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:17,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:17,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 11:46:17,385 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:46:17,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1024745175, now seen corresponding path program 1 times [2024-06-14 11:46:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246626578] [2024-06-14 11:46:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:19,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-14 11:46:19,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:19,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246626578] [2024-06-14 11:46:19,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246626578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:19,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:19,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 11:46:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512535964] [2024-06-14 11:46:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:19,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 11:46:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:19,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 11:46:19,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 11:46:19,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 11:46:19,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 244 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 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-14 11:46:19,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:19,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 11:46:19,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:20,186 INFO L124 PetriNetUnfolderBase]: 1797/2829 cut-off events. [2024-06-14 11:46:20,187 INFO L125 PetriNetUnfolderBase]: For 6559/6559 co-relation queries the response was YES. [2024-06-14 11:46:20,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8943 conditions, 2829 events. 1797/2829 cut-off events. For 6559/6559 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14603 event pairs, 603 based on Foata normal form. 6/2824 useless extension candidates. Maximal degree in co-relation 8921. Up to 2550 conditions per place. [2024-06-14 11:46:20,218 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 63 selfloop transitions, 17 changer transitions 0/87 dead transitions. [2024-06-14 11:46:20,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 500 flow [2024-06-14 11:46:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-06-14 11:46:20,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-06-14 11:46:20,220 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 244 flow. Second operand 7 states and 163 transitions. [2024-06-14 11:46:20,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 500 flow [2024-06-14 11:46:20,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 478 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 11:46:20,226 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 279 flow [2024-06-14 11:46:20,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=279, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-06-14 11:46:20,229 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2024-06-14 11:46:20,229 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 279 flow [2024-06-14 11:46:20,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 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-14 11:46:20,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:20,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:20,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 11:46:20,230 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-14 11:46:20,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash -310686871, now seen corresponding path program 1 times [2024-06-14 11:46:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608716163] [2024-06-14 11:46:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:21,186 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-14 11:46:21,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:21,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608716163] [2024-06-14 11:46:21,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608716163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:21,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:21,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:46:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795195654] [2024-06-14 11:46:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:21,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:46:21,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:21,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:46:21,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:46:21,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:21,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 279 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-14 11:46:21,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:21,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:21,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:22,062 INFO L124 PetriNetUnfolderBase]: 1911/2947 cut-off events. [2024-06-14 11:46:22,063 INFO L125 PetriNetUnfolderBase]: For 8888/8888 co-relation queries the response was YES. [2024-06-14 11:46:22,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9828 conditions, 2947 events. 1911/2947 cut-off events. For 8888/8888 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14701 event pairs, 750 based on Foata normal form. 4/2950 useless extension candidates. Maximal degree in co-relation 9806. Up to 2802 conditions per place. [2024-06-14 11:46:22,083 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 57 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-06-14 11:46:22,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 477 flow [2024-06-14 11:46:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:46:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:46:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-14 11:46:22,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-14 11:46:22,085 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 279 flow. Second operand 6 states and 116 transitions. [2024-06-14 11:46:22,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 477 flow [2024-06-14 11:46:22,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 428 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 11:46:22,090 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 288 flow [2024-06-14 11:46:22,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-06-14 11:46:22,091 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-06-14 11:46:22,091 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 288 flow [2024-06-14 11:46:22,091 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-14 11:46:22,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:22,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:22,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 11:46:22,092 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-14 11:46:22,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash 641949573, now seen corresponding path program 1 times [2024-06-14 11:46:22,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:22,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23566068] [2024-06-14 11:46:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:23,142 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-14 11:46:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23566068] [2024-06-14 11:46:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23566068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:23,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:23,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:46:23,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269551662] [2024-06-14 11:46:23,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:23,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:46:23,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:23,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:46:23,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:46:23,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:23,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 288 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-14 11:46:23,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:23,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:23,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:23,707 INFO L124 PetriNetUnfolderBase]: 1922/2987 cut-off events. [2024-06-14 11:46:23,708 INFO L125 PetriNetUnfolderBase]: For 11077/11081 co-relation queries the response was YES. [2024-06-14 11:46:23,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 2987 events. 1922/2987 cut-off events. For 11077/11081 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15026 event pairs, 751 based on Foata normal form. 6/2992 useless extension candidates. Maximal degree in co-relation 10441. Up to 2801 conditions per place. [2024-06-14 11:46:23,727 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 62 selfloop transitions, 16 changer transitions 0/83 dead transitions. [2024-06-14 11:46:23,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 570 flow [2024-06-14 11:46:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:46:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:46:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-14 11:46:23,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2024-06-14 11:46:23,730 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 288 flow. Second operand 6 states and 122 transitions. [2024-06-14 11:46:23,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 570 flow [2024-06-14 11:46:23,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 536 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 11:46:23,736 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 348 flow [2024-06-14 11:46:23,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-06-14 11:46:23,737 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-06-14 11:46:23,737 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 348 flow [2024-06-14 11:46:23,738 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-14 11:46:23,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:23,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:23,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 11:46:23,738 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-14 11:46:23,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:23,739 INFO L85 PathProgramCache]: Analyzing trace with hash -697280173, now seen corresponding path program 2 times [2024-06-14 11:46:23,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:23,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390977341] [2024-06-14 11:46:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:23,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:24,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-14 11:46:24,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:24,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390977341] [2024-06-14 11:46:24,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390977341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:24,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:24,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:46:24,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032172222] [2024-06-14 11:46:24,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:24,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:46:24,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:24,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:46:24,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:46:24,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:24,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 348 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-14 11:46:24,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:24,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:24,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:25,363 INFO L124 PetriNetUnfolderBase]: 1917/2979 cut-off events. [2024-06-14 11:46:25,363 INFO L125 PetriNetUnfolderBase]: For 13729/13729 co-relation queries the response was YES. [2024-06-14 11:46:25,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11037 conditions, 2979 events. 1917/2979 cut-off events. For 13729/13729 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14983 event pairs, 747 based on Foata normal form. 2/2980 useless extension candidates. Maximal degree in co-relation 11012. Up to 2820 conditions per place. [2024-06-14 11:46:25,383 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 62 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2024-06-14 11:46:25,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 532 flow [2024-06-14 11:46:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:46:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:46:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-14 11:46:25,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2024-06-14 11:46:25,385 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 348 flow. Second operand 6 states and 115 transitions. [2024-06-14 11:46:25,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 532 flow [2024-06-14 11:46:25,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 492 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-14 11:46:25,398 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 338 flow [2024-06-14 11:46:25,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-06-14 11:46:25,399 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-06-14 11:46:25,399 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 338 flow [2024-06-14 11:46:25,399 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-14 11:46:25,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:25,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:25,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 11:46:25,400 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-14 11:46:25,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1870727301, now seen corresponding path program 1 times [2024-06-14 11:46:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:25,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5743933] [2024-06-14 11:46:25,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:26,831 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-14 11:46:26,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5743933] [2024-06-14 11:46:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5743933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:26,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:26,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 11:46:26,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598815421] [2024-06-14 11:46:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:26,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 11:46:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 11:46:26,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 11:46:26,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:26,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 338 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-14 11:46:26,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:26,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:26,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:27,519 INFO L124 PetriNetUnfolderBase]: 1928/2995 cut-off events. [2024-06-14 11:46:27,520 INFO L125 PetriNetUnfolderBase]: For 16086/16090 co-relation queries the response was YES. [2024-06-14 11:46:27,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11386 conditions, 2995 events. 1928/2995 cut-off events. For 16086/16090 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15102 event pairs, 733 based on Foata normal form. 6/3000 useless extension candidates. Maximal degree in co-relation 11359. Up to 2772 conditions per place. [2024-06-14 11:46:27,538 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 67 selfloop transitions, 24 changer transitions 0/96 dead transitions. [2024-06-14 11:46:27,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 96 transitions, 680 flow [2024-06-14 11:46:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-14 11:46:27,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 11:46:27,540 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 338 flow. Second operand 7 states and 143 transitions. [2024-06-14 11:46:27,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 96 transitions, 680 flow [2024-06-14 11:46:27,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 96 transitions, 650 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 11:46:27,549 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 426 flow [2024-06-14 11:46:27,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2024-06-14 11:46:27,549 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-06-14 11:46:27,549 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 426 flow [2024-06-14 11:46:27,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-14 11:46:27,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:27,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:27,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 11:46:27,550 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-14 11:46:27,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:27,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1870733098, now seen corresponding path program 1 times [2024-06-14 11:46:27,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:27,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924886815] [2024-06-14 11:46:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:27,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:28,642 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-14 11:46:28,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:28,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924886815] [2024-06-14 11:46:28,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924886815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:28,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:28,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 11:46:28,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189893265] [2024-06-14 11:46:28,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:28,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 11:46:28,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:28,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 11:46:28,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 11:46:28,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:28,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 426 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-14 11:46:28,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:28,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:28,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:29,350 INFO L124 PetriNetUnfolderBase]: 1966/3052 cut-off events. [2024-06-14 11:46:29,351 INFO L125 PetriNetUnfolderBase]: For 20071/20075 co-relation queries the response was YES. [2024-06-14 11:46:29,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12305 conditions, 3052 events. 1966/3052 cut-off events. For 20071/20075 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15356 event pairs, 688 based on Foata normal form. 5/3055 useless extension candidates. Maximal degree in co-relation 12277. Up to 2811 conditions per place. [2024-06-14 11:46:29,370 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 76 selfloop transitions, 23 changer transitions 0/104 dead transitions. [2024-06-14 11:46:29,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 104 transitions, 798 flow [2024-06-14 11:46:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-14 11:46:29,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 11:46:29,372 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 426 flow. Second operand 7 states and 143 transitions. [2024-06-14 11:46:29,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 104 transitions, 798 flow [2024-06-14 11:46:29,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 752 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-14 11:46:29,388 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 524 flow [2024-06-14 11:46:29,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2024-06-14 11:46:29,389 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2024-06-14 11:46:29,389 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 524 flow [2024-06-14 11:46:29,389 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-14 11:46:29,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:29,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:29,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 11:46:29,390 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-14 11:46:29,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1870732881, now seen corresponding path program 2 times [2024-06-14 11:46:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:29,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375680327] [2024-06-14 11:46:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:30,675 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-14 11:46:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:30,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375680327] [2024-06-14 11:46:30,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375680327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:30,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:30,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 11:46:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932431650] [2024-06-14 11:46:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:30,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 11:46:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:30,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 11:46:30,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 11:46:30,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:30,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 524 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-14 11:46:30,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:30,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:30,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:31,333 INFO L124 PetriNetUnfolderBase]: 1977/3069 cut-off events. [2024-06-14 11:46:31,333 INFO L125 PetriNetUnfolderBase]: For 23880/23882 co-relation queries the response was YES. [2024-06-14 11:46:31,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13142 conditions, 3069 events. 1977/3069 cut-off events. For 23880/23882 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15435 event pairs, 699 based on Foata normal form. 4/3072 useless extension candidates. Maximal degree in co-relation 13111. Up to 2874 conditions per place. [2024-06-14 11:46:31,355 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 79 selfloop transitions, 19 changer transitions 0/103 dead transitions. [2024-06-14 11:46:31,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 103 transitions, 806 flow [2024-06-14 11:46:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 11:46:31,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2024-06-14 11:46:31,357 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 524 flow. Second operand 7 states and 137 transitions. [2024-06-14 11:46:31,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 103 transitions, 806 flow [2024-06-14 11:46:31,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 103 transitions, 776 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-14 11:46:31,376 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 576 flow [2024-06-14 11:46:31,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2024-06-14 11:46:31,392 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2024-06-14 11:46:31,393 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 576 flow [2024-06-14 11:46:31,393 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-14 11:46:31,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:31,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:31,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 11:46:31,394 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-14 11:46:31,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash -140848017, now seen corresponding path program 3 times [2024-06-14 11:46:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:31,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188590144] [2024-06-14 11:46:31,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:32,802 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-14 11:46:32,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:32,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188590144] [2024-06-14 11:46:32,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188590144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:32,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 11:46:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118165913] [2024-06-14 11:46:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:32,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 11:46:32,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:32,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 11:46:32,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 11:46:32,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:32,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 576 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-14 11:46:32,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:32,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:32,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:33,491 INFO L124 PetriNetUnfolderBase]: 1972/3056 cut-off events. [2024-06-14 11:46:33,491 INFO L125 PetriNetUnfolderBase]: For 26846/26846 co-relation queries the response was YES. [2024-06-14 11:46:33,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13390 conditions, 3056 events. 1972/3056 cut-off events. For 26846/26846 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15302 event pairs, 695 based on Foata normal form. 2/3057 useless extension candidates. Maximal degree in co-relation 13356. Up to 2891 conditions per place. [2024-06-14 11:46:33,511 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 81 selfloop transitions, 14 changer transitions 0/100 dead transitions. [2024-06-14 11:46:33,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 814 flow [2024-06-14 11:46:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-14 11:46:33,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 11:46:33,514 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 576 flow. Second operand 7 states and 132 transitions. [2024-06-14 11:46:33,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 814 flow [2024-06-14 11:46:33,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 100 transitions, 748 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 11:46:33,537 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 546 flow [2024-06-14 11:46:33,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2024-06-14 11:46:33,538 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2024-06-14 11:46:33,538 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 546 flow [2024-06-14 11:46:33,538 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-14 11:46:33,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:33,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:33,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 11:46:33,539 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:46:33,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash -500754080, now seen corresponding path program 2 times [2024-06-14 11:46:33,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:33,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090751845] [2024-06-14 11:46:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:33,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:34,482 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-14 11:46:34,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:34,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090751845] [2024-06-14 11:46:34,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090751845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:34,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:34,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 11:46:34,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848369216] [2024-06-14 11:46:34,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:34,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 11:46:34,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:34,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 11:46:34,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 11:46:34,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:34,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 546 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-14 11:46:34,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:34,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:34,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:35,172 INFO L124 PetriNetUnfolderBase]: 1994/3093 cut-off events. [2024-06-14 11:46:35,173 INFO L125 PetriNetUnfolderBase]: For 30475/30475 co-relation queries the response was YES. [2024-06-14 11:46:35,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13775 conditions, 3093 events. 1994/3093 cut-off events. For 30475/30475 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15517 event pairs, 695 based on Foata normal form. 4/3096 useless extension candidates. Maximal degree in co-relation 13740. Up to 2914 conditions per place. [2024-06-14 11:46:35,194 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 85 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2024-06-14 11:46:35,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 104 transitions, 832 flow [2024-06-14 11:46:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-14 11:46:35,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-14 11:46:35,196 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 546 flow. Second operand 7 states and 133 transitions. [2024-06-14 11:46:35,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 104 transitions, 832 flow [2024-06-14 11:46:35,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 104 transitions, 782 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 11:46:35,218 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 574 flow [2024-06-14 11:46:35,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=574, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2024-06-14 11:46:35,219 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2024-06-14 11:46:35,219 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 574 flow [2024-06-14 11:46:35,219 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-14 11:46:35,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:35,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:35,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 11:46:35,220 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-14 11:46:35,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1236366884, now seen corresponding path program 3 times [2024-06-14 11:46:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:35,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858054112] [2024-06-14 11:46:35,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:35,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:36,213 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-14 11:46:36,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:36,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858054112] [2024-06-14 11:46:36,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858054112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:36,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:36,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 11:46:36,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107577142] [2024-06-14 11:46:36,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:36,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 11:46:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:36,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 11:46:36,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 11:46:36,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:36,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 574 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-14 11:46:36,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:36,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:36,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:36,824 INFO L124 PetriNetUnfolderBase]: 1984/3079 cut-off events. [2024-06-14 11:46:36,824 INFO L125 PetriNetUnfolderBase]: For 33837/33837 co-relation queries the response was YES. [2024-06-14 11:46:36,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13923 conditions, 3079 events. 1984/3079 cut-off events. For 33837/33837 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15451 event pairs, 693 based on Foata normal form. 4/3082 useless extension candidates. Maximal degree in co-relation 13888. Up to 2873 conditions per place. [2024-06-14 11:46:36,839 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 81 selfloop transitions, 19 changer transitions 0/105 dead transitions. [2024-06-14 11:46:36,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 105 transitions, 830 flow [2024-06-14 11:46:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:46:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:46:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-14 11:46:36,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-14 11:46:36,840 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 574 flow. Second operand 7 states and 136 transitions. [2024-06-14 11:46:36,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 105 transitions, 830 flow [2024-06-14 11:46:36,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 105 transitions, 764 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-14 11:46:36,866 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 554 flow [2024-06-14 11:46:36,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=554, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2024-06-14 11:46:36,867 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2024-06-14 11:46:36,867 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 554 flow [2024-06-14 11:46:36,867 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-14 11:46:36,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:36,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:36,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 11:46:36,868 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:46:36,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:36,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1547208780, now seen corresponding path program 1 times [2024-06-14 11:46:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:36,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67507414] [2024-06-14 11:46:36,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:36,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:37,653 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-14 11:46:37,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67507414] [2024-06-14 11:46:37,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67507414] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:37,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:37,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:46:37,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688032371] [2024-06-14 11:46:37,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:37,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 11:46:37,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:37,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 11:46:37,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 11:46:37,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:37,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 554 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-14 11:46:37,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:37,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:37,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:38,371 INFO L124 PetriNetUnfolderBase]: 2402/3673 cut-off events. [2024-06-14 11:46:38,371 INFO L125 PetriNetUnfolderBase]: For 47931/47931 co-relation queries the response was YES. [2024-06-14 11:46:38,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17121 conditions, 3673 events. 2402/3673 cut-off events. For 47931/47931 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18189 event pairs, 959 based on Foata normal form. 1/3673 useless extension candidates. Maximal degree in co-relation 17086. Up to 3525 conditions per place. [2024-06-14 11:46:38,386 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 72 selfloop transitions, 8 changer transitions 0/95 dead transitions. [2024-06-14 11:46:38,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 95 transitions, 756 flow [2024-06-14 11:46:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 11:46:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 11:46:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-06-14 11:46:38,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-06-14 11:46:38,388 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 554 flow. Second operand 5 states and 94 transitions. [2024-06-14 11:46:38,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 95 transitions, 756 flow [2024-06-14 11:46:38,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 95 transitions, 692 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 11:46:38,410 INFO L231 Difference]: Finished difference. Result has 82 places, 87 transitions, 540 flow [2024-06-14 11:46:38,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=540, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2024-06-14 11:46:38,410 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2024-06-14 11:46:38,410 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 540 flow [2024-06-14 11:46:38,411 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-14 11:46:38,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:38,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:38,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 11:46:38,411 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-14 11:46:38,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1566484828, now seen corresponding path program 1 times [2024-06-14 11:46:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:38,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298713979] [2024-06-14 11:46:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:38,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:40,087 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-14 11:46:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298713979] [2024-06-14 11:46:40,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298713979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:40,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:40,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:46:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954462122] [2024-06-14 11:46:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:40,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:46:40,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:40,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:46:40,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:46:40,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:40,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 540 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-14 11:46:40,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:40,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:40,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:40,942 INFO L124 PetriNetUnfolderBase]: 2091/3226 cut-off events. [2024-06-14 11:46:40,943 INFO L125 PetriNetUnfolderBase]: For 46502/46502 co-relation queries the response was YES. [2024-06-14 11:46:40,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15783 conditions, 3226 events. 2091/3226 cut-off events. For 46502/46502 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16204 event pairs, 718 based on Foata normal form. 2/3227 useless extension candidates. Maximal degree in co-relation 15747. Up to 2994 conditions per place. [2024-06-14 11:46:40,968 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 99 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2024-06-14 11:46:40,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 122 transitions, 888 flow [2024-06-14 11:46:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:46:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:46:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-14 11:46:40,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2024-06-14 11:46:40,973 INFO L175 Difference]: Start difference. First operand has 82 places, 87 transitions, 540 flow. Second operand 8 states and 158 transitions. [2024-06-14 11:46:40,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 122 transitions, 888 flow [2024-06-14 11:46:41,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 122 transitions, 860 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 11:46:41,003 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 594 flow [2024-06-14 11:46:41,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2024-06-14 11:46:41,003 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2024-06-14 11:46:41,004 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 594 flow [2024-06-14 11:46:41,004 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-14 11:46:41,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:41,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:41,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 11:46:41,005 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-14 11:46:41,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:41,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1566364858, now seen corresponding path program 2 times [2024-06-14 11:46:41,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:41,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213003592] [2024-06-14 11:46:41,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:42,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-14 11:46:42,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213003592] [2024-06-14 11:46:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213003592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:42,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:42,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:46:42,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275268809] [2024-06-14 11:46:42,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:42,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:46:42,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:42,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:46:42,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:46:42,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:42,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 594 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-14 11:46:42,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:42,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:42,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:43,246 INFO L124 PetriNetUnfolderBase]: 2102/3243 cut-off events. [2024-06-14 11:46:43,247 INFO L125 PetriNetUnfolderBase]: For 52346/52348 co-relation queries the response was YES. [2024-06-14 11:46:43,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16580 conditions, 3243 events. 2102/3243 cut-off events. For 52346/52348 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16312 event pairs, 722 based on Foata normal form. 4/3246 useless extension candidates. Maximal degree in co-relation 16543. Up to 2931 conditions per place. [2024-06-14 11:46:43,262 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 85 selfloop transitions, 36 changer transitions 0/127 dead transitions. [2024-06-14 11:46:43,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 127 transitions, 1060 flow [2024-06-14 11:46:43,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:46:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:46:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-14 11:46:43,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2024-06-14 11:46:43,264 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 594 flow. Second operand 8 states and 162 transitions. [2024-06-14 11:46:43,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 127 transitions, 1060 flow [2024-06-14 11:46:43,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 127 transitions, 1002 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-14 11:46:43,286 INFO L231 Difference]: Finished difference. Result has 89 places, 96 transitions, 702 flow [2024-06-14 11:46:43,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=702, PETRI_PLACES=89, PETRI_TRANSITIONS=96} [2024-06-14 11:46:43,287 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2024-06-14 11:46:43,287 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 96 transitions, 702 flow [2024-06-14 11:46:43,287 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-14 11:46:43,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:43,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:43,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 11:46:43,288 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-14 11:46:43,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1566364672, now seen corresponding path program 1 times [2024-06-14 11:46:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:43,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441965458] [2024-06-14 11:46:43,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:44,543 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-14 11:46:44,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441965458] [2024-06-14 11:46:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441965458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:44,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:46:44,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862819457] [2024-06-14 11:46:44,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:44,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:46:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:44,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:46:44,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:46:44,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:44,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 96 transitions, 702 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-14 11:46:44,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:44,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:44,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:45,229 INFO L124 PetriNetUnfolderBase]: 2252/3481 cut-off events. [2024-06-14 11:46:45,229 INFO L125 PetriNetUnfolderBase]: For 63074/63087 co-relation queries the response was YES. [2024-06-14 11:46:45,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18486 conditions, 3481 events. 2252/3481 cut-off events. For 63074/63087 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17716 event pairs, 1068 based on Foata normal form. 4/3466 useless extension candidates. Maximal degree in co-relation 18448. Up to 3070 conditions per place. [2024-06-14 11:46:45,294 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 103 selfloop transitions, 42 changer transitions 0/151 dead transitions. [2024-06-14 11:46:45,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 151 transitions, 1355 flow [2024-06-14 11:46:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:46:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:46:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-14 11:46:45,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43686868686868685 [2024-06-14 11:46:45,296 INFO L175 Difference]: Start difference. First operand has 89 places, 96 transitions, 702 flow. Second operand 9 states and 173 transitions. [2024-06-14 11:46:45,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 151 transitions, 1355 flow [2024-06-14 11:46:45,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 151 transitions, 1278 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-14 11:46:45,330 INFO L231 Difference]: Finished difference. Result has 98 places, 119 transitions, 987 flow [2024-06-14 11:46:45,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=987, PETRI_PLACES=98, PETRI_TRANSITIONS=119} [2024-06-14 11:46:45,331 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2024-06-14 11:46:45,331 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 119 transitions, 987 flow [2024-06-14 11:46:45,331 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-14 11:46:45,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:45,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:45,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 11:46:45,332 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-14 11:46:45,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash 966964028, now seen corresponding path program 2 times [2024-06-14 11:46:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:45,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124292988] [2024-06-14 11:46:45,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:45,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:46,593 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-14 11:46:46,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124292988] [2024-06-14 11:46:46,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124292988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:46,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:46,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:46:46,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996342109] [2024-06-14 11:46:46,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:46,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:46:46,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:46,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:46:46,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:46:46,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:46,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 119 transitions, 987 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-14 11:46:46,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:46,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:46,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:47,634 INFO L124 PetriNetUnfolderBase]: 2399/3701 cut-off events. [2024-06-14 11:46:47,634 INFO L125 PetriNetUnfolderBase]: For 71121/71130 co-relation queries the response was YES. [2024-06-14 11:46:47,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20655 conditions, 3701 events. 2399/3701 cut-off events. For 71121/71130 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18870 event pairs, 706 based on Foata normal form. 10/3709 useless extension candidates. Maximal degree in co-relation 20611. Up to 3158 conditions per place. [2024-06-14 11:46:47,655 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 119 selfloop transitions, 89 changer transitions 0/214 dead transitions. [2024-06-14 11:46:47,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 214 transitions, 2245 flow [2024-06-14 11:46:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:46:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:46:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-14 11:46:47,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-14 11:46:47,657 INFO L175 Difference]: Start difference. First operand has 98 places, 119 transitions, 987 flow. Second operand 9 states and 186 transitions. [2024-06-14 11:46:47,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 214 transitions, 2245 flow [2024-06-14 11:46:47,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 214 transitions, 2111 flow, removed 66 selfloop flow, removed 1 redundant places. [2024-06-14 11:46:47,705 INFO L231 Difference]: Finished difference. Result has 110 places, 174 transitions, 1783 flow [2024-06-14 11:46:47,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1783, PETRI_PLACES=110, PETRI_TRANSITIONS=174} [2024-06-14 11:46:47,706 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 65 predicate places. [2024-06-14 11:46:47,706 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 174 transitions, 1783 flow [2024-06-14 11:46:47,706 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-14 11:46:47,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:47,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:47,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 11:46:47,707 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-14 11:46:47,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:47,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2076665008, now seen corresponding path program 3 times [2024-06-14 11:46:47,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:47,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7507665] [2024-06-14 11:46:47,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:47,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:48,891 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-14 11:46:48,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:48,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7507665] [2024-06-14 11:46:48,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7507665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:48,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:48,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:46:48,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053153661] [2024-06-14 11:46:48,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:48,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:46:48,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:48,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:46:48,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:46:49,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:49,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 174 transitions, 1783 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-14 11:46:49,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:49,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:49,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:49,831 INFO L124 PetriNetUnfolderBase]: 2625/4047 cut-off events. [2024-06-14 11:46:49,831 INFO L125 PetriNetUnfolderBase]: For 86512/86532 co-relation queries the response was YES. [2024-06-14 11:46:49,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24603 conditions, 4047 events. 2625/4047 cut-off events. For 86512/86532 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21134 event pairs, 1015 based on Foata normal form. 8/4031 useless extension candidates. Maximal degree in co-relation 24552. Up to 3482 conditions per place. [2024-06-14 11:46:49,872 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 163 selfloop transitions, 113 changer transitions 0/282 dead transitions. [2024-06-14 11:46:49,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 282 transitions, 3431 flow [2024-06-14 11:46:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:46:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:46:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-14 11:46:49,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2024-06-14 11:46:49,874 INFO L175 Difference]: Start difference. First operand has 110 places, 174 transitions, 1783 flow. Second operand 9 states and 184 transitions. [2024-06-14 11:46:49,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 282 transitions, 3431 flow [2024-06-14 11:46:50,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 282 transitions, 3328 flow, removed 46 selfloop flow, removed 2 redundant places. [2024-06-14 11:46:50,006 INFO L231 Difference]: Finished difference. Result has 121 places, 240 transitions, 2976 flow [2024-06-14 11:46:50,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1726, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2976, PETRI_PLACES=121, PETRI_TRANSITIONS=240} [2024-06-14 11:46:50,007 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 76 predicate places. [2024-06-14 11:46:50,007 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 240 transitions, 2976 flow [2024-06-14 11:46:50,007 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-14 11:46:50,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:50,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:50,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 11:46:50,008 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:46:50,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2007057236, now seen corresponding path program 3 times [2024-06-14 11:46:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:50,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125738009] [2024-06-14 11:46:50,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:51,094 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-14 11:46:51,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125738009] [2024-06-14 11:46:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125738009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:51,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:51,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:46:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239104170] [2024-06-14 11:46:51,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:51,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:46:51,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:51,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:46:51,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:46:51,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:51,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 240 transitions, 2976 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-14 11:46:51,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:51,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:51,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:52,151 INFO L124 PetriNetUnfolderBase]: 2661/4101 cut-off events. [2024-06-14 11:46:52,151 INFO L125 PetriNetUnfolderBase]: For 95975/95995 co-relation queries the response was YES. [2024-06-14 11:46:52,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26413 conditions, 4101 events. 2661/4101 cut-off events. For 95975/95995 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21341 event pairs, 1002 based on Foata normal form. 8/4086 useless extension candidates. Maximal degree in co-relation 26356. Up to 3762 conditions per place. [2024-06-14 11:46:52,181 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 231 selfloop transitions, 47 changer transitions 0/284 dead transitions. [2024-06-14 11:46:52,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 284 transitions, 3830 flow [2024-06-14 11:46:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:46:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:46:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-14 11:46:52,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-14 11:46:52,182 INFO L175 Difference]: Start difference. First operand has 121 places, 240 transitions, 2976 flow. Second operand 9 states and 174 transitions. [2024-06-14 11:46:52,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 284 transitions, 3830 flow [2024-06-14 11:46:52,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 284 transitions, 3701 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-14 11:46:52,274 INFO L231 Difference]: Finished difference. Result has 130 places, 255 transitions, 3205 flow [2024-06-14 11:46:52,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2849, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3205, PETRI_PLACES=130, PETRI_TRANSITIONS=255} [2024-06-14 11:46:52,275 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 85 predicate places. [2024-06-14 11:46:52,275 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 255 transitions, 3205 flow [2024-06-14 11:46:52,275 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-14 11:46:52,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:52,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:52,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 11:46:52,276 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-14 11:46:52,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1744370428, now seen corresponding path program 4 times [2024-06-14 11:46:52,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:52,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775379402] [2024-06-14 11:46:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:53,363 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-14 11:46:53,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:53,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775379402] [2024-06-14 11:46:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775379402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:53,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:46:53,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614124631] [2024-06-14 11:46:53,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:53,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:46:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:53,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:46:53,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:46:53,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:53,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 255 transitions, 3205 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-14 11:46:53,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:53,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:53,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:54,343 INFO L124 PetriNetUnfolderBase]: 2745/4235 cut-off events. [2024-06-14 11:46:54,344 INFO L125 PetriNetUnfolderBase]: For 106891/106914 co-relation queries the response was YES. [2024-06-14 11:46:54,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28251 conditions, 4235 events. 2745/4235 cut-off events. For 106891/106914 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 22309 event pairs, 1017 based on Foata normal form. 10/4221 useless extension candidates. Maximal degree in co-relation 28189. Up to 3722 conditions per place. [2024-06-14 11:46:54,374 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 211 selfloop transitions, 98 changer transitions 0/315 dead transitions. [2024-06-14 11:46:54,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 315 transitions, 4465 flow [2024-06-14 11:46:54,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:46:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:46:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-14 11:46:54,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2024-06-14 11:46:54,377 INFO L175 Difference]: Start difference. First operand has 130 places, 255 transitions, 3205 flow. Second operand 9 states and 184 transitions. [2024-06-14 11:46:54,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 315 transitions, 4465 flow [2024-06-14 11:46:54,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 315 transitions, 4371 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-14 11:46:54,512 INFO L231 Difference]: Finished difference. Result has 136 places, 278 transitions, 3748 flow [2024-06-14 11:46:54,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3111, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3748, PETRI_PLACES=136, PETRI_TRANSITIONS=278} [2024-06-14 11:46:54,513 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 91 predicate places. [2024-06-14 11:46:54,513 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 278 transitions, 3748 flow [2024-06-14 11:46:54,513 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-14 11:46:54,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:54,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:54,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 11:46:54,514 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-14 11:46:54,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1662977882, now seen corresponding path program 5 times [2024-06-14 11:46:54,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:54,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3241926] [2024-06-14 11:46:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:55,495 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-14 11:46:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:55,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3241926] [2024-06-14 11:46:55,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3241926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:55,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:55,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:46:55,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085117132] [2024-06-14 11:46:55,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:55,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:46:55,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:55,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:46:55,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:46:55,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:55,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 278 transitions, 3748 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-14 11:46:55,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:55,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:55,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:56,547 INFO L124 PetriNetUnfolderBase]: 2723/4204 cut-off events. [2024-06-14 11:46:56,547 INFO L125 PetriNetUnfolderBase]: For 113103/113126 co-relation queries the response was YES. [2024-06-14 11:46:56,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28378 conditions, 4204 events. 2723/4204 cut-off events. For 113103/113126 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 22083 event pairs, 1019 based on Foata normal form. 10/4190 useless extension candidates. Maximal degree in co-relation 28315. Up to 3758 conditions per place. [2024-06-14 11:46:56,578 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 225 selfloop transitions, 79 changer transitions 0/310 dead transitions. [2024-06-14 11:46:56,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 310 transitions, 4476 flow [2024-06-14 11:46:56,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:46:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:46:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-14 11:46:56,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45202020202020204 [2024-06-14 11:46:56,581 INFO L175 Difference]: Start difference. First operand has 136 places, 278 transitions, 3748 flow. Second operand 9 states and 179 transitions. [2024-06-14 11:46:56,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 310 transitions, 4476 flow [2024-06-14 11:46:56,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 310 transitions, 4202 flow, removed 101 selfloop flow, removed 4 redundant places. [2024-06-14 11:46:56,779 INFO L231 Difference]: Finished difference. Result has 141 places, 278 transitions, 3653 flow [2024-06-14 11:46:56,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3474, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3653, PETRI_PLACES=141, PETRI_TRANSITIONS=278} [2024-06-14 11:46:56,780 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 96 predicate places. [2024-06-14 11:46:56,780 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 278 transitions, 3653 flow [2024-06-14 11:46:56,780 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-14 11:46:56,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:56,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:56,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 11:46:56,780 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-14 11:46:56,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2136821936, now seen corresponding path program 4 times [2024-06-14 11:46:56,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:56,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902974045] [2024-06-14 11:46:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:57,817 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-14 11:46:57,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902974045] [2024-06-14 11:46:57,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902974045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:57,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:57,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:46:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502138252] [2024-06-14 11:46:57,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:57,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:46:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:46:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:46:57,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:57,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 278 transitions, 3653 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-14 11:46:57,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:57,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:57,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:58,746 INFO L124 PetriNetUnfolderBase]: 2745/4225 cut-off events. [2024-06-14 11:46:58,746 INFO L125 PetriNetUnfolderBase]: For 118695/118720 co-relation queries the response was YES. [2024-06-14 11:46:58,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28924 conditions, 4225 events. 2745/4225 cut-off events. For 118695/118720 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22133 event pairs, 1006 based on Foata normal form. 8/4210 useless extension candidates. Maximal degree in co-relation 28859. Up to 3844 conditions per place. [2024-06-14 11:46:58,777 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 245 selfloop transitions, 58 changer transitions 0/309 dead transitions. [2024-06-14 11:46:58,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 309 transitions, 4451 flow [2024-06-14 11:46:58,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:46:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:46:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 11:46:58,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403409090909091 [2024-06-14 11:46:58,779 INFO L175 Difference]: Start difference. First operand has 141 places, 278 transitions, 3653 flow. Second operand 8 states and 155 transitions. [2024-06-14 11:46:58,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 309 transitions, 4451 flow [2024-06-14 11:46:58,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 309 transitions, 4248 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 11:46:58,896 INFO L231 Difference]: Finished difference. Result has 141 places, 283 transitions, 3688 flow [2024-06-14 11:46:58,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3452, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3688, PETRI_PLACES=141, PETRI_TRANSITIONS=283} [2024-06-14 11:46:58,896 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 96 predicate places. [2024-06-14 11:46:58,897 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 283 transitions, 3688 flow [2024-06-14 11:46:58,897 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-14 11:46:58,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:58,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:58,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 11:46:58,897 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:46:58,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:58,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2136815240, now seen corresponding path program 6 times [2024-06-14 11:46:58,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:58,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408744666] [2024-06-14 11:46:58,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:58,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:46:59,900 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-14 11:46:59,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:59,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408744666] [2024-06-14 11:46:59,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408744666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:46:59,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:46:59,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:46:59,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23222859] [2024-06-14 11:46:59,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:46:59,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:46:59,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:59,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:46:59,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:46:59,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:46:59,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 283 transitions, 3688 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-14 11:46:59,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:59,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:46:59,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:00,772 INFO L124 PetriNetUnfolderBase]: 2795/4308 cut-off events. [2024-06-14 11:47:00,772 INFO L125 PetriNetUnfolderBase]: For 130131/130159 co-relation queries the response was YES. [2024-06-14 11:47:00,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30103 conditions, 4308 events. 2795/4308 cut-off events. For 130131/130159 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 22686 event pairs, 1023 based on Foata normal form. 10/4294 useless extension candidates. Maximal degree in co-relation 30037. Up to 3792 conditions per place. [2024-06-14 11:47:00,800 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 221 selfloop transitions, 100 changer transitions 0/327 dead transitions. [2024-06-14 11:47:00,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 327 transitions, 4714 flow [2024-06-14 11:47:00,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:47:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:47:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-14 11:47:00,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45170454545454547 [2024-06-14 11:47:00,802 INFO L175 Difference]: Start difference. First operand has 141 places, 283 transitions, 3688 flow. Second operand 8 states and 159 transitions. [2024-06-14 11:47:00,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 327 transitions, 4714 flow [2024-06-14 11:47:00,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 327 transitions, 4550 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-14 11:47:00,903 INFO L231 Difference]: Finished difference. Result has 143 places, 296 transitions, 4037 flow [2024-06-14 11:47:00,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3524, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4037, PETRI_PLACES=143, PETRI_TRANSITIONS=296} [2024-06-14 11:47:00,904 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places. [2024-06-14 11:47:00,904 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 296 transitions, 4037 flow [2024-06-14 11:47:00,904 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-14 11:47:00,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:00,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:00,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 11:47:00,904 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-14 11:47:00,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2136821750, now seen corresponding path program 7 times [2024-06-14 11:47:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:00,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808668898] [2024-06-14 11:47:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:02,132 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-14 11:47:02,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808668898] [2024-06-14 11:47:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808668898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:02,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:02,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:47:02,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011869375] [2024-06-14 11:47:02,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:02,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:47:02,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:02,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:47:02,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:47:02,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:02,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 296 transitions, 4037 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-14 11:47:02,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:02,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:02,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:03,169 INFO L124 PetriNetUnfolderBase]: 2845/4385 cut-off events. [2024-06-14 11:47:03,169 INFO L125 PetriNetUnfolderBase]: For 130899/130924 co-relation queries the response was YES. [2024-06-14 11:47:03,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30588 conditions, 4385 events. 2845/4385 cut-off events. For 130899/130924 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 23238 event pairs, 1011 based on Foata normal form. 10/4371 useless extension candidates. Maximal degree in co-relation 30521. Up to 3756 conditions per place. [2024-06-14 11:47:03,203 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 200 selfloop transitions, 137 changer transitions 0/343 dead transitions. [2024-06-14 11:47:03,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 343 transitions, 5140 flow [2024-06-14 11:47:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:47:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:47:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-14 11:47:03,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2024-06-14 11:47:03,205 INFO L175 Difference]: Start difference. First operand has 143 places, 296 transitions, 4037 flow. Second operand 8 states and 162 transitions. [2024-06-14 11:47:03,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 343 transitions, 5140 flow [2024-06-14 11:47:03,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 343 transitions, 4837 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-06-14 11:47:03,335 INFO L231 Difference]: Finished difference. Result has 144 places, 309 transitions, 4341 flow [2024-06-14 11:47:03,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3734, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4341, PETRI_PLACES=144, PETRI_TRANSITIONS=309} [2024-06-14 11:47:03,335 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 99 predicate places. [2024-06-14 11:47:03,335 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 309 transitions, 4341 flow [2024-06-14 11:47:03,336 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-14 11:47:03,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:03,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:03,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 11:47:03,336 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-14 11:47:03,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash 687506316, now seen corresponding path program 8 times [2024-06-14 11:47:03,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:03,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398503199] [2024-06-14 11:47:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:04,342 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-14 11:47:04,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:04,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398503199] [2024-06-14 11:47:04,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398503199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:04,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:04,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:47:04,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432611812] [2024-06-14 11:47:04,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:04,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:47:04,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:04,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:47:04,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:47:04,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:04,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 309 transitions, 4341 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-14 11:47:04,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:04,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:04,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:05,305 INFO L124 PetriNetUnfolderBase]: 2910/4486 cut-off events. [2024-06-14 11:47:05,306 INFO L125 PetriNetUnfolderBase]: For 134980/135002 co-relation queries the response was YES. [2024-06-14 11:47:05,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31568 conditions, 4486 events. 2910/4486 cut-off events. For 134980/135002 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 23825 event pairs, 1148 based on Foata normal form. 8/4468 useless extension candidates. Maximal degree in co-relation 31501. Up to 4102 conditions per place. [2024-06-14 11:47:05,343 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 298 selfloop transitions, 50 changer transitions 0/354 dead transitions. [2024-06-14 11:47:05,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 354 transitions, 5491 flow [2024-06-14 11:47:05,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:47:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:47:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 11:47:05,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 11:47:05,344 INFO L175 Difference]: Start difference. First operand has 144 places, 309 transitions, 4341 flow. Second operand 8 states and 154 transitions. [2024-06-14 11:47:05,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 354 transitions, 5491 flow [2024-06-14 11:47:05,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 354 transitions, 5085 flow, removed 73 selfloop flow, removed 7 redundant places. [2024-06-14 11:47:05,497 INFO L231 Difference]: Finished difference. Result has 145 places, 322 transitions, 4383 flow [2024-06-14 11:47:05,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3935, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4383, PETRI_PLACES=145, PETRI_TRANSITIONS=322} [2024-06-14 11:47:05,498 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 100 predicate places. [2024-06-14 11:47:05,498 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 322 transitions, 4383 flow [2024-06-14 11:47:05,498 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-14 11:47:05,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:05,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:05,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 11:47:05,499 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:47:05,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1389233338, now seen corresponding path program 5 times [2024-06-14 11:47:05,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:05,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986620370] [2024-06-14 11:47:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:05,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:06,531 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-14 11:47:06,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:06,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986620370] [2024-06-14 11:47:06,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986620370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:06,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:06,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:47:06,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891704553] [2024-06-14 11:47:06,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:06,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:47:06,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:06,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:47:06,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:47:06,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:06,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 322 transitions, 4383 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-14 11:47:06,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:06,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:06,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:07,532 INFO L124 PetriNetUnfolderBase]: 2916/4493 cut-off events. [2024-06-14 11:47:07,532 INFO L125 PetriNetUnfolderBase]: For 131651/131673 co-relation queries the response was YES. [2024-06-14 11:47:07,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31169 conditions, 4493 events. 2916/4493 cut-off events. For 131651/131673 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 23881 event pairs, 1147 based on Foata normal form. 4/4471 useless extension candidates. Maximal degree in co-relation 31102. Up to 4176 conditions per place. [2024-06-14 11:47:07,565 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 315 selfloop transitions, 27 changer transitions 0/348 dead transitions. [2024-06-14 11:47:07,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 348 transitions, 5209 flow [2024-06-14 11:47:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:47:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:47:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 11:47:07,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2024-06-14 11:47:07,566 INFO L175 Difference]: Start difference. First operand has 145 places, 322 transitions, 4383 flow. Second operand 8 states and 150 transitions. [2024-06-14 11:47:07,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 348 transitions, 5209 flow [2024-06-14 11:47:07,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 348 transitions, 4918 flow, removed 104 selfloop flow, removed 6 redundant places. [2024-06-14 11:47:07,691 INFO L231 Difference]: Finished difference. Result has 147 places, 325 transitions, 4220 flow [2024-06-14 11:47:07,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4094, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4220, PETRI_PLACES=147, PETRI_TRANSITIONS=325} [2024-06-14 11:47:07,692 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 102 predicate places. [2024-06-14 11:47:07,692 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 325 transitions, 4220 flow [2024-06-14 11:47:07,693 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-14 11:47:07,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:07,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:07,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 11:47:07,693 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-14 11:47:07,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1964331860, now seen corresponding path program 9 times [2024-06-14 11:47:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:07,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161731271] [2024-06-14 11:47:07,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:07,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:08,729 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-14 11:47:08,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161731271] [2024-06-14 11:47:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161731271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:08,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:08,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:47:08,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127351970] [2024-06-14 11:47:08,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:08,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:47:08,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:08,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:47:08,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:47:08,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:08,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 325 transitions, 4220 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-14 11:47:08,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:08,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:08,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:09,770 INFO L124 PetriNetUnfolderBase]: 2966/4568 cut-off events. [2024-06-14 11:47:09,771 INFO L125 PetriNetUnfolderBase]: For 142822/142847 co-relation queries the response was YES. [2024-06-14 11:47:09,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32193 conditions, 4568 events. 2966/4568 cut-off events. For 142822/142847 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 24338 event pairs, 1141 based on Foata normal form. 8/4550 useless extension candidates. Maximal degree in co-relation 32125. Up to 4074 conditions per place. [2024-06-14 11:47:09,807 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 285 selfloop transitions, 81 changer transitions 0/372 dead transitions. [2024-06-14 11:47:09,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 372 transitions, 5533 flow [2024-06-14 11:47:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:47:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:47:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-14 11:47:09,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4460227272727273 [2024-06-14 11:47:09,809 INFO L175 Difference]: Start difference. First operand has 147 places, 325 transitions, 4220 flow. Second operand 8 states and 157 transitions. [2024-06-14 11:47:09,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 372 transitions, 5533 flow [2024-06-14 11:47:09,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 372 transitions, 5429 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-14 11:47:09,971 INFO L231 Difference]: Finished difference. Result has 149 places, 338 transitions, 4623 flow [2024-06-14 11:47:09,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4116, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4623, PETRI_PLACES=149, PETRI_TRANSITIONS=338} [2024-06-14 11:47:09,971 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 104 predicate places. [2024-06-14 11:47:09,972 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 338 transitions, 4623 flow [2024-06-14 11:47:09,972 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-14 11:47:09,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:09,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:09,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 11:47:09,972 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:47:09,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash -17251686, now seen corresponding path program 10 times [2024-06-14 11:47:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687373614] [2024-06-14 11:47:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:11,051 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-14 11:47:11,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:11,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687373614] [2024-06-14 11:47:11,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687373614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:11,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:11,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:47:11,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286028001] [2024-06-14 11:47:11,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:11,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:47:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:11,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:47:11,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:47:11,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:11,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 338 transitions, 4623 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-14 11:47:11,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:11,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:11,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:12,036 INFO L124 PetriNetUnfolderBase]: 2944/4540 cut-off events. [2024-06-14 11:47:12,036 INFO L125 PetriNetUnfolderBase]: For 149196/149221 co-relation queries the response was YES. [2024-06-14 11:47:12,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32173 conditions, 4540 events. 2944/4540 cut-off events. For 149196/149221 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 24207 event pairs, 1154 based on Foata normal form. 8/4522 useless extension candidates. Maximal degree in co-relation 32104. Up to 4192 conditions per place. [2024-06-14 11:47:12,072 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 325 selfloop transitions, 35 changer transitions 0/366 dead transitions. [2024-06-14 11:47:12,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 366 transitions, 5462 flow [2024-06-14 11:47:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:47:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:47:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 11:47:12,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4289772727272727 [2024-06-14 11:47:12,074 INFO L175 Difference]: Start difference. First operand has 149 places, 338 transitions, 4623 flow. Second operand 8 states and 151 transitions. [2024-06-14 11:47:12,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 366 transitions, 5462 flow [2024-06-14 11:47:12,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 366 transitions, 5005 flow, removed 176 selfloop flow, removed 5 redundant places. [2024-06-14 11:47:12,254 INFO L231 Difference]: Finished difference. Result has 152 places, 338 transitions, 4257 flow [2024-06-14 11:47:12,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4166, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4257, PETRI_PLACES=152, PETRI_TRANSITIONS=338} [2024-06-14 11:47:12,254 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 107 predicate places. [2024-06-14 11:47:12,254 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 338 transitions, 4257 flow [2024-06-14 11:47:12,254 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-14 11:47:12,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:12,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:12,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 11:47:12,255 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:47:12,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash -16943856, now seen corresponding path program 1 times [2024-06-14 11:47:12,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:12,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254004935] [2024-06-14 11:47:12,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:12,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:13,384 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-14 11:47:13,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254004935] [2024-06-14 11:47:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254004935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:13,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:13,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:47:13,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613642498] [2024-06-14 11:47:13,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:13,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:47:13,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:13,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:47:13,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:47:13,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 11:47:13,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 338 transitions, 4257 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 11:47:13,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:13,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 11:47:13,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:14,546 INFO L124 PetriNetUnfolderBase]: 3585/5367 cut-off events. [2024-06-14 11:47:14,546 INFO L125 PetriNetUnfolderBase]: For 175707/175732 co-relation queries the response was YES. [2024-06-14 11:47:14,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37176 conditions, 5367 events. 3585/5367 cut-off events. For 175707/175732 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 27260 event pairs, 1449 based on Foata normal form. 4/5343 useless extension candidates. Maximal degree in co-relation 37106. Up to 5142 conditions per place. [2024-06-14 11:47:14,588 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 342 selfloop transitions, 19 changer transitions 0/366 dead transitions. [2024-06-14 11:47:14,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 366 transitions, 5136 flow [2024-06-14 11:47:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:47:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:47:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-14 11:47:14,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 11:47:14,589 INFO L175 Difference]: Start difference. First operand has 152 places, 338 transitions, 4257 flow. Second operand 8 states and 143 transitions. [2024-06-14 11:47:14,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 366 transitions, 5136 flow [2024-06-14 11:47:14,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 366 transitions, 4980 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-14 11:47:14,782 INFO L231 Difference]: Finished difference. Result has 154 places, 343 transitions, 4235 flow [2024-06-14 11:47:14,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4105, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4235, PETRI_PLACES=154, PETRI_TRANSITIONS=343} [2024-06-14 11:47:14,782 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 109 predicate places. [2024-06-14 11:47:14,783 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 343 transitions, 4235 flow [2024-06-14 11:47:14,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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-14 11:47:14,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:14,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:14,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 11:47:14,783 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-14 11:47:14,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:14,784 INFO L85 PathProgramCache]: Analyzing trace with hash 718833524, now seen corresponding path program 1 times [2024-06-14 11:47:14,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:14,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121257783] [2024-06-14 11:47:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:14,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:15,558 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-14 11:47:15,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:15,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121257783] [2024-06-14 11:47:15,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121257783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:15,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:15,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:47:15,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322845797] [2024-06-14 11:47:15,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:15,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:47:15,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:15,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:47:15,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:47:15,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:15,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 343 transitions, 4235 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-14 11:47:15,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:15,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:15,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:16,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([418] L781-->L788: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd1~0_58 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_61 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_93 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_75 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd1~0_60 (ite .cse0 0 v_~z$r_buff0_thd1~0_61)) (= v_~z$w_buff0_used~0_93 (ite .cse1 0 v_~z$w_buff0_used~0_94)) (= (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_75) v_~z$w_buff1_used~0_74) (= (ite .cse1 v_~z$w_buff0~0_42 (ite .cse2 v_~z$w_buff1~0_41 v_~z~0_61)) v_~z~0_60) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd1~0_60 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_58) v_~z$r_buff1_thd1~0_57)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_61} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_60, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][94], [Black: 255#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 237#true, 265#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 279#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 318#true, Black: 270#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 285#true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 442#true, 14#L798true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 148#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 461#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 434#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 308#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 249#true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 311#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 305#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 20#L788true, 44#$Ultimate##0true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 0) (= ~z~0 0))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 137#true, Black: 450#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 456#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 22#L870true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 99#(and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1))) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 115#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-14 11:47:16,115 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-14 11:47:16,115 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-14 11:47:16,115 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-14 11:47:16,116 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-14 11:47:16,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L819-->L821: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0][246], [30#L821true, Black: 255#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 237#true, 265#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 279#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 318#true, Black: 270#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 285#true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 442#true, 14#L798true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 148#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 461#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 434#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 308#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 249#true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 311#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 305#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 24#L781true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 0) (= ~z~0 0))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 137#true, Black: 450#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 456#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 22#L870true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 99#(and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1))) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 115#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-14 11:47:16,117 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-14 11:47:16,117 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-14 11:47:16,117 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-14 11:47:16,118 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-14 11:47:16,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L819-->L821: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0][249], [30#L821true, Black: 255#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 237#true, 265#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 279#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 318#true, Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 270#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 285#true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 442#true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 148#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 461#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 434#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 308#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 11#L801true, 249#true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 311#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 305#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 24#L781true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 0) (= ~z~0 0))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 137#true, Black: 450#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 456#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 22#L870true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 99#(and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1))) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 115#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-14 11:47:16,212 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-14 11:47:16,213 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 11:47:16,213 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 11:47:16,213 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-14 11:47:16,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([418] L781-->L788: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd1~0_58 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_61 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_93 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_75 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd1~0_60 (ite .cse0 0 v_~z$r_buff0_thd1~0_61)) (= v_~z$w_buff0_used~0_93 (ite .cse1 0 v_~z$w_buff0_used~0_94)) (= (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_75) v_~z$w_buff1_used~0_74) (= (ite .cse1 v_~z$w_buff0~0_42 (ite .cse2 v_~z$w_buff1~0_41 v_~z~0_61)) v_~z~0_60) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd1~0_60 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_58) v_~z$r_buff1_thd1~0_57)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_61} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_60, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][131], [Black: 255#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 237#true, 265#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 318#true, Black: 279#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 270#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 285#true, Black: 157#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 442#true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 148#true, Black: 292#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 293#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 461#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 434#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 11#L801true, Black: 308#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 249#true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 311#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 305#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 20#L788true, 44#$Ultimate##0true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 0) (= ~z~0 0))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 137#true, Black: 450#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 456#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 22#L870true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 99#(and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1))) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 115#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-14 11:47:16,217 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-14 11:47:16,217 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-14 11:47:16,217 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-14 11:47:16,217 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-14 11:47:16,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L870-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse0 (not (= |v_#ghost~multithreaded_7| 0)))) (or (and (or (< v_~x~0_9 0) (and (not (= v_~x~0_9 1)) (not (= v_~x~0_9 0))) (< 1 v_~x~0_9)) .cse0) (and (not (= (mod v_~z$r_buff0_thd0~0_7 256) 0)) .cse0) (and (< v_~__unbuffered_cnt~0_12 0) .cse0) (and (not (= (mod v_~z$r_buff0_thd3~0_21 256) 0)) .cse0) (and (or (not (= v_~z$read_delayed_var~0.offset_6 0)) (not (= v_~z$read_delayed_var~0.base_6 0))) .cse0) (and (not (= (mod v_~z$read_delayed~0_6 256) 0)) .cse0) (and .cse0 (or (and (not (= v_~__unbuffered_p1_EAX~0_7 0)) (not (= v_~__unbuffered_p1_EAX~0_7 1))) (< v_~__unbuffered_p1_EAX~0_7 0) (< 1 v_~__unbuffered_p1_EAX~0_7))) (and (or (and (not (= v_~z$mem_tmp~0_10 0)) (not (= v_~z$mem_tmp~0_10 1))) (< 1 v_~z$mem_tmp~0_10) (< v_~z$mem_tmp~0_10 0)) .cse0) (and .cse0 (not (= (mod v_~z$r_buff1_thd2~0_11 256) 0))) (and (or (< v_~z$w_buff0~0_17 0) (and (not (= v_~z$w_buff0~0_17 0)) (not (= v_~z$w_buff0~0_17 1))) (< 1 v_~z$w_buff0~0_17)) .cse0) (and (or (< 1 v_~__unbuffered_p2_EAX~0_7) (and (not (= v_~__unbuffered_p2_EAX~0_7 1)) (not (= v_~__unbuffered_p2_EAX~0_7 0))) (< v_~__unbuffered_p2_EAX~0_7 0)) .cse0) (and (or (< v_~__unbuffered_p0_EBX~0_7 0) (< 1 v_~__unbuffered_p0_EBX~0_7) (and (not (= v_~__unbuffered_p0_EBX~0_7 1)) (not (= v_~__unbuffered_p0_EBX~0_7 0)))) .cse0) (and (or (and (not (= v_~__unbuffered_p1_EBX~0_7 1)) (not (= v_~__unbuffered_p1_EBX~0_7 0))) (< v_~__unbuffered_p1_EBX~0_7 0) (< 1 v_~__unbuffered_p1_EBX~0_7)) .cse0) (and (or (and (not (= v_~__unbuffered_p2_EBX~0_7 1)) (not (= v_~__unbuffered_p2_EBX~0_7 0))) (< 1 v_~__unbuffered_p2_EBX~0_7) (< v_~__unbuffered_p2_EBX~0_7 0)) .cse0) (and .cse0 (not (= (mod v_~z$r_buff1_thd3~0_19 256) 0))) (and (not (= (mod v_~z$r_buff1_thd0~0_7 256) 0)) .cse0) (and (or (< v_~__unbuffered_p0_EAX~0_7 0) (and (not (= v_~__unbuffered_p0_EAX~0_7 1)) (not (= v_~__unbuffered_p0_EAX~0_7 0))) (< 1 v_~__unbuffered_p0_EAX~0_7)) .cse0) (and (not (= (mod v_~z$r_buff0_thd2~0_13 256) 0)) .cse0) (and (or (< v_~z~0_24 0) (< 1 v_~z~0_24) (and (not (= v_~z~0_24 0)) (not (= v_~z~0_24 1)))) .cse0) (and (or (< 1 v_~z$w_buff1~0_16) (< v_~z$w_buff1~0_16 0) (and (not (= v_~z$w_buff1~0_16 0)) (not (= v_~z$w_buff1~0_16 1)))) .cse0) (and (or (< 1 v_~y~0_9) (< v_~y~0_9 0) (and (not (= v_~y~0_9 1)) (not (= v_~y~0_9 0)))) .cse0) (and (not (= (mod v_~z$flush_delayed~0_12 256) 0)) .cse0))) InVars {~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_24, ~x~0=v_~x~0_9} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_24, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[][198], [Black: 255#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 237#true, 265#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 279#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 318#true, Black: 270#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 285#true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 442#true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 148#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 461#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 434#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 308#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 249#true, 11#L801true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 311#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 305#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 24#L781true, 44#$Ultimate##0true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 0) (= ~z~0 0))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 137#true, Black: 450#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 456#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 99#(and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1))) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 38#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 115#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-14 11:47:16,220 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-14 11:47:16,220 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-14 11:47:16,220 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-14 11:47:16,220 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-14 11:47:16,611 INFO L124 PetriNetUnfolderBase]: 3333/5103 cut-off events. [2024-06-14 11:47:16,612 INFO L125 PetriNetUnfolderBase]: For 183727/183902 co-relation queries the response was YES. [2024-06-14 11:47:16,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34872 conditions, 5103 events. 3333/5103 cut-off events. For 183727/183902 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 27062 event pairs, 1494 based on Foata normal form. 38/5081 useless extension candidates. Maximal degree in co-relation 34800. Up to 4642 conditions per place. [2024-06-14 11:47:16,741 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 246 selfloop transitions, 12 changer transitions 0/356 dead transitions. [2024-06-14 11:47:16,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 356 transitions, 4807 flow [2024-06-14 11:47:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:47:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:47:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-14 11:47:16,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 11:47:16,743 INFO L175 Difference]: Start difference. First operand has 154 places, 343 transitions, 4235 flow. Second operand 6 states and 110 transitions. [2024-06-14 11:47:16,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 356 transitions, 4807 flow [2024-06-14 11:47:16,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 356 transitions, 4732 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-14 11:47:16,907 INFO L231 Difference]: Finished difference. Result has 155 places, 346 transitions, 4224 flow [2024-06-14 11:47:16,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4160, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4224, PETRI_PLACES=155, PETRI_TRANSITIONS=346} [2024-06-14 11:47:16,908 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 110 predicate places. [2024-06-14 11:47:16,908 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 346 transitions, 4224 flow [2024-06-14 11:47:16,908 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-14 11:47:16,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:16,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:16,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 11:47:16,908 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:47:16,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash 317636695, now seen corresponding path program 1 times [2024-06-14 11:47:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:16,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563369719] [2024-06-14 11:47:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:18,005 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-14 11:47:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563369719] [2024-06-14 11:47:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563369719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:18,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:18,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:47:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131820184] [2024-06-14 11:47:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:18,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:47:18,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:47:18,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:47:18,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:18,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 346 transitions, 4224 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-14 11:47:18,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:18,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:18,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:19,233 INFO L124 PetriNetUnfolderBase]: 3281/5042 cut-off events. [2024-06-14 11:47:19,233 INFO L125 PetriNetUnfolderBase]: For 189246/189294 co-relation queries the response was YES. [2024-06-14 11:47:19,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36164 conditions, 5042 events. 3281/5042 cut-off events. For 189246/189294 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 27115 event pairs, 1134 based on Foata normal form. 30/5045 useless extension candidates. Maximal degree in co-relation 36091. Up to 4334 conditions per place. [2024-06-14 11:47:19,278 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 278 selfloop transitions, 110 changer transitions 0/395 dead transitions. [2024-06-14 11:47:19,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 395 transitions, 5408 flow [2024-06-14 11:47:19,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:47:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:47:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-06-14 11:47:19,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-06-14 11:47:19,279 INFO L175 Difference]: Start difference. First operand has 155 places, 346 transitions, 4224 flow. Second operand 10 states and 205 transitions. [2024-06-14 11:47:19,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 395 transitions, 5408 flow [2024-06-14 11:47:19,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 395 transitions, 5366 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 11:47:19,481 INFO L231 Difference]: Finished difference. Result has 161 places, 352 transitions, 4533 flow [2024-06-14 11:47:19,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4182, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4533, PETRI_PLACES=161, PETRI_TRANSITIONS=352} [2024-06-14 11:47:19,481 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 116 predicate places. [2024-06-14 11:47:19,481 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 352 transitions, 4533 flow [2024-06-14 11:47:19,481 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-14 11:47:19,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:19,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:19,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 11:47:19,482 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-14 11:47:19,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash -84048640, now seen corresponding path program 1 times [2024-06-14 11:47:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927180524] [2024-06-14 11:47:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:20,551 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-14 11:47:20,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:20,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927180524] [2024-06-14 11:47:20,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927180524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:20,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:20,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:47:20,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419166353] [2024-06-14 11:47:20,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:20,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:47:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:20,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:47:20,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:47:20,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:20,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 352 transitions, 4533 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-14 11:47:20,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:20,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:20,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:22,065 INFO L124 PetriNetUnfolderBase]: 3378/5162 cut-off events. [2024-06-14 11:47:22,066 INFO L125 PetriNetUnfolderBase]: For 207423/207462 co-relation queries the response was YES. [2024-06-14 11:47:22,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38170 conditions, 5162 events. 3378/5162 cut-off events. For 207423/207462 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 27645 event pairs, 1106 based on Foata normal form. 11/5147 useless extension candidates. Maximal degree in co-relation 38096. Up to 4710 conditions per place. [2024-06-14 11:47:22,115 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 349 selfloop transitions, 62 changer transitions 0/418 dead transitions. [2024-06-14 11:47:22,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 418 transitions, 5964 flow [2024-06-14 11:47:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 11:47:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 11:47:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-06-14 11:47:22,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4462809917355372 [2024-06-14 11:47:22,117 INFO L175 Difference]: Start difference. First operand has 161 places, 352 transitions, 4533 flow. Second operand 11 states and 216 transitions. [2024-06-14 11:47:22,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 418 transitions, 5964 flow [2024-06-14 11:47:22,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 418 transitions, 5781 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-14 11:47:22,349 INFO L231 Difference]: Finished difference. Result has 168 places, 373 transitions, 4786 flow [2024-06-14 11:47:22,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4352, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4786, PETRI_PLACES=168, PETRI_TRANSITIONS=373} [2024-06-14 11:47:22,350 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 123 predicate places. [2024-06-14 11:47:22,350 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 373 transitions, 4786 flow [2024-06-14 11:47:22,350 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-14 11:47:22,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:22,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:22,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 11:47:22,350 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-14 11:47:22,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash 532439057, now seen corresponding path program 2 times [2024-06-14 11:47:22,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:22,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774916326] [2024-06-14 11:47:22,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:23,337 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-14 11:47:23,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:23,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774916326] [2024-06-14 11:47:23,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774916326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:23,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:23,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:47:23,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227593974] [2024-06-14 11:47:23,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:23,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:47:23,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:23,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:47:23,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:47:23,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:23,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 373 transitions, 4786 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-14 11:47:23,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:23,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:23,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:24,879 INFO L124 PetriNetUnfolderBase]: 3532/5407 cut-off events. [2024-06-14 11:47:24,879 INFO L125 PetriNetUnfolderBase]: For 233548/233589 co-relation queries the response was YES. [2024-06-14 11:47:24,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41061 conditions, 5407 events. 3532/5407 cut-off events. For 233548/233589 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 29319 event pairs, 1078 based on Foata normal form. 17/5398 useless extension candidates. Maximal degree in co-relation 40983. Up to 4785 conditions per place. [2024-06-14 11:47:24,931 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 363 selfloop transitions, 68 changer transitions 0/438 dead transitions. [2024-06-14 11:47:24,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 438 transitions, 6296 flow [2024-06-14 11:47:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 11:47:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 11:47:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2024-06-14 11:47:24,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45265151515151514 [2024-06-14 11:47:24,932 INFO L175 Difference]: Start difference. First operand has 168 places, 373 transitions, 4786 flow. Second operand 12 states and 239 transitions. [2024-06-14 11:47:24,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 438 transitions, 6296 flow [2024-06-14 11:47:25,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 438 transitions, 6149 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-06-14 11:47:25,182 INFO L231 Difference]: Finished difference. Result has 177 places, 383 transitions, 5016 flow [2024-06-14 11:47:25,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4639, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5016, PETRI_PLACES=177, PETRI_TRANSITIONS=383} [2024-06-14 11:47:25,183 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 132 predicate places. [2024-06-14 11:47:25,183 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 383 transitions, 5016 flow [2024-06-14 11:47:25,183 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-14 11:47:25,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:25,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:25,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 11:47:25,184 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-14 11:47:25,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:25,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1334810188, now seen corresponding path program 2 times [2024-06-14 11:47:25,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:25,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457916711] [2024-06-14 11:47:25,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:25,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:26,378 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-14 11:47:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:26,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457916711] [2024-06-14 11:47:26,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457916711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:26,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:26,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:47:26,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92383962] [2024-06-14 11:47:26,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:26,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:47:26,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:26,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:47:26,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:47:26,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:26,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 383 transitions, 5016 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-14 11:47:26,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:26,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:26,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:27,725 INFO L124 PetriNetUnfolderBase]: 3612/5523 cut-off events. [2024-06-14 11:47:27,726 INFO L125 PetriNetUnfolderBase]: For 241300/241335 co-relation queries the response was YES. [2024-06-14 11:47:27,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42602 conditions, 5523 events. 3612/5523 cut-off events. For 241300/241335 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 29955 event pairs, 1154 based on Foata normal form. 12/5511 useless extension candidates. Maximal degree in co-relation 42521. Up to 5032 conditions per place. [2024-06-14 11:47:27,782 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 368 selfloop transitions, 69 changer transitions 0/444 dead transitions. [2024-06-14 11:47:27,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 444 transitions, 6360 flow [2024-06-14 11:47:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:47:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:47:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-14 11:47:27,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 11:47:27,784 INFO L175 Difference]: Start difference. First operand has 177 places, 383 transitions, 5016 flow. Second operand 9 states and 180 transitions. [2024-06-14 11:47:27,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 444 transitions, 6360 flow [2024-06-14 11:47:28,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 444 transitions, 6152 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-06-14 11:47:28,136 INFO L231 Difference]: Finished difference. Result has 180 places, 410 transitions, 5349 flow [2024-06-14 11:47:28,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4833, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5349, PETRI_PLACES=180, PETRI_TRANSITIONS=410} [2024-06-14 11:47:28,137 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 135 predicate places. [2024-06-14 11:47:28,137 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 410 transitions, 5349 flow [2024-06-14 11:47:28,137 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-14 11:47:28,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:28,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:28,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 11:47:28,138 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:47:28,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:28,139 INFO L85 PathProgramCache]: Analyzing trace with hash -203938397, now seen corresponding path program 3 times [2024-06-14 11:47:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:28,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448484081] [2024-06-14 11:47:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:29,212 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-14 11:47:29,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:29,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448484081] [2024-06-14 11:47:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448484081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:29,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:29,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:47:29,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566427465] [2024-06-14 11:47:29,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:29,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:47:29,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:29,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:47:29,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:47:29,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:29,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 410 transitions, 5349 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-14 11:47:29,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:29,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:29,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:30,736 INFO L124 PetriNetUnfolderBase]: 3712/5690 cut-off events. [2024-06-14 11:47:30,736 INFO L125 PetriNetUnfolderBase]: For 256281/256316 co-relation queries the response was YES. [2024-06-14 11:47:30,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43595 conditions, 5690 events. 3712/5690 cut-off events. For 256281/256316 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 31135 event pairs, 1153 based on Foata normal form. 21/5691 useless extension candidates. Maximal degree in co-relation 43511. Up to 5078 conditions per place. [2024-06-14 11:47:30,802 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 374 selfloop transitions, 78 changer transitions 0/459 dead transitions. [2024-06-14 11:47:30,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 459 transitions, 6549 flow [2024-06-14 11:47:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:47:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:47:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-14 11:47:30,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45227272727272727 [2024-06-14 11:47:30,803 INFO L175 Difference]: Start difference. First operand has 180 places, 410 transitions, 5349 flow. Second operand 10 states and 199 transitions. [2024-06-14 11:47:30,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 459 transitions, 6549 flow [2024-06-14 11:47:31,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 459 transitions, 6410 flow, removed 35 selfloop flow, removed 4 redundant places. [2024-06-14 11:47:31,293 INFO L231 Difference]: Finished difference. Result has 186 places, 419 transitions, 5523 flow [2024-06-14 11:47:31,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5210, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5523, PETRI_PLACES=186, PETRI_TRANSITIONS=419} [2024-06-14 11:47:31,293 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 141 predicate places. [2024-06-14 11:47:31,293 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 419 transitions, 5523 flow [2024-06-14 11:47:31,293 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-14 11:47:31,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:31,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:31,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 11:47:31,294 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-14 11:47:31,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash -88890887, now seen corresponding path program 4 times [2024-06-14 11:47:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:31,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926674067] [2024-06-14 11:47:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:31,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:32,513 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-14 11:47:32,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:32,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926674067] [2024-06-14 11:47:32,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926674067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:32,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:32,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:47:32,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790536069] [2024-06-14 11:47:32,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:32,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:47:32,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:32,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:47:32,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:47:32,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:32,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 419 transitions, 5523 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-14 11:47:32,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:32,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:32,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:34,347 INFO L124 PetriNetUnfolderBase]: 3884/5942 cut-off events. [2024-06-14 11:47:34,347 INFO L125 PetriNetUnfolderBase]: For 287174/287239 co-relation queries the response was YES. [2024-06-14 11:47:34,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46397 conditions, 5942 events. 3884/5942 cut-off events. For 287174/287239 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 32998 event pairs, 1018 based on Foata normal form. 22/5921 useless extension candidates. Maximal degree in co-relation 46312. Up to 4611 conditions per place. [2024-06-14 11:47:34,405 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 320 selfloop transitions, 194 changer transitions 0/521 dead transitions. [2024-06-14 11:47:34,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 521 transitions, 7873 flow [2024-06-14 11:47:34,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:47:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:47:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions. [2024-06-14 11:47:34,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2024-06-14 11:47:34,406 INFO L175 Difference]: Start difference. First operand has 186 places, 419 transitions, 5523 flow. Second operand 10 states and 212 transitions. [2024-06-14 11:47:34,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 521 transitions, 7873 flow [2024-06-14 11:47:34,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 521 transitions, 7618 flow, removed 52 selfloop flow, removed 8 redundant places. [2024-06-14 11:47:34,775 INFO L231 Difference]: Finished difference. Result has 192 places, 466 transitions, 6582 flow [2024-06-14 11:47:34,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5322, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6582, PETRI_PLACES=192, PETRI_TRANSITIONS=466} [2024-06-14 11:47:34,776 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 147 predicate places. [2024-06-14 11:47:34,776 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 466 transitions, 6582 flow [2024-06-14 11:47:34,777 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-14 11:47:34,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:34,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:34,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 11:47:34,777 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-14 11:47:34,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -432977092, now seen corresponding path program 3 times [2024-06-14 11:47:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:34,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023971217] [2024-06-14 11:47:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:34,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:36,696 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-14 11:47:36,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:36,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023971217] [2024-06-14 11:47:36,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023971217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:36,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:36,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:47:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813392003] [2024-06-14 11:47:36,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:36,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:47:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:36,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:47:36,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:47:36,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:36,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 466 transitions, 6582 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-14 11:47:36,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:36,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:36,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:38,464 INFO L124 PetriNetUnfolderBase]: 3892/5950 cut-off events. [2024-06-14 11:47:38,464 INFO L125 PetriNetUnfolderBase]: For 298346/298421 co-relation queries the response was YES. [2024-06-14 11:47:38,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48601 conditions, 5950 events. 3892/5950 cut-off events. For 298346/298421 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 32885 event pairs, 1072 based on Foata normal form. 20/5938 useless extension candidates. Maximal degree in co-relation 48511. Up to 5247 conditions per place. [2024-06-14 11:47:38,519 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 377 selfloop transitions, 132 changer transitions 0/516 dead transitions. [2024-06-14 11:47:38,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 516 transitions, 7961 flow [2024-06-14 11:47:38,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:47:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:47:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-14 11:47:38,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44772727272727275 [2024-06-14 11:47:38,520 INFO L175 Difference]: Start difference. First operand has 192 places, 466 transitions, 6582 flow. Second operand 10 states and 197 transitions. [2024-06-14 11:47:38,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 516 transitions, 7961 flow [2024-06-14 11:47:38,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 516 transitions, 7786 flow, removed 60 selfloop flow, removed 3 redundant places. [2024-06-14 11:47:38,949 INFO L231 Difference]: Finished difference. Result has 200 places, 480 transitions, 6933 flow [2024-06-14 11:47:38,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6409, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6933, PETRI_PLACES=200, PETRI_TRANSITIONS=480} [2024-06-14 11:47:38,950 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 155 predicate places. [2024-06-14 11:47:38,950 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 480 transitions, 6933 flow [2024-06-14 11:47:38,950 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-14 11:47:38,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:38,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:38,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 11:47:38,951 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-14 11:47:38,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash -432971357, now seen corresponding path program 5 times [2024-06-14 11:47:38,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:38,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137036900] [2024-06-14 11:47:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:40,127 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-14 11:47:40,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:40,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137036900] [2024-06-14 11:47:40,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137036900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:40,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:40,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:47:40,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162961263] [2024-06-14 11:47:40,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:40,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:47:40,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:40,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:47:40,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:47:40,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:40,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 480 transitions, 6933 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-14 11:47:40,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:40,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:40,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:41,898 INFO L124 PetriNetUnfolderBase]: 3885/5951 cut-off events. [2024-06-14 11:47:41,898 INFO L125 PetriNetUnfolderBase]: For 320231/320309 co-relation queries the response was YES. [2024-06-14 11:47:41,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49656 conditions, 5951 events. 3885/5951 cut-off events. For 320231/320309 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 33146 event pairs, 1008 based on Foata normal form. 28/5936 useless extension candidates. Maximal degree in co-relation 49563. Up to 4619 conditions per place. [2024-06-14 11:47:41,967 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 316 selfloop transitions, 200 changer transitions 0/523 dead transitions. [2024-06-14 11:47:41,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 523 transitions, 8397 flow [2024-06-14 11:47:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:47:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:47:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-06-14 11:47:41,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-06-14 11:47:41,969 INFO L175 Difference]: Start difference. First operand has 200 places, 480 transitions, 6933 flow. Second operand 10 states and 208 transitions. [2024-06-14 11:47:41,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 523 transitions, 8397 flow [2024-06-14 11:47:42,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 523 transitions, 8106 flow, removed 65 selfloop flow, removed 6 redundant places. [2024-06-14 11:47:42,460 INFO L231 Difference]: Finished difference. Result has 204 places, 480 transitions, 7052 flow [2024-06-14 11:47:42,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6642, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7052, PETRI_PLACES=204, PETRI_TRANSITIONS=480} [2024-06-14 11:47:42,461 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 159 predicate places. [2024-06-14 11:47:42,461 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 480 transitions, 7052 flow [2024-06-14 11:47:42,461 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-14 11:47:42,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:42,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:42,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 11:47:42,462 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:47:42,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:42,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1906796228, now seen corresponding path program 4 times [2024-06-14 11:47:42,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:42,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868471289] [2024-06-14 11:47:42,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:43,652 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-14 11:47:43,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:43,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868471289] [2024-06-14 11:47:43,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868471289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:43,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:43,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:47:43,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960382429] [2024-06-14 11:47:43,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:43,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:47:43,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:43,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:47:43,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:47:43,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:43,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 480 transitions, 7052 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-14 11:47:43,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:43,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:43,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:45,195 INFO L124 PetriNetUnfolderBase]: 3998/6116 cut-off events. [2024-06-14 11:47:45,195 INFO L125 PetriNetUnfolderBase]: For 329264/329339 co-relation queries the response was YES. [2024-06-14 11:47:45,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51178 conditions, 6116 events. 3998/6116 cut-off events. For 329264/329339 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 34006 event pairs, 1192 based on Foata normal form. 15/6099 useless extension candidates. Maximal degree in co-relation 51086. Up to 5648 conditions per place. [2024-06-14 11:47:45,266 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 485 selfloop transitions, 61 changer transitions 0/553 dead transitions. [2024-06-14 11:47:45,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 553 transitions, 8904 flow [2024-06-14 11:47:45,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:47:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:47:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-14 11:47:45,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-14 11:47:45,267 INFO L175 Difference]: Start difference. First operand has 204 places, 480 transitions, 7052 flow. Second operand 9 states and 174 transitions. [2024-06-14 11:47:45,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 553 transitions, 8904 flow [2024-06-14 11:47:45,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 553 transitions, 8467 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 11:47:45,790 INFO L231 Difference]: Finished difference. Result has 207 places, 516 transitions, 7410 flow [2024-06-14 11:47:45,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6651, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7410, PETRI_PLACES=207, PETRI_TRANSITIONS=516} [2024-06-14 11:47:45,791 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 162 predicate places. [2024-06-14 11:47:45,791 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 516 transitions, 7410 flow [2024-06-14 11:47:45,792 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-14 11:47:45,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:45,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:45,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 11:47:45,792 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:47:45,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1906705863, now seen corresponding path program 6 times [2024-06-14 11:47:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:45,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123172079] [2024-06-14 11:47:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:46,907 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-14 11:47:46,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123172079] [2024-06-14 11:47:46,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123172079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:46,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:46,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:47:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759325922] [2024-06-14 11:47:46,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:46,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:47:46,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:46,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:47:46,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:47:47,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:47,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 516 transitions, 7410 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-14 11:47:47,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:47,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:47,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:48,676 INFO L124 PetriNetUnfolderBase]: 4133/6333 cut-off events. [2024-06-14 11:47:48,676 INFO L125 PetriNetUnfolderBase]: For 351302/351377 co-relation queries the response was YES. [2024-06-14 11:47:48,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52368 conditions, 6333 events. 4133/6333 cut-off events. For 351302/351377 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 35576 event pairs, 1206 based on Foata normal form. 25/6326 useless extension candidates. Maximal degree in co-relation 52273. Up to 5713 conditions per place. [2024-06-14 11:47:48,735 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 496 selfloop transitions, 80 changer transitions 0/583 dead transitions. [2024-06-14 11:47:48,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 583 transitions, 9165 flow [2024-06-14 11:47:48,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:47:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:47:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-14 11:47:48,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-06-14 11:47:48,736 INFO L175 Difference]: Start difference. First operand has 207 places, 516 transitions, 7410 flow. Second operand 10 states and 193 transitions. [2024-06-14 11:47:48,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 583 transitions, 9165 flow [2024-06-14 11:47:49,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 583 transitions, 9012 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-14 11:47:49,257 INFO L231 Difference]: Finished difference. Result has 213 places, 535 transitions, 7787 flow [2024-06-14 11:47:49,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7265, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7787, PETRI_PLACES=213, PETRI_TRANSITIONS=535} [2024-06-14 11:47:49,258 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 168 predicate places. [2024-06-14 11:47:49,258 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 535 transitions, 7787 flow [2024-06-14 11:47:49,258 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-14 11:47:49,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:49,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:49,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 11:47:49,259 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:47:49,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:49,260 INFO L85 PathProgramCache]: Analyzing trace with hash -131384653, now seen corresponding path program 7 times [2024-06-14 11:47:49,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:49,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82464688] [2024-06-14 11:47:49,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:49,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:50,323 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-14 11:47:50,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:50,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82464688] [2024-06-14 11:47:50,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82464688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:50,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:50,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:47:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253953170] [2024-06-14 11:47:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:50,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:47:50,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:50,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:47:50,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:47:50,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:50,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 535 transitions, 7787 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-14 11:47:50,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:50,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:50,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:52,195 INFO L124 PetriNetUnfolderBase]: 4430/6786 cut-off events. [2024-06-14 11:47:52,195 INFO L125 PetriNetUnfolderBase]: For 392995/393033 co-relation queries the response was YES. [2024-06-14 11:47:52,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57198 conditions, 6786 events. 4430/6786 cut-off events. For 392995/393033 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 38796 event pairs, 1208 based on Foata normal form. 30/6778 useless extension candidates. Maximal degree in co-relation 57102. Up to 5234 conditions per place. [2024-06-14 11:47:52,287 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 416 selfloop transitions, 241 changer transitions 0/664 dead transitions. [2024-06-14 11:47:52,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 664 transitions, 11004 flow [2024-06-14 11:47:52,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:47:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:47:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2024-06-14 11:47:52,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48409090909090907 [2024-06-14 11:47:52,289 INFO L175 Difference]: Start difference. First operand has 213 places, 535 transitions, 7787 flow. Second operand 10 states and 213 transitions. [2024-06-14 11:47:52,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 664 transitions, 11004 flow [2024-06-14 11:47:52,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 664 transitions, 10784 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-06-14 11:47:52,925 INFO L231 Difference]: Finished difference. Result has 219 places, 573 transitions, 9044 flow [2024-06-14 11:47:52,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7567, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9044, PETRI_PLACES=219, PETRI_TRANSITIONS=573} [2024-06-14 11:47:52,926 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 174 predicate places. [2024-06-14 11:47:52,927 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 573 transitions, 9044 flow [2024-06-14 11:47:52,927 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-14 11:47:52,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:52,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:52,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 11:47:52,928 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-14 11:47:52,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1902986948, now seen corresponding path program 5 times [2024-06-14 11:47:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561800397] [2024-06-14 11:47:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:54,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-14 11:47:54,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:54,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561800397] [2024-06-14 11:47:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561800397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:54,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:54,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:47:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838288296] [2024-06-14 11:47:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:54,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:47:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:54,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:47:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:47:54,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:54,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 573 transitions, 9044 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-14 11:47:54,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:54,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:54,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:47:56,231 INFO L124 PetriNetUnfolderBase]: 4425/6781 cut-off events. [2024-06-14 11:47:56,231 INFO L125 PetriNetUnfolderBase]: For 410318/410335 co-relation queries the response was YES. [2024-06-14 11:47:56,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59036 conditions, 6781 events. 4425/6781 cut-off events. For 410318/410335 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 38804 event pairs, 1211 based on Foata normal form. 6/6748 useless extension candidates. Maximal degree in co-relation 58937. Up to 6082 conditions per place. [2024-06-14 11:47:56,313 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 493 selfloop transitions, 126 changer transitions 0/626 dead transitions. [2024-06-14 11:47:56,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 626 transitions, 10682 flow [2024-06-14 11:47:56,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:47:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:47:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-14 11:47:56,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 11:47:56,315 INFO L175 Difference]: Start difference. First operand has 219 places, 573 transitions, 9044 flow. Second operand 9 states and 180 transitions. [2024-06-14 11:47:56,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 626 transitions, 10682 flow [2024-06-14 11:47:57,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 626 transitions, 10371 flow, removed 117 selfloop flow, removed 4 redundant places. [2024-06-14 11:47:57,075 INFO L231 Difference]: Finished difference. Result has 225 places, 579 transitions, 9126 flow [2024-06-14 11:47:57,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8733, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9126, PETRI_PLACES=225, PETRI_TRANSITIONS=579} [2024-06-14 11:47:57,075 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 180 predicate places. [2024-06-14 11:47:57,076 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 579 transitions, 9126 flow [2024-06-14 11:47:57,076 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-14 11:47:57,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:47:57,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:47:57,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 11:47:57,076 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-14 11:47:57,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:47:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash -47898875, now seen corresponding path program 8 times [2024-06-14 11:47:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:47:57,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568973701] [2024-06-14 11:47:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:47:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:47:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:47:58,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-14 11:47:58,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:47:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568973701] [2024-06-14 11:47:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568973701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:47:58,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:47:58,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:47:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873861541] [2024-06-14 11:47:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:47:58,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:47:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:47:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:47:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:47:58,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:47:58,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 579 transitions, 9126 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-14 11:47:58,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:47:58,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:47:58,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:00,175 INFO L124 PetriNetUnfolderBase]: 4399/6741 cut-off events. [2024-06-14 11:48:00,176 INFO L125 PetriNetUnfolderBase]: For 415227/415265 co-relation queries the response was YES. [2024-06-14 11:48:00,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58286 conditions, 6741 events. 4399/6741 cut-off events. For 415227/415265 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 38443 event pairs, 1202 based on Foata normal form. 30/6733 useless extension candidates. Maximal degree in co-relation 58184. Up to 5216 conditions per place. [2024-06-14 11:48:00,256 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 425 selfloop transitions, 233 changer transitions 0/665 dead transitions. [2024-06-14 11:48:00,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 665 transitions, 11309 flow [2024-06-14 11:48:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:48:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:48:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2024-06-14 11:48:00,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47954545454545455 [2024-06-14 11:48:00,258 INFO L175 Difference]: Start difference. First operand has 225 places, 579 transitions, 9126 flow. Second operand 10 states and 211 transitions. [2024-06-14 11:48:00,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 665 transitions, 11309 flow [2024-06-14 11:48:00,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 665 transitions, 10985 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-14 11:48:01,005 INFO L231 Difference]: Finished difference. Result has 228 places, 579 transitions, 9285 flow [2024-06-14 11:48:01,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8802, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9285, PETRI_PLACES=228, PETRI_TRANSITIONS=579} [2024-06-14 11:48:01,006 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 183 predicate places. [2024-06-14 11:48:01,006 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 579 transitions, 9285 flow [2024-06-14 11:48:01,006 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-14 11:48:01,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:01,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:01,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 11:48:01,007 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-14 11:48:01,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash 317844085, now seen corresponding path program 9 times [2024-06-14 11:48:01,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:01,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788119631] [2024-06-14 11:48:01,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:02,079 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-14 11:48:02,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:02,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788119631] [2024-06-14 11:48:02,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788119631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:02,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:02,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:48:02,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588424553] [2024-06-14 11:48:02,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:02,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:48:02,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:02,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:48:02,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:48:02,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:02,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 579 transitions, 9285 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-14 11:48:02,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:02,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:02,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:03,869 INFO L124 PetriNetUnfolderBase]: 4457/6825 cut-off events. [2024-06-14 11:48:03,869 INFO L125 PetriNetUnfolderBase]: For 435168/435215 co-relation queries the response was YES. [2024-06-14 11:48:03,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59649 conditions, 6825 events. 4457/6825 cut-off events. For 435168/435215 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 39021 event pairs, 1232 based on Foata normal form. 42/6831 useless extension candidates. Maximal degree in co-relation 59546. Up to 6171 conditions per place. [2024-06-14 11:48:03,950 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 532 selfloop transitions, 88 changer transitions 0/627 dead transitions. [2024-06-14 11:48:03,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 627 transitions, 10921 flow [2024-06-14 11:48:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:48:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:48:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-14 11:48:03,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-14 11:48:03,952 INFO L175 Difference]: Start difference. First operand has 228 places, 579 transitions, 9285 flow. Second operand 10 states and 198 transitions. [2024-06-14 11:48:03,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 627 transitions, 10921 flow [2024-06-14 11:48:04,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 627 transitions, 10354 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-14 11:48:04,678 INFO L231 Difference]: Finished difference. Result has 229 places, 585 transitions, 9070 flow [2024-06-14 11:48:04,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8730, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9070, PETRI_PLACES=229, PETRI_TRANSITIONS=585} [2024-06-14 11:48:04,679 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 184 predicate places. [2024-06-14 11:48:04,679 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 585 transitions, 9070 flow [2024-06-14 11:48:04,679 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-14 11:48:04,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:04,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:04,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 11:48:04,680 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-14 11:48:04,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash -42530915, now seen corresponding path program 10 times [2024-06-14 11:48:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:04,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119040130] [2024-06-14 11:48:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:04,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:05,735 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-14 11:48:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119040130] [2024-06-14 11:48:05,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119040130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:05,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:05,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:48:05,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884254771] [2024-06-14 11:48:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:05,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:48:05,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:05,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:48:05,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:48:05,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:05,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 585 transitions, 9070 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-14 11:48:05,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:05,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:05,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:07,525 INFO L124 PetriNetUnfolderBase]: 4431/6789 cut-off events. [2024-06-14 11:48:07,525 INFO L125 PetriNetUnfolderBase]: For 438925/438972 co-relation queries the response was YES. [2024-06-14 11:48:07,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58700 conditions, 6789 events. 4431/6789 cut-off events. For 438925/438972 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 38794 event pairs, 1225 based on Foata normal form. 42/6795 useless extension candidates. Maximal degree in co-relation 58596. Up to 5919 conditions per place. [2024-06-14 11:48:07,611 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 518 selfloop transitions, 119 changer transitions 0/644 dead transitions. [2024-06-14 11:48:07,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 644 transitions, 10780 flow [2024-06-14 11:48:07,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:48:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:48:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-06-14 11:48:07,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-06-14 11:48:07,613 INFO L175 Difference]: Start difference. First operand has 229 places, 585 transitions, 9070 flow. Second operand 10 states and 205 transitions. [2024-06-14 11:48:07,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 644 transitions, 10780 flow [2024-06-14 11:48:08,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 644 transitions, 10495 flow, removed 60 selfloop flow, removed 8 redundant places. [2024-06-14 11:48:08,568 INFO L231 Difference]: Finished difference. Result has 231 places, 585 transitions, 9038 flow [2024-06-14 11:48:08,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8785, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9038, PETRI_PLACES=231, PETRI_TRANSITIONS=585} [2024-06-14 11:48:08,569 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 186 predicate places. [2024-06-14 11:48:08,569 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 585 transitions, 9038 flow [2024-06-14 11:48:08,569 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-14 11:48:08,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:08,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:08,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 11:48:08,570 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:48:08,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:08,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2005631771, now seen corresponding path program 1 times [2024-06-14 11:48:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:08,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633951540] [2024-06-14 11:48:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:08,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:09,254 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-14 11:48:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633951540] [2024-06-14 11:48:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633951540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:48:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737061101] [2024-06-14 11:48:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:09,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:48:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:48:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:48:09,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:09,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 585 transitions, 9038 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-14 11:48:09,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:09,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:09,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:10,888 INFO L124 PetriNetUnfolderBase]: 4893/7399 cut-off events. [2024-06-14 11:48:10,888 INFO L125 PetriNetUnfolderBase]: For 486087/486600 co-relation queries the response was YES. [2024-06-14 11:48:10,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63017 conditions, 7399 events. 4893/7399 cut-off events. For 486087/486600 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 41732 event pairs, 1539 based on Foata normal form. 110/7405 useless extension candidates. Maximal degree in co-relation 62912. Up to 6731 conditions per place. [2024-06-14 11:48:10,984 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 446 selfloop transitions, 24 changer transitions 0/609 dead transitions. [2024-06-14 11:48:10,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 609 transitions, 10192 flow [2024-06-14 11:48:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:48:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:48:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-14 11:48:10,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2024-06-14 11:48:10,985 INFO L175 Difference]: Start difference. First operand has 231 places, 585 transitions, 9038 flow. Second operand 7 states and 135 transitions. [2024-06-14 11:48:10,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 609 transitions, 10192 flow [2024-06-14 11:48:11,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 609 transitions, 9913 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 11:48:11,717 INFO L231 Difference]: Finished difference. Result has 229 places, 591 transitions, 8876 flow [2024-06-14 11:48:11,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8759, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8876, PETRI_PLACES=229, PETRI_TRANSITIONS=591} [2024-06-14 11:48:11,718 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 184 predicate places. [2024-06-14 11:48:11,718 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 591 transitions, 8876 flow [2024-06-14 11:48:11,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-14 11:48:11,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:11,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:11,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 11:48:11,718 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-14 11:48:11,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1539350727, now seen corresponding path program 1 times [2024-06-14 11:48:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:11,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570906402] [2024-06-14 11:48:11,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:13,342 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-14 11:48:13,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:13,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570906402] [2024-06-14 11:48:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570906402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:13,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:13,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:48:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943085424] [2024-06-14 11:48:13,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:13,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:48:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:13,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:48:13,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:48:13,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:13,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 591 transitions, 8876 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:48:13,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:13,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:13,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:15,546 INFO L124 PetriNetUnfolderBase]: 4509/6885 cut-off events. [2024-06-14 11:48:15,546 INFO L125 PetriNetUnfolderBase]: For 476822/476912 co-relation queries the response was YES. [2024-06-14 11:48:15,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60153 conditions, 6885 events. 4509/6885 cut-off events. For 476822/476912 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 39347 event pairs, 1031 based on Foata normal form. 28/6867 useless extension candidates. Maximal degree in co-relation 60047. Up to 5327 conditions per place. [2024-06-14 11:48:15,641 INFO L140 encePairwiseOnDemand]: 28/44 looper letters, 399 selfloop transitions, 238 changer transitions 0/646 dead transitions. [2024-06-14 11:48:15,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 646 transitions, 10784 flow [2024-06-14 11:48:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 11:48:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 11:48:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2024-06-14 11:48:15,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47107438016528924 [2024-06-14 11:48:15,642 INFO L175 Difference]: Start difference. First operand has 229 places, 591 transitions, 8876 flow. Second operand 11 states and 228 transitions. [2024-06-14 11:48:15,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 646 transitions, 10784 flow [2024-06-14 11:48:16,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 646 transitions, 10746 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-14 11:48:16,499 INFO L231 Difference]: Finished difference. Result has 237 places, 597 transitions, 9447 flow [2024-06-14 11:48:16,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8838, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9447, PETRI_PLACES=237, PETRI_TRANSITIONS=597} [2024-06-14 11:48:16,499 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 192 predicate places. [2024-06-14 11:48:16,499 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 597 transitions, 9447 flow [2024-06-14 11:48:16,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:48:16,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:16,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:16,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 11:48:16,500 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:48:16,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:16,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1961008048, now seen corresponding path program 6 times [2024-06-14 11:48:16,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:16,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758209338] [2024-06-14 11:48:16,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:16,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:18,292 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-14 11:48:18,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:18,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758209338] [2024-06-14 11:48:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758209338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:18,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:48:18,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020774221] [2024-06-14 11:48:18,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:18,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:48:18,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:18,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:48:18,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:48:18,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:18,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 597 transitions, 9447 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-14 11:48:18,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:18,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:18,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:20,291 INFO L124 PetriNetUnfolderBase]: 4596/7002 cut-off events. [2024-06-14 11:48:20,291 INFO L125 PetriNetUnfolderBase]: For 499605/499708 co-relation queries the response was YES. [2024-06-14 11:48:20,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63022 conditions, 7002 events. 4596/7002 cut-off events. For 499605/499708 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 40049 event pairs, 1197 based on Foata normal form. 19/6969 useless extension candidates. Maximal degree in co-relation 62914. Up to 6276 conditions per place. [2024-06-14 11:48:20,367 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 507 selfloop transitions, 154 changer transitions 0/670 dead transitions. [2024-06-14 11:48:20,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 670 transitions, 11633 flow [2024-06-14 11:48:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:48:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:48:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-14 11:48:20,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-14 11:48:20,369 INFO L175 Difference]: Start difference. First operand has 237 places, 597 transitions, 9447 flow. Second operand 10 states and 198 transitions. [2024-06-14 11:48:20,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 670 transitions, 11633 flow [2024-06-14 11:48:21,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 670 transitions, 11084 flow, removed 40 selfloop flow, removed 9 redundant places. [2024-06-14 11:48:21,224 INFO L231 Difference]: Finished difference. Result has 238 places, 627 transitions, 9728 flow [2024-06-14 11:48:21,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8898, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9728, PETRI_PLACES=238, PETRI_TRANSITIONS=627} [2024-06-14 11:48:21,225 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 193 predicate places. [2024-06-14 11:48:21,225 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 627 transitions, 9728 flow [2024-06-14 11:48:21,225 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-14 11:48:21,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:21,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:21,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 11:48:21,226 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:48:21,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1964579248, now seen corresponding path program 7 times [2024-06-14 11:48:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609385315] [2024-06-14 11:48:21,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:22,483 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-14 11:48:22,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:22,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609385315] [2024-06-14 11:48:22,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609385315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:22,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:48:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846964783] [2024-06-14 11:48:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:22,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:48:22,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:22,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:48:22,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:48:22,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:22,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 627 transitions, 9728 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-14 11:48:22,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:22,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:22,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:24,244 INFO L124 PetriNetUnfolderBase]: 4588/6994 cut-off events. [2024-06-14 11:48:24,244 INFO L125 PetriNetUnfolderBase]: For 506439/506536 co-relation queries the response was YES. [2024-06-14 11:48:24,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62510 conditions, 6994 events. 4588/6994 cut-off events. For 506439/506536 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 40059 event pairs, 1201 based on Foata normal form. 17/6957 useless extension candidates. Maximal degree in co-relation 62401. Up to 6268 conditions per place. [2024-06-14 11:48:24,326 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 497 selfloop transitions, 149 changer transitions 0/655 dead transitions. [2024-06-14 11:48:24,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 655 transitions, 11144 flow [2024-06-14 11:48:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:48:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:48:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-14 11:48:24,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 11:48:24,327 INFO L175 Difference]: Start difference. First operand has 238 places, 627 transitions, 9728 flow. Second operand 8 states and 160 transitions. [2024-06-14 11:48:24,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 655 transitions, 11144 flow [2024-06-14 11:48:25,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 655 transitions, 10641 flow, removed 144 selfloop flow, removed 7 redundant places. [2024-06-14 11:48:25,155 INFO L231 Difference]: Finished difference. Result has 239 places, 627 transitions, 9621 flow [2024-06-14 11:48:25,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=9225, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9621, PETRI_PLACES=239, PETRI_TRANSITIONS=627} [2024-06-14 11:48:25,156 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 194 predicate places. [2024-06-14 11:48:25,156 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 627 transitions, 9621 flow [2024-06-14 11:48:25,156 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-14 11:48:25,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:25,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:25,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 11:48:25,157 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:48:25,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1964579093, now seen corresponding path program 11 times [2024-06-14 11:48:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785233949] [2024-06-14 11:48:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:26,446 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-14 11:48:26,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:26,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785233949] [2024-06-14 11:48:26,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785233949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:26,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:26,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:48:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195266263] [2024-06-14 11:48:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:26,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:48:26,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:26,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:48:26,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:48:26,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:26,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 627 transitions, 9621 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-14 11:48:26,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:26,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:26,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:28,294 INFO L124 PetriNetUnfolderBase]: 4567/6980 cut-off events. [2024-06-14 11:48:28,295 INFO L125 PetriNetUnfolderBase]: For 520519/520605 co-relation queries the response was YES. [2024-06-14 11:48:28,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62218 conditions, 6980 events. 4567/6980 cut-off events. For 520519/520605 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 39984 event pairs, 1193 based on Foata normal form. 21/6962 useless extension candidates. Maximal degree in co-relation 62108. Up to 6288 conditions per place. [2024-06-14 11:48:28,386 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 563 selfloop transitions, 103 changer transitions 0/675 dead transitions. [2024-06-14 11:48:28,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 675 transitions, 11330 flow [2024-06-14 11:48:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:48:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:48:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-14 11:48:28,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 11:48:28,388 INFO L175 Difference]: Start difference. First operand has 239 places, 627 transitions, 9621 flow. Second operand 9 states and 176 transitions. [2024-06-14 11:48:28,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 675 transitions, 11330 flow [2024-06-14 11:48:29,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 675 transitions, 10949 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 11:48:29,206 INFO L231 Difference]: Finished difference. Result has 239 places, 638 transitions, 9700 flow [2024-06-14 11:48:29,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=9240, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9700, PETRI_PLACES=239, PETRI_TRANSITIONS=638} [2024-06-14 11:48:29,207 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 194 predicate places. [2024-06-14 11:48:29,207 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 638 transitions, 9700 flow [2024-06-14 11:48:29,208 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-14 11:48:29,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:29,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:29,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 11:48:29,209 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-14 11:48:29,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1312669414, now seen corresponding path program 8 times [2024-06-14 11:48:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697710444] [2024-06-14 11:48:29,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:29,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:30,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-14 11:48:30,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:30,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697710444] [2024-06-14 11:48:30,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697710444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:30,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:30,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:48:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898229652] [2024-06-14 11:48:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:30,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:48:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:30,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:48:30,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:48:30,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:30,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 638 transitions, 9700 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-14 11:48:30,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:30,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:30,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:32,581 INFO L124 PetriNetUnfolderBase]: 4547/6939 cut-off events. [2024-06-14 11:48:32,581 INFO L125 PetriNetUnfolderBase]: For 449896/449949 co-relation queries the response was YES. [2024-06-14 11:48:32,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60815 conditions, 6939 events. 4547/6939 cut-off events. For 449896/449949 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 39428 event pairs, 1068 based on Foata normal form. 16/6933 useless extension candidates. Maximal degree in co-relation 60706. Up to 5882 conditions per place. [2024-06-14 11:48:32,673 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 405 selfloop transitions, 255 changer transitions 0/669 dead transitions. [2024-06-14 11:48:32,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 669 transitions, 11258 flow [2024-06-14 11:48:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:48:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:48:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-14 11:48:32,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630681818181818 [2024-06-14 11:48:32,675 INFO L175 Difference]: Start difference. First operand has 239 places, 638 transitions, 9700 flow. Second operand 8 states and 163 transitions. [2024-06-14 11:48:32,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 669 transitions, 11258 flow [2024-06-14 11:48:33,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 669 transitions, 10940 flow, removed 76 selfloop flow, removed 7 redundant places. [2024-06-14 11:48:33,489 INFO L231 Difference]: Finished difference. Result has 240 places, 641 transitions, 10024 flow [2024-06-14 11:48:33,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=9382, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10024, PETRI_PLACES=240, PETRI_TRANSITIONS=641} [2024-06-14 11:48:33,490 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 195 predicate places. [2024-06-14 11:48:33,490 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 641 transitions, 10024 flow [2024-06-14 11:48:33,490 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-14 11:48:33,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:33,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:33,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 11:48:33,490 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-14 11:48:33,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:33,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1960860023, now seen corresponding path program 12 times [2024-06-14 11:48:33,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:33,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418830844] [2024-06-14 11:48:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:33,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:34,713 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-14 11:48:34,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:34,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418830844] [2024-06-14 11:48:34,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418830844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:34,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:34,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:48:34,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141357328] [2024-06-14 11:48:34,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:34,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:48:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:34,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:48:34,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:48:34,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:34,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 641 transitions, 10024 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-14 11:48:34,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:34,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:34,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:36,432 INFO L124 PetriNetUnfolderBase]: 4667/7120 cut-off events. [2024-06-14 11:48:36,432 INFO L125 PetriNetUnfolderBase]: For 504072/504139 co-relation queries the response was YES. [2024-06-14 11:48:36,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63920 conditions, 7120 events. 4667/7120 cut-off events. For 504072/504139 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 41031 event pairs, 1046 based on Foata normal form. 30/7106 useless extension candidates. Maximal degree in co-relation 63810. Up to 5183 conditions per place. [2024-06-14 11:48:36,526 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 373 selfloop transitions, 340 changer transitions 0/722 dead transitions. [2024-06-14 11:48:36,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 722 transitions, 12829 flow [2024-06-14 11:48:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:48:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:48:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-06-14 11:48:36,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823232323232323 [2024-06-14 11:48:36,527 INFO L175 Difference]: Start difference. First operand has 240 places, 641 transitions, 10024 flow. Second operand 9 states and 191 transitions. [2024-06-14 11:48:36,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 722 transitions, 12829 flow [2024-06-14 11:48:37,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 722 transitions, 12210 flow, removed 51 selfloop flow, removed 8 redundant places. [2024-06-14 11:48:37,639 INFO L231 Difference]: Finished difference. Result has 243 places, 672 transitions, 11066 flow [2024-06-14 11:48:37,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=9421, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=312, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11066, PETRI_PLACES=243, PETRI_TRANSITIONS=672} [2024-06-14 11:48:37,640 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 198 predicate places. [2024-06-14 11:48:37,640 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 672 transitions, 11066 flow [2024-06-14 11:48:37,640 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-14 11:48:37,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:37,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:37,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 11:48:37,640 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-14 11:48:37,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1960854443, now seen corresponding path program 13 times [2024-06-14 11:48:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:37,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764268993] [2024-06-14 11:48:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:37,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:38,743 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-14 11:48:38,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764268993] [2024-06-14 11:48:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764268993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:38,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:38,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:48:38,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473338613] [2024-06-14 11:48:38,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:38,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:48:38,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:48:38,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:48:38,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:38,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 672 transitions, 11066 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-14 11:48:38,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:38,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:38,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:40,723 INFO L124 PetriNetUnfolderBase]: 4742/7260 cut-off events. [2024-06-14 11:48:40,723 INFO L125 PetriNetUnfolderBase]: For 496462/496521 co-relation queries the response was YES. [2024-06-14 11:48:40,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66506 conditions, 7260 events. 4742/7260 cut-off events. For 496462/496521 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 42032 event pairs, 936 based on Foata normal form. 30/7260 useless extension candidates. Maximal degree in co-relation 66395. Up to 4351 conditions per place. [2024-06-14 11:48:40,804 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 226 selfloop transitions, 491 changer transitions 0/726 dead transitions. [2024-06-14 11:48:40,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 726 transitions, 13414 flow [2024-06-14 11:48:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:48:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:48:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2024-06-14 11:48:40,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48737373737373735 [2024-06-14 11:48:40,806 INFO L175 Difference]: Start difference. First operand has 243 places, 672 transitions, 11066 flow. Second operand 9 states and 193 transitions. [2024-06-14 11:48:40,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 726 transitions, 13414 flow [2024-06-14 11:48:41,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 726 transitions, 12858 flow, removed 185 selfloop flow, removed 5 redundant places. [2024-06-14 11:48:41,573 INFO L231 Difference]: Finished difference. Result has 247 places, 681 transitions, 11829 flow [2024-06-14 11:48:41,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=10518, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=485, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11829, PETRI_PLACES=247, PETRI_TRANSITIONS=681} [2024-06-14 11:48:41,574 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 202 predicate places. [2024-06-14 11:48:41,574 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 681 transitions, 11829 flow [2024-06-14 11:48:41,575 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-14 11:48:41,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:41,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:41,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 11:48:41,575 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-14 11:48:41,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:41,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1816969493, now seen corresponding path program 14 times [2024-06-14 11:48:41,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:41,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317493797] [2024-06-14 11:48:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:41,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:42,650 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-14 11:48:42,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:42,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317493797] [2024-06-14 11:48:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317493797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:42,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:42,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:48:42,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820422938] [2024-06-14 11:48:42,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:42,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:48:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:48:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:48:42,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:42,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 681 transitions, 11829 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-14 11:48:42,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:42,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:42,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:44,509 INFO L124 PetriNetUnfolderBase]: 4933/7527 cut-off events. [2024-06-14 11:48:44,509 INFO L125 PetriNetUnfolderBase]: For 535081/535143 co-relation queries the response was YES. [2024-06-14 11:48:44,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71381 conditions, 7527 events. 4933/7527 cut-off events. For 535081/535143 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 43754 event pairs, 1292 based on Foata normal form. 46/7532 useless extension candidates. Maximal degree in co-relation 71269. Up to 6242 conditions per place. [2024-06-14 11:48:44,610 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 545 selfloop transitions, 208 changer transitions 0/762 dead transitions. [2024-06-14 11:48:44,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 762 transitions, 14969 flow [2024-06-14 11:48:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:48:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:48:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-14 11:48:44,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671717171717172 [2024-06-14 11:48:44,612 INFO L175 Difference]: Start difference. First operand has 247 places, 681 transitions, 11829 flow. Second operand 9 states and 185 transitions. [2024-06-14 11:48:44,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 762 transitions, 14969 flow [2024-06-14 11:48:45,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 762 transitions, 14586 flow, removed 79 selfloop flow, removed 5 redundant places. [2024-06-14 11:48:45,380 INFO L231 Difference]: Finished difference. Result has 251 places, 709 transitions, 12968 flow [2024-06-14 11:48:45,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=11466, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12968, PETRI_PLACES=251, PETRI_TRANSITIONS=709} [2024-06-14 11:48:45,381 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 206 predicate places. [2024-06-14 11:48:45,381 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 709 transitions, 12968 flow [2024-06-14 11:48:45,381 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-14 11:48:45,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:45,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:45,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 11:48:45,381 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-14 11:48:45,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1168773149, now seen corresponding path program 15 times [2024-06-14 11:48:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:45,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873312028] [2024-06-14 11:48:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:46,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-14 11:48:46,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:46,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873312028] [2024-06-14 11:48:46,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873312028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:46,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:46,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:48:46,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052421791] [2024-06-14 11:48:46,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:46,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:48:46,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:46,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:48:46,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:48:46,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:46,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 709 transitions, 12968 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-14 11:48:46,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:46,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:46,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:48,524 INFO L124 PetriNetUnfolderBase]: 5086/7759 cut-off events. [2024-06-14 11:48:48,524 INFO L125 PetriNetUnfolderBase]: For 525708/525770 co-relation queries the response was YES. [2024-06-14 11:48:48,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73680 conditions, 7759 events. 5086/7759 cut-off events. For 525708/525770 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 45331 event pairs, 1235 based on Foata normal form. 46/7764 useless extension candidates. Maximal degree in co-relation 73567. Up to 6391 conditions per place. [2024-06-14 11:48:48,621 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 563 selfloop transitions, 211 changer transitions 0/783 dead transitions. [2024-06-14 11:48:48,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 783 transitions, 15740 flow [2024-06-14 11:48:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:48:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:48:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-14 11:48:48,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-14 11:48:48,622 INFO L175 Difference]: Start difference. First operand has 251 places, 709 transitions, 12968 flow. Second operand 9 states and 187 transitions. [2024-06-14 11:48:48,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 783 transitions, 15740 flow [2024-06-14 11:48:49,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 783 transitions, 14980 flow, removed 296 selfloop flow, removed 6 redundant places. [2024-06-14 11:48:49,344 INFO L231 Difference]: Finished difference. Result has 254 places, 723 transitions, 13210 flow [2024-06-14 11:48:49,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12344, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13210, PETRI_PLACES=254, PETRI_TRANSITIONS=723} [2024-06-14 11:48:49,345 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 209 predicate places. [2024-06-14 11:48:49,345 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 723 transitions, 13210 flow [2024-06-14 11:48:49,345 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-14 11:48:49,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:49,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:49,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 11:48:49,346 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-14 11:48:49,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1061758421, now seen corresponding path program 16 times [2024-06-14 11:48:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:49,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980640173] [2024-06-14 11:48:49,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:49,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:50,609 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-14 11:48:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980640173] [2024-06-14 11:48:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980640173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:48:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649436097] [2024-06-14 11:48:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:50,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:48:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:48:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:48:50,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:50,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 723 transitions, 13210 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-14 11:48:50,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:50,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:50,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:52,495 INFO L124 PetriNetUnfolderBase]: 4997/7626 cut-off events. [2024-06-14 11:48:52,496 INFO L125 PetriNetUnfolderBase]: For 491362/491424 co-relation queries the response was YES. [2024-06-14 11:48:52,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71084 conditions, 7626 events. 4997/7626 cut-off events. For 491362/491424 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 44508 event pairs, 1311 based on Foata normal form. 40/7625 useless extension candidates. Maximal degree in co-relation 70970. Up to 6852 conditions per place. [2024-06-14 11:48:52,593 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 637 selfloop transitions, 118 changer transitions 0/764 dead transitions. [2024-06-14 11:48:52,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 764 transitions, 15001 flow [2024-06-14 11:48:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:48:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:48:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-14 11:48:52,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2024-06-14 11:48:52,594 INFO L175 Difference]: Start difference. First operand has 254 places, 723 transitions, 13210 flow. Second operand 9 states and 177 transitions. [2024-06-14 11:48:52,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 764 transitions, 15001 flow [2024-06-14 11:48:53,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 764 transitions, 14498 flow, removed 90 selfloop flow, removed 7 redundant places. [2024-06-14 11:48:53,343 INFO L231 Difference]: Finished difference. Result has 256 places, 726 transitions, 13026 flow [2024-06-14 11:48:53,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12707, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13026, PETRI_PLACES=256, PETRI_TRANSITIONS=726} [2024-06-14 11:48:53,344 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 211 predicate places. [2024-06-14 11:48:53,344 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 726 transitions, 13026 flow [2024-06-14 11:48:53,345 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-14 11:48:53,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:53,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:53,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 11:48:53,345 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-14 11:48:53,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash 795656043, now seen corresponding path program 2 times [2024-06-14 11:48:53,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:53,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947903647] [2024-06-14 11:48:53,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:53,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:54,137 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-14 11:48:54,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:54,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947903647] [2024-06-14 11:48:54,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947903647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:54,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:54,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:48:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866601009] [2024-06-14 11:48:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:54,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:48:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:54,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:48:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:48:54,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:54,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 726 transitions, 13026 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-14 11:48:54,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:54,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:54,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:48:55,948 INFO L124 PetriNetUnfolderBase]: 5569/8398 cut-off events. [2024-06-14 11:48:55,948 INFO L125 PetriNetUnfolderBase]: For 529761/530237 co-relation queries the response was YES. [2024-06-14 11:48:56,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76910 conditions, 8398 events. 5569/8398 cut-off events. For 529761/530237 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 48517 event pairs, 1677 based on Foata normal form. 87/8345 useless extension candidates. Maximal degree in co-relation 76796. Up to 7691 conditions per place. [2024-06-14 11:48:56,063 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 567 selfloop transitions, 26 changer transitions 0/743 dead transitions. [2024-06-14 11:48:56,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 743 transitions, 14392 flow [2024-06-14 11:48:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:48:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:48:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-14 11:48:56,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-06-14 11:48:56,064 INFO L175 Difference]: Start difference. First operand has 256 places, 726 transitions, 13026 flow. Second operand 6 states and 117 transitions. [2024-06-14 11:48:56,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 743 transitions, 14392 flow [2024-06-14 11:48:56,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 743 transitions, 14004 flow, removed 89 selfloop flow, removed 7 redundant places. [2024-06-14 11:48:56,897 INFO L231 Difference]: Finished difference. Result has 255 places, 729 transitions, 12735 flow [2024-06-14 11:48:56,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12638, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12735, PETRI_PLACES=255, PETRI_TRANSITIONS=729} [2024-06-14 11:48:56,898 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 210 predicate places. [2024-06-14 11:48:56,898 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 729 transitions, 12735 flow [2024-06-14 11:48:56,898 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-14 11:48:56,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:48:56,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:48:56,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 11:48:56,899 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:48:56,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:48:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2038045087, now seen corresponding path program 2 times [2024-06-14 11:48:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:48:56,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452180298] [2024-06-14 11:48:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:48:56,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:48:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:48:58,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-14 11:48:58,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:48:58,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452180298] [2024-06-14 11:48:58,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452180298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:48:58,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:48:58,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:48:58,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718990271] [2024-06-14 11:48:58,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:48:58,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:48:58,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:48:58,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:48:58,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:48:58,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:48:58,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 729 transitions, 12735 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:48:58,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:48:58,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:48:58,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:00,462 INFO L124 PetriNetUnfolderBase]: 4990/7610 cut-off events. [2024-06-14 11:49:00,462 INFO L125 PetriNetUnfolderBase]: For 495371/495438 co-relation queries the response was YES. [2024-06-14 11:49:00,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70170 conditions, 7610 events. 4990/7610 cut-off events. For 495371/495438 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 44418 event pairs, 1049 based on Foata normal form. 28/7594 useless extension candidates. Maximal degree in co-relation 70055. Up to 5351 conditions per place. [2024-06-14 11:49:00,544 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 380 selfloop transitions, 397 changer transitions 0/787 dead transitions. [2024-06-14 11:49:00,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 787 transitions, 14836 flow [2024-06-14 11:49:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 11:49:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 11:49:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2024-06-14 11:49:00,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669421487603306 [2024-06-14 11:49:00,545 INFO L175 Difference]: Start difference. First operand has 255 places, 729 transitions, 12735 flow. Second operand 11 states and 226 transitions. [2024-06-14 11:49:00,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 787 transitions, 14836 flow [2024-06-14 11:49:01,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 787 transitions, 14771 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-14 11:49:01,311 INFO L231 Difference]: Finished difference. Result has 262 places, 729 transitions, 13490 flow [2024-06-14 11:49:01,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12672, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=397, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13490, PETRI_PLACES=262, PETRI_TRANSITIONS=729} [2024-06-14 11:49:01,312 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 217 predicate places. [2024-06-14 11:49:01,312 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 729 transitions, 13490 flow [2024-06-14 11:49:01,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:49:01,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:01,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:01,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 11:49:01,313 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:49:01,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash -309427465, now seen corresponding path program 17 times [2024-06-14 11:49:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:01,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270403684] [2024-06-14 11:49:01,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:02,486 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-14 11:49:02,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270403684] [2024-06-14 11:49:02,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270403684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:02,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:02,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:49:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283189393] [2024-06-14 11:49:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:02,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:49:02,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:49:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:49:02,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:49:02,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 729 transitions, 13490 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-14 11:49:02,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:02,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:49:02,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:04,676 INFO L124 PetriNetUnfolderBase]: 5087/7764 cut-off events. [2024-06-14 11:49:04,676 INFO L125 PetriNetUnfolderBase]: For 524836/524883 co-relation queries the response was YES. [2024-06-14 11:49:04,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73508 conditions, 7764 events. 5087/7764 cut-off events. For 524836/524883 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 45553 event pairs, 1573 based on Foata normal form. 20/7735 useless extension candidates. Maximal degree in co-relation 73393. Up to 7163 conditions per place. [2024-06-14 11:49:04,785 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 720 selfloop transitions, 51 changer transitions 0/781 dead transitions. [2024-06-14 11:49:04,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 781 transitions, 15852 flow [2024-06-14 11:49:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:49:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:49:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-14 11:49:04,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-06-14 11:49:04,786 INFO L175 Difference]: Start difference. First operand has 262 places, 729 transitions, 13490 flow. Second operand 9 states and 170 transitions. [2024-06-14 11:49:04,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 781 transitions, 15852 flow [2024-06-14 11:49:05,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 781 transitions, 15118 flow, removed 52 selfloop flow, removed 8 redundant places. [2024-06-14 11:49:05,599 INFO L231 Difference]: Finished difference. Result has 263 places, 743 transitions, 13456 flow [2024-06-14 11:49:05,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12767, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13456, PETRI_PLACES=263, PETRI_TRANSITIONS=743} [2024-06-14 11:49:05,599 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 218 predicate places. [2024-06-14 11:49:05,600 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 743 transitions, 13456 flow [2024-06-14 11:49:05,600 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-14 11:49:05,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:05,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:05,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 11:49:05,600 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-14 11:49:05,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1747919011, now seen corresponding path program 1 times [2024-06-14 11:49:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:05,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350313181] [2024-06-14 11:49:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:05,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:06,488 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-14 11:49:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:06,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350313181] [2024-06-14 11:49:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350313181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:06,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:06,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 11:49:06,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367440447] [2024-06-14 11:49:06,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:06,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 11:49:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:06,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 11:49:06,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 11:49:06,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:49:06,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 743 transitions, 13456 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-14 11:49:06,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:06,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:49:06,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:08,532 INFO L124 PetriNetUnfolderBase]: 5688/8582 cut-off events. [2024-06-14 11:49:08,533 INFO L125 PetriNetUnfolderBase]: For 578196/578666 co-relation queries the response was YES. [2024-06-14 11:49:08,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78557 conditions, 8582 events. 5688/8582 cut-off events. For 578196/578666 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 49747 event pairs, 1701 based on Foata normal form. 90/8533 useless extension candidates. Maximal degree in co-relation 78442. Up to 7856 conditions per place. [2024-06-14 11:49:08,636 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 588 selfloop transitions, 33 changer transitions 0/771 dead transitions. [2024-06-14 11:49:08,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 771 transitions, 14932 flow [2024-06-14 11:49:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 11:49:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 11:49:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 11:49:08,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2024-06-14 11:49:08,637 INFO L175 Difference]: Start difference. First operand has 263 places, 743 transitions, 13456 flow. Second operand 7 states and 137 transitions. [2024-06-14 11:49:08,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 771 transitions, 14932 flow [2024-06-14 11:49:09,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 771 transitions, 14525 flow, removed 168 selfloop flow, removed 6 redundant places. [2024-06-14 11:49:09,679 INFO L231 Difference]: Finished difference. Result has 265 places, 752 transitions, 13217 flow [2024-06-14 11:49:09,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13049, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13217, PETRI_PLACES=265, PETRI_TRANSITIONS=752} [2024-06-14 11:49:09,680 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 220 predicate places. [2024-06-14 11:49:09,680 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 752 transitions, 13217 flow [2024-06-14 11:49:09,680 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-14 11:49:09,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:09,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:09,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 11:49:09,681 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:49:09,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:09,681 INFO L85 PathProgramCache]: Analyzing trace with hash -108925499, now seen corresponding path program 1 times [2024-06-14 11:49:09,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:09,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385432856] [2024-06-14 11:49:09,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:09,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:10,701 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-14 11:49:10,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:10,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385432856] [2024-06-14 11:49:10,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385432856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:10,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:10,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:49:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273403015] [2024-06-14 11:49:10,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:10,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:49:10,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:10,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:49:10,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:49:10,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 11:49:10,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 752 transitions, 13217 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-14 11:49:10,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:10,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 11:49:10,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:13,022 INFO L124 PetriNetUnfolderBase]: 6160/9132 cut-off events. [2024-06-14 11:49:13,022 INFO L125 PetriNetUnfolderBase]: For 574777/574790 co-relation queries the response was YES. [2024-06-14 11:49:13,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83426 conditions, 9132 events. 6160/9132 cut-off events. For 574777/574790 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 51075 event pairs, 2072 based on Foata normal form. 2/9093 useless extension candidates. Maximal degree in co-relation 83309. Up to 8826 conditions per place. [2024-06-14 11:49:13,137 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 752 selfloop transitions, 30 changer transitions 0/790 dead transitions. [2024-06-14 11:49:13,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 790 transitions, 15219 flow [2024-06-14 11:49:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:49:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:49:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-14 11:49:13,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 11:49:13,139 INFO L175 Difference]: Start difference. First operand has 265 places, 752 transitions, 13217 flow. Second operand 8 states and 144 transitions. [2024-06-14 11:49:13,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 790 transitions, 15219 flow [2024-06-14 11:49:14,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 790 transitions, 15182 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-14 11:49:14,249 INFO L231 Difference]: Finished difference. Result has 271 places, 765 transitions, 13589 flow [2024-06-14 11:49:14,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13180, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13589, PETRI_PLACES=271, PETRI_TRANSITIONS=765} [2024-06-14 11:49:14,250 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 226 predicate places. [2024-06-14 11:49:14,250 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 765 transitions, 13589 flow [2024-06-14 11:49:14,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-14 11:49:14,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:14,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:14,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 11:49:14,251 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:49:14,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1557191401, now seen corresponding path program 18 times [2024-06-14 11:49:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:14,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451613002] [2024-06-14 11:49:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:15,287 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-14 11:49:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:15,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451613002] [2024-06-14 11:49:15,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451613002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:15,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:15,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:49:15,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177348816] [2024-06-14 11:49:15,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:15,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:49:15,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:15,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:49:15,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:49:15,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:49:15,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 765 transitions, 13589 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-14 11:49:15,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:15,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:49:15,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:17,484 INFO L124 PetriNetUnfolderBase]: 5369/8193 cut-off events. [2024-06-14 11:49:17,484 INFO L125 PetriNetUnfolderBase]: For 596499/596533 co-relation queries the response was YES. [2024-06-14 11:49:17,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78571 conditions, 8193 events. 5369/8193 cut-off events. For 596499/596533 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 48574 event pairs, 1483 based on Foata normal form. 20/8174 useless extension candidates. Maximal degree in co-relation 78451. Up to 6964 conditions per place. [2024-06-14 11:49:17,591 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 693 selfloop transitions, 150 changer transitions 0/853 dead transitions. [2024-06-14 11:49:17,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 853 transitions, 17316 flow [2024-06-14 11:49:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:49:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:49:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-14 11:49:17,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2024-06-14 11:49:17,592 INFO L175 Difference]: Start difference. First operand has 271 places, 765 transitions, 13589 flow. Second operand 9 states and 182 transitions. [2024-06-14 11:49:17,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 853 transitions, 17316 flow [2024-06-14 11:49:18,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 853 transitions, 17223 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-14 11:49:18,620 INFO L231 Difference]: Finished difference. Result has 274 places, 793 transitions, 14947 flow [2024-06-14 11:49:18,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13496, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14947, PETRI_PLACES=274, PETRI_TRANSITIONS=793} [2024-06-14 11:49:18,621 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 229 predicate places. [2024-06-14 11:49:18,621 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 793 transitions, 14947 flow [2024-06-14 11:49:18,621 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-14 11:49:18,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:18,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:18,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 11:49:18,621 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:49:18,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:18,622 INFO L85 PathProgramCache]: Analyzing trace with hash -445013885, now seen corresponding path program 19 times [2024-06-14 11:49:18,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:18,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723153178] [2024-06-14 11:49:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:19,719 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-14 11:49:19,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723153178] [2024-06-14 11:49:19,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723153178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:19,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:19,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:49:19,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185277731] [2024-06-14 11:49:19,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:19,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:49:19,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:19,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:49:19,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:49:19,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:49:19,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 793 transitions, 14947 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-14 11:49:19,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:19,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:49:19,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:21,983 INFO L124 PetriNetUnfolderBase]: 5331/8140 cut-off events. [2024-06-14 11:49:21,983 INFO L125 PetriNetUnfolderBase]: For 601878/601912 co-relation queries the response was YES. [2024-06-14 11:49:22,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78111 conditions, 8140 events. 5331/8140 cut-off events. For 601878/601912 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 48270 event pairs, 1476 based on Foata normal form. 20/8121 useless extension candidates. Maximal degree in co-relation 77990. Up to 6941 conditions per place. [2024-06-14 11:49:22,119 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 674 selfloop transitions, 160 changer transitions 0/844 dead transitions. [2024-06-14 11:49:22,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 844 transitions, 17241 flow [2024-06-14 11:49:22,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:49:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:49:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-14 11:49:22,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2024-06-14 11:49:22,120 INFO L175 Difference]: Start difference. First operand has 274 places, 793 transitions, 14947 flow. Second operand 9 states and 178 transitions. [2024-06-14 11:49:22,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 844 transitions, 17241 flow [2024-06-14 11:49:23,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 844 transitions, 15734 flow, removed 365 selfloop flow, removed 8 redundant places. [2024-06-14 11:49:23,285 INFO L231 Difference]: Finished difference. Result has 275 places, 793 transitions, 13783 flow [2024-06-14 11:49:23,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13440, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13783, PETRI_PLACES=275, PETRI_TRANSITIONS=793} [2024-06-14 11:49:23,285 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 230 predicate places. [2024-06-14 11:49:23,286 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 793 transitions, 13783 flow [2024-06-14 11:49:23,286 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-14 11:49:23,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:23,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:23,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 11:49:23,286 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:49:23,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash -444806495, now seen corresponding path program 20 times [2024-06-14 11:49:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361975900] [2024-06-14 11:49:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:24,535 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-14 11:49:24,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:24,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361975900] [2024-06-14 11:49:24,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361975900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:24,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:24,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:49:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023092690] [2024-06-14 11:49:24,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:24,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:49:24,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:49:24,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:49:24,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:49:24,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 793 transitions, 13783 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-14 11:49:24,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:24,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:49:24,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:26,801 INFO L124 PetriNetUnfolderBase]: 5309/8115 cut-off events. [2024-06-14 11:49:26,801 INFO L125 PetriNetUnfolderBase]: For 582601/582635 co-relation queries the response was YES. [2024-06-14 11:49:26,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75331 conditions, 8115 events. 5309/8115 cut-off events. For 582601/582635 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 48199 event pairs, 1507 based on Foata normal form. 14/8090 useless extension candidates. Maximal degree in co-relation 75211. Up to 7475 conditions per place. [2024-06-14 11:49:26,917 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 752 selfloop transitions, 73 changer transitions 0/835 dead transitions. [2024-06-14 11:49:26,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 835 transitions, 15745 flow [2024-06-14 11:49:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:49:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:49:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-14 11:49:26,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-14 11:49:26,919 INFO L175 Difference]: Start difference. First operand has 275 places, 793 transitions, 13783 flow. Second operand 9 states and 172 transitions. [2024-06-14 11:49:26,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 835 transitions, 15745 flow [2024-06-14 11:49:27,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 835 transitions, 15129 flow, removed 176 selfloop flow, removed 7 redundant places. [2024-06-14 11:49:27,999 INFO L231 Difference]: Finished difference. Result has 277 places, 796 transitions, 13395 flow [2024-06-14 11:49:27,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13179, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13395, PETRI_PLACES=277, PETRI_TRANSITIONS=796} [2024-06-14 11:49:28,000 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 232 predicate places. [2024-06-14 11:49:28,000 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 796 transitions, 13395 flow [2024-06-14 11:49:28,000 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-14 11:49:28,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:28,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:28,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 11:49:28,000 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-14 11:49:28,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash 808988523, now seen corresponding path program 3 times [2024-06-14 11:49:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:28,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581058559] [2024-06-14 11:49:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:28,754 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-14 11:49:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:28,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581058559] [2024-06-14 11:49:28,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581058559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:28,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:28,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:49:28,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263378902] [2024-06-14 11:49:28,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:28,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:49:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:49:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:49:28,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:49:28,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 796 transitions, 13395 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-14 11:49:28,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:28,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:49:28,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:31,005 INFO L124 PetriNetUnfolderBase]: 5939/8961 cut-off events. [2024-06-14 11:49:31,005 INFO L125 PetriNetUnfolderBase]: For 636915/637456 co-relation queries the response was YES. [2024-06-14 11:49:31,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80261 conditions, 8961 events. 5939/8961 cut-off events. For 636915/637456 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 52654 event pairs, 1937 based on Foata normal form. 122/8913 useless extension candidates. Maximal degree in co-relation 80140. Up to 8281 conditions per place. [2024-06-14 11:49:31,162 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 642 selfloop transitions, 12 changer transitions 0/804 dead transitions. [2024-06-14 11:49:31,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 804 transitions, 14733 flow [2024-06-14 11:49:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:49:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:49:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-14 11:49:31,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 11:49:31,163 INFO L175 Difference]: Start difference. First operand has 277 places, 796 transitions, 13395 flow. Second operand 6 states and 108 transitions. [2024-06-14 11:49:31,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 804 transitions, 14733 flow [2024-06-14 11:49:32,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 804 transitions, 14278 flow, removed 56 selfloop flow, removed 8 redundant places. [2024-06-14 11:49:32,541 INFO L231 Difference]: Finished difference. Result has 275 places, 796 transitions, 12970 flow [2024-06-14 11:49:32,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12940, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12970, PETRI_PLACES=275, PETRI_TRANSITIONS=796} [2024-06-14 11:49:32,542 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 230 predicate places. [2024-06-14 11:49:32,542 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 796 transitions, 12970 flow [2024-06-14 11:49:32,542 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-14 11:49:32,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:32,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:32,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 11:49:32,543 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-14 11:49:32,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:32,543 INFO L85 PathProgramCache]: Analyzing trace with hash -360252439, now seen corresponding path program 1 times [2024-06-14 11:49:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:32,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983458597] [2024-06-14 11:49:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:32,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:33,268 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-14 11:49:33,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983458597] [2024-06-14 11:49:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983458597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:33,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:33,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:49:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988095883] [2024-06-14 11:49:33,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:33,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:49:33,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:33,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:49:33,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:49:33,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2024-06-14 11:49:33,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 796 transitions, 12970 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 11:49:33,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:33,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2024-06-14 11:49:33,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:35,590 INFO L124 PetriNetUnfolderBase]: 6530/9627 cut-off events. [2024-06-14 11:49:35,590 INFO L125 PetriNetUnfolderBase]: For 607752/607752 co-relation queries the response was YES. [2024-06-14 11:49:35,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84323 conditions, 9627 events. 6530/9627 cut-off events. For 607752/607752 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 53351 event pairs, 2226 based on Foata normal form. 1/9627 useless extension candidates. Maximal degree in co-relation 84201. Up to 9467 conditions per place. [2024-06-14 11:49:35,727 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 794 selfloop transitions, 17 changer transitions 0/814 dead transitions. [2024-06-14 11:49:35,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 814 transitions, 14836 flow [2024-06-14 11:49:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:49:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:49:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-14 11:49:35,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 11:49:35,728 INFO L175 Difference]: Start difference. First operand has 275 places, 796 transitions, 12970 flow. Second operand 6 states and 104 transitions. [2024-06-14 11:49:35,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 814 transitions, 14836 flow [2024-06-14 11:49:36,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 814 transitions, 14793 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 11:49:36,720 INFO L231 Difference]: Finished difference. Result has 276 places, 802 transitions, 13061 flow [2024-06-14 11:49:36,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12927, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13061, PETRI_PLACES=276, PETRI_TRANSITIONS=802} [2024-06-14 11:49:36,721 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 231 predicate places. [2024-06-14 11:49:36,721 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 802 transitions, 13061 flow [2024-06-14 11:49:36,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 11:49:36,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:36,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:36,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 11:49:36,721 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:49:36,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2112308819, now seen corresponding path program 2 times [2024-06-14 11:49:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:36,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736556193] [2024-06-14 11:49:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:37,442 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-14 11:49:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:37,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736556193] [2024-06-14 11:49:37,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736556193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:37,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:37,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 11:49:37,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115122548] [2024-06-14 11:49:37,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:37,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 11:49:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 11:49:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 11:49:37,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2024-06-14 11:49:37,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 802 transitions, 13061 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 11:49:37,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:37,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2024-06-14 11:49:37,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:39,869 INFO L124 PetriNetUnfolderBase]: 6527/9624 cut-off events. [2024-06-14 11:49:39,869 INFO L125 PetriNetUnfolderBase]: For 625905/625907 co-relation queries the response was YES. [2024-06-14 11:49:39,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84968 conditions, 9624 events. 6527/9624 cut-off events. For 625905/625907 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 53362 event pairs, 2229 based on Foata normal form. 3/9626 useless extension candidates. Maximal degree in co-relation 84845. Up to 9464 conditions per place. [2024-06-14 11:49:40,013 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 790 selfloop transitions, 17 changer transitions 0/810 dead transitions. [2024-06-14 11:49:40,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 810 transitions, 14705 flow [2024-06-14 11:49:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 11:49:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 11:49:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-14 11:49:40,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-14 11:49:40,018 INFO L175 Difference]: Start difference. First operand has 276 places, 802 transitions, 13061 flow. Second operand 6 states and 100 transitions. [2024-06-14 11:49:40,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 810 transitions, 14705 flow [2024-06-14 11:49:41,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 810 transitions, 14630 flow, removed 33 selfloop flow, removed 2 redundant places. [2024-06-14 11:49:41,205 INFO L231 Difference]: Finished difference. Result has 280 places, 802 transitions, 13026 flow [2024-06-14 11:49:41,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12986, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13026, PETRI_PLACES=280, PETRI_TRANSITIONS=802} [2024-06-14 11:49:41,206 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 235 predicate places. [2024-06-14 11:49:41,206 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 802 transitions, 13026 flow [2024-06-14 11:49:41,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 11:49:41,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:41,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:41,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 11:49:41,206 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-14 11:49:41,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1960489543, now seen corresponding path program 1 times [2024-06-14 11:49:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125117876] [2024-06-14 11:49:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:41,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:42,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-14 11:49:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125117876] [2024-06-14 11:49:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125117876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:42,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:42,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:49:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037698768] [2024-06-14 11:49:42,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:42,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:49:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:49:42,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:49:42,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:49:42,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 802 transitions, 13026 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:49:42,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:42,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:49:42,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:44,569 INFO L124 PetriNetUnfolderBase]: 5440/8281 cut-off events. [2024-06-14 11:49:44,569 INFO L125 PetriNetUnfolderBase]: For 669341/669396 co-relation queries the response was YES. [2024-06-14 11:49:44,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78097 conditions, 8281 events. 5440/8281 cut-off events. For 669341/669396 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 49074 event pairs, 1022 based on Foata normal form. 18/8246 useless extension candidates. Maximal degree in co-relation 77972. Up to 7287 conditions per place. [2024-06-14 11:49:44,697 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 685 selfloop transitions, 160 changer transitions 0/857 dead transitions. [2024-06-14 11:49:44,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 857 transitions, 15480 flow [2024-06-14 11:49:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 11:49:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 11:49:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-14 11:49:44,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44834710743801653 [2024-06-14 11:49:44,699 INFO L175 Difference]: Start difference. First operand has 280 places, 802 transitions, 13026 flow. Second operand 11 states and 217 transitions. [2024-06-14 11:49:44,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 857 transitions, 15480 flow [2024-06-14 11:49:45,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 857 transitions, 15432 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 11:49:45,892 INFO L231 Difference]: Finished difference. Result has 288 places, 811 transitions, 13611 flow [2024-06-14 11:49:45,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12978, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13611, PETRI_PLACES=288, PETRI_TRANSITIONS=811} [2024-06-14 11:49:45,893 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 243 predicate places. [2024-06-14 11:49:45,893 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 811 transitions, 13611 flow [2024-06-14 11:49:45,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:49:45,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:45,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-14 11:49:45,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 11:49:45,894 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-14 11:49:45,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1678300415, now seen corresponding path program 2 times [2024-06-14 11:49:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:45,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898941612] [2024-06-14 11:49:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:46,971 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-14 11:49:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:46,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898941612] [2024-06-14 11:49:46,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898941612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:46,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:46,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:49:46,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325678614] [2024-06-14 11:49:46,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:46,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:49:46,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:46,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:49:46,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:49:47,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:49:47,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 811 transitions, 13611 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:49:47,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:47,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:49:47,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:49,369 INFO L124 PetriNetUnfolderBase]: 5507/8410 cut-off events. [2024-06-14 11:49:49,369 INFO L125 PetriNetUnfolderBase]: For 695244/695295 co-relation queries the response was YES. [2024-06-14 11:49:49,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80489 conditions, 8410 events. 5507/8410 cut-off events. For 695244/695295 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 50207 event pairs, 1195 based on Foata normal form. 20/8387 useless extension candidates. Maximal degree in co-relation 80361. Up to 7462 conditions per place. [2024-06-14 11:49:49,505 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 693 selfloop transitions, 170 changer transitions 0/875 dead transitions. [2024-06-14 11:49:49,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 875 transitions, 16246 flow [2024-06-14 11:49:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 11:49:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 11:49:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2024-06-14 11:49:49,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44507575757575757 [2024-06-14 11:49:49,506 INFO L175 Difference]: Start difference. First operand has 288 places, 811 transitions, 13611 flow. Second operand 12 states and 235 transitions. [2024-06-14 11:49:49,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 875 transitions, 16246 flow [2024-06-14 11:49:50,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 875 transitions, 15672 flow, removed 197 selfloop flow, removed 7 redundant places. [2024-06-14 11:49:50,962 INFO L231 Difference]: Finished difference. Result has 294 places, 825 transitions, 13910 flow [2024-06-14 11:49:50,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13269, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13910, PETRI_PLACES=294, PETRI_TRANSITIONS=825} [2024-06-14 11:49:50,962 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 249 predicate places. [2024-06-14 11:49:50,962 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 825 transitions, 13910 flow [2024-06-14 11:49:50,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:49:50,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:50,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:50,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 11:49:50,963 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:49:50,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1689085625, now seen corresponding path program 3 times [2024-06-14 11:49:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718756251] [2024-06-14 11:49:50,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:52,070 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-14 11:49:52,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:52,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718756251] [2024-06-14 11:49:52,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718756251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:52,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:52,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:49:52,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084310453] [2024-06-14 11:49:52,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:52,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:49:52,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:52,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:49:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:49:52,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:49:52,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 825 transitions, 13910 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:49:52,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:52,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:49:52,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:49:54,603 INFO L124 PetriNetUnfolderBase]: 5510/8419 cut-off events. [2024-06-14 11:49:54,603 INFO L125 PetriNetUnfolderBase]: For 700897/700948 co-relation queries the response was YES. [2024-06-14 11:49:54,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80208 conditions, 8419 events. 5510/8419 cut-off events. For 700897/700948 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 50368 event pairs, 1217 based on Foata normal form. 20/8396 useless extension candidates. Maximal degree in co-relation 80078. Up to 7572 conditions per place. [2024-06-14 11:49:54,728 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 700 selfloop transitions, 160 changer transitions 0/872 dead transitions. [2024-06-14 11:49:54,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 872 transitions, 15902 flow [2024-06-14 11:49:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 11:49:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 11:49:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2024-06-14 11:49:54,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2024-06-14 11:49:54,729 INFO L175 Difference]: Start difference. First operand has 294 places, 825 transitions, 13910 flow. Second operand 12 states and 230 transitions. [2024-06-14 11:49:54,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 872 transitions, 15902 flow [2024-06-14 11:49:56,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 872 transitions, 15634 flow, removed 50 selfloop flow, removed 7 redundant places. [2024-06-14 11:49:56,413 INFO L231 Difference]: Finished difference. Result has 299 places, 827 transitions, 14048 flow [2024-06-14 11:49:56,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13652, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14048, PETRI_PLACES=299, PETRI_TRANSITIONS=827} [2024-06-14 11:49:56,414 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 254 predicate places. [2024-06-14 11:49:56,414 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 827 transitions, 14048 flow [2024-06-14 11:49:56,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:49:56,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:49:56,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:49:56,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 11:49:56,414 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-14 11:49:56,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:49:56,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2115839557, now seen corresponding path program 4 times [2024-06-14 11:49:56,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:49:56,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238709127] [2024-06-14 11:49:56,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:49:56,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:49:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:49:57,900 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-14 11:49:57,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:49:57,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238709127] [2024-06-14 11:49:57,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238709127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:49:57,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:49:57,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:49:57,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399830959] [2024-06-14 11:49:57,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:49:57,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:49:57,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:49:57,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:49:57,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:49:58,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:49:58,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 827 transitions, 14048 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:49:58,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:49:58,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:49:58,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:50:00,763 INFO L124 PetriNetUnfolderBase]: 5671/8674 cut-off events. [2024-06-14 11:50:00,764 INFO L125 PetriNetUnfolderBase]: For 729304/729353 co-relation queries the response was YES. [2024-06-14 11:50:00,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82278 conditions, 8674 events. 5671/8674 cut-off events. For 729304/729353 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 52166 event pairs, 1280 based on Foata normal form. 22/8661 useless extension candidates. Maximal degree in co-relation 82146. Up to 7843 conditions per place. [2024-06-14 11:50:00,864 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 776 selfloop transitions, 112 changer transitions 0/900 dead transitions. [2024-06-14 11:50:00,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 900 transitions, 16700 flow [2024-06-14 11:50:00,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 11:50:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 11:50:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-06-14 11:50:00,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4412878787878788 [2024-06-14 11:50:00,865 INFO L175 Difference]: Start difference. First operand has 299 places, 827 transitions, 14048 flow. Second operand 12 states and 233 transitions. [2024-06-14 11:50:00,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 900 transitions, 16700 flow [2024-06-14 11:50:02,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 900 transitions, 16256 flow, removed 63 selfloop flow, removed 10 redundant places. [2024-06-14 11:50:02,095 INFO L231 Difference]: Finished difference. Result has 303 places, 851 transitions, 14387 flow [2024-06-14 11:50:02,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13654, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14387, PETRI_PLACES=303, PETRI_TRANSITIONS=851} [2024-06-14 11:50:02,096 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 258 predicate places. [2024-06-14 11:50:02,096 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 851 transitions, 14387 flow [2024-06-14 11:50:02,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:50:02,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:50:02,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:50:02,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 11:50:02,096 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:50:02,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:50:02,097 INFO L85 PathProgramCache]: Analyzing trace with hash -652793495, now seen corresponding path program 5 times [2024-06-14 11:50:02,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:50:02,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152083496] [2024-06-14 11:50:02,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:50:02,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:50:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:50:03,338 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-14 11:50:03,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:50:03,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152083496] [2024-06-14 11:50:03,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152083496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:50:03,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:50:03,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:50:03,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78405620] [2024-06-14 11:50:03,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:50:03,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:50:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:50:03,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:50:03,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:50:03,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:50:03,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 851 transitions, 14387 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:50:03,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:50:03,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:50:03,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:50:05,999 INFO L124 PetriNetUnfolderBase]: 5680/8685 cut-off events. [2024-06-14 11:50:05,999 INFO L125 PetriNetUnfolderBase]: For 755989/756042 co-relation queries the response was YES. [2024-06-14 11:50:06,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82460 conditions, 8685 events. 5680/8685 cut-off events. For 755989/756042 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 52357 event pairs, 1287 based on Foata normal form. 22/8668 useless extension candidates. Maximal degree in co-relation 82325. Up to 7922 conditions per place. [2024-06-14 11:50:06,116 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 763 selfloop transitions, 111 changer transitions 0/886 dead transitions. [2024-06-14 11:50:06,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 886 transitions, 16271 flow [2024-06-14 11:50:06,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:50:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:50:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-14 11:50:06,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44772727272727275 [2024-06-14 11:50:06,118 INFO L175 Difference]: Start difference. First operand has 303 places, 851 transitions, 14387 flow. Second operand 10 states and 197 transitions. [2024-06-14 11:50:06,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 886 transitions, 16271 flow [2024-06-14 11:50:07,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 886 transitions, 16038 flow, removed 102 selfloop flow, removed 4 redundant places. [2024-06-14 11:50:07,751 INFO L231 Difference]: Finished difference. Result has 309 places, 851 transitions, 14396 flow [2024-06-14 11:50:07,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14154, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14396, PETRI_PLACES=309, PETRI_TRANSITIONS=851} [2024-06-14 11:50:07,752 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 264 predicate places. [2024-06-14 11:50:07,753 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 851 transitions, 14396 flow [2024-06-14 11:50:07,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:50:07,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:50:07,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:50:07,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 11:50:07,753 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:50:07,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:50:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1539345953, now seen corresponding path program 6 times [2024-06-14 11:50:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:50:07,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68845843] [2024-06-14 11:50:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:50:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:50:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:50:09,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-14 11:50:09,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:50:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68845843] [2024-06-14 11:50:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68845843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:50:09,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:50:09,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:50:09,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797278897] [2024-06-14 11:50:09,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:50:09,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:50:09,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:50:09,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:50:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:50:09,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:50:09,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 851 transitions, 14396 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:50:09,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:50:09,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:50:09,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:50:12,235 INFO L124 PetriNetUnfolderBase]: 5670/8659 cut-off events. [2024-06-14 11:50:12,235 INFO L125 PetriNetUnfolderBase]: For 754190/754239 co-relation queries the response was YES. [2024-06-14 11:50:12,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82418 conditions, 8659 events. 5670/8659 cut-off events. For 754190/754239 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 51846 event pairs, 1140 based on Foata normal form. 22/8654 useless extension candidates. Maximal degree in co-relation 82281. Up to 7769 conditions per place. [2024-06-14 11:50:12,361 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 718 selfloop transitions, 164 changer transitions 0/894 dead transitions. [2024-06-14 11:50:12,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 894 transitions, 16433 flow [2024-06-14 11:50:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 11:50:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 11:50:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 214 transitions. [2024-06-14 11:50:12,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44214876033057854 [2024-06-14 11:50:12,362 INFO L175 Difference]: Start difference. First operand has 309 places, 851 transitions, 14396 flow. Second operand 11 states and 214 transitions. [2024-06-14 11:50:12,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 894 transitions, 16433 flow [2024-06-14 11:50:13,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 894 transitions, 16246 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 11:50:13,802 INFO L231 Difference]: Finished difference. Result has 313 places, 853 transitions, 14633 flow [2024-06-14 11:50:13,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14209, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14633, PETRI_PLACES=313, PETRI_TRANSITIONS=853} [2024-06-14 11:50:13,803 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 268 predicate places. [2024-06-14 11:50:13,803 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 853 transitions, 14633 flow [2024-06-14 11:50:13,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:50:13,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:50:13,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:50:13,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 11:50:13,804 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-14 11:50:13,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:50:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1066227485, now seen corresponding path program 1 times [2024-06-14 11:50:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:50:13,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415028088] [2024-06-14 11:50:13,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:50:13,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:50:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:50:14,795 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-14 11:50:14,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:50:14,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415028088] [2024-06-14 11:50:14,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415028088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:50:14,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:50:14,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:50:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086749185] [2024-06-14 11:50:14,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:50:14,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:50:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:50:14,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:50:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:50:14,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:50:14,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 853 transitions, 14633 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-14 11:50:14,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:50:14,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:50:14,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:50:17,163 INFO L124 PetriNetUnfolderBase]: 6220/9458 cut-off events. [2024-06-14 11:50:17,163 INFO L125 PetriNetUnfolderBase]: For 825843/826221 co-relation queries the response was YES. [2024-06-14 11:50:17,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86943 conditions, 9458 events. 6220/9458 cut-off events. For 825843/826221 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 56538 event pairs, 1747 based on Foata normal form. 168/9496 useless extension candidates. Maximal degree in co-relation 86805. Up to 8432 conditions per place. [2024-06-14 11:50:17,313 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 640 selfloop transitions, 75 changer transitions 0/885 dead transitions. [2024-06-14 11:50:17,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 885 transitions, 16399 flow [2024-06-14 11:50:17,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:50:17,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:50:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-14 11:50:17,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45170454545454547 [2024-06-14 11:50:17,314 INFO L175 Difference]: Start difference. First operand has 313 places, 853 transitions, 14633 flow. Second operand 8 states and 159 transitions. [2024-06-14 11:50:17,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 885 transitions, 16399 flow [2024-06-14 11:50:18,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 885 transitions, 15995 flow, removed 40 selfloop flow, removed 9 redundant places. [2024-06-14 11:50:18,931 INFO L231 Difference]: Finished difference. Result has 312 places, 859 transitions, 14495 flow [2024-06-14 11:50:18,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14229, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=781, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14495, PETRI_PLACES=312, PETRI_TRANSITIONS=859} [2024-06-14 11:50:18,932 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 267 predicate places. [2024-06-14 11:50:18,932 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 859 transitions, 14495 flow [2024-06-14 11:50:18,932 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-14 11:50:18,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:50:18,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:50:18,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 11:50:18,932 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:50:18,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:50:18,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1018799585, now seen corresponding path program 7 times [2024-06-14 11:50:18,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:50:18,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462582593] [2024-06-14 11:50:18,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:50:18,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:50:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:50:20,574 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-14 11:50:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:50:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462582593] [2024-06-14 11:50:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462582593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:50:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:50:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:50:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695755713] [2024-06-14 11:50:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:50:20,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:50:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:50:20,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:50:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:50:20,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:50:20,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 859 transitions, 14495 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:50:20,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:50:20,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:50:20,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:50:23,470 INFO L124 PetriNetUnfolderBase]: 5896/9029 cut-off events. [2024-06-14 11:50:23,470 INFO L125 PetriNetUnfolderBase]: For 824828/824891 co-relation queries the response was YES. [2024-06-14 11:50:23,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86349 conditions, 9029 events. 5896/9029 cut-off events. For 824828/824891 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 54879 event pairs, 1383 based on Foata normal form. 18/9008 useless extension candidates. Maximal degree in co-relation 86210. Up to 8208 conditions per place. [2024-06-14 11:50:23,589 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 824 selfloop transitions, 101 changer transitions 0/939 dead transitions. [2024-06-14 11:50:23,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 939 transitions, 17401 flow [2024-06-14 11:50:23,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 11:50:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 11:50:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-14 11:50:23,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2024-06-14 11:50:23,590 INFO L175 Difference]: Start difference. First operand has 312 places, 859 transitions, 14495 flow. Second operand 11 states and 212 transitions. [2024-06-14 11:50:23,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 939 transitions, 17401 flow [2024-06-14 11:50:24,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 939 transitions, 17288 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-14 11:50:24,930 INFO L231 Difference]: Finished difference. Result has 320 places, 887 transitions, 15186 flow [2024-06-14 11:50:24,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14385, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15186, PETRI_PLACES=320, PETRI_TRANSITIONS=887} [2024-06-14 11:50:24,931 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 275 predicate places. [2024-06-14 11:50:24,931 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 887 transitions, 15186 flow [2024-06-14 11:50:24,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:50:24,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:50:24,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:50:24,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 11:50:24,932 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:50:24,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:50:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1018860035, now seen corresponding path program 8 times [2024-06-14 11:50:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:50:24,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480976914] [2024-06-14 11:50:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:50:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:50:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:50:26,471 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-14 11:50:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:50:26,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480976914] [2024-06-14 11:50:26,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480976914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:50:26,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:50:26,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:50:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730046568] [2024-06-14 11:50:26,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:50:26,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:50:26,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:50:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:50:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:50:26,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:50:26,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 887 transitions, 15186 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:50:26,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:50:26,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:50:26,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:50:29,339 INFO L124 PetriNetUnfolderBase]: 5956/9132 cut-off events. [2024-06-14 11:50:29,339 INFO L125 PetriNetUnfolderBase]: For 857549/857612 co-relation queries the response was YES. [2024-06-14 11:50:29,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88244 conditions, 9132 events. 5956/9132 cut-off events. For 857549/857612 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 55733 event pairs, 1430 based on Foata normal form. 20/9114 useless extension candidates. Maximal degree in co-relation 88102. Up to 8446 conditions per place. [2024-06-14 11:50:29,468 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 848 selfloop transitions, 90 changer transitions 0/952 dead transitions. [2024-06-14 11:50:29,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 952 transitions, 17657 flow [2024-06-14 11:50:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 11:50:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 11:50:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 241 transitions. [2024-06-14 11:50:29,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42132867132867136 [2024-06-14 11:50:29,469 INFO L175 Difference]: Start difference. First operand has 320 places, 887 transitions, 15186 flow. Second operand 13 states and 241 transitions. [2024-06-14 11:50:29,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 952 transitions, 17657 flow [2024-06-14 11:50:31,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 952 transitions, 17502 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-14 11:50:31,084 INFO L231 Difference]: Finished difference. Result has 330 places, 904 transitions, 15659 flow [2024-06-14 11:50:31,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15031, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15659, PETRI_PLACES=330, PETRI_TRANSITIONS=904} [2024-06-14 11:50:31,085 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 285 predicate places. [2024-06-14 11:50:31,085 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 904 transitions, 15659 flow [2024-06-14 11:50:31,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:50:31,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:50:31,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:50:31,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 11:50:31,085 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-14 11:50:31,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:50:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash 217397577, now seen corresponding path program 9 times [2024-06-14 11:50:31,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:50:31,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630234139] [2024-06-14 11:50:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:50:31,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:50:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:50:32,464 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-14 11:50:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:50:32,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630234139] [2024-06-14 11:50:32,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630234139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:50:32,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:50:32,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:50:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051904284] [2024-06-14 11:50:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:50:32,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:50:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:50:32,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:50:32,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:50:32,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:50:32,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 904 transitions, 15659 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:50:32,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:50:32,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:50:32,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:50:35,055 INFO L124 PetriNetUnfolderBase]: 5938/9100 cut-off events. [2024-06-14 11:50:35,055 INFO L125 PetriNetUnfolderBase]: For 865196/865259 co-relation queries the response was YES. [2024-06-14 11:50:35,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88104 conditions, 9100 events. 5938/9100 cut-off events. For 865196/865259 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 55401 event pairs, 1420 based on Foata normal form. 20/9082 useless extension candidates. Maximal degree in co-relation 87958. Up to 8365 conditions per place. [2024-06-14 11:50:35,210 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 834 selfloop transitions, 93 changer transitions 0/941 dead transitions. [2024-06-14 11:50:35,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 941 transitions, 17701 flow [2024-06-14 11:50:35,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:50:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:50:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-14 11:50:35,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340909090909091 [2024-06-14 11:50:35,211 INFO L175 Difference]: Start difference. First operand has 330 places, 904 transitions, 15659 flow. Second operand 10 states and 191 transitions. [2024-06-14 11:50:35,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 941 transitions, 17701 flow [2024-06-14 11:50:37,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 941 transitions, 17267 flow, removed 123 selfloop flow, removed 11 redundant places. [2024-06-14 11:50:37,296 INFO L231 Difference]: Finished difference. Result has 329 places, 904 transitions, 15443 flow [2024-06-14 11:50:37,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15225, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15443, PETRI_PLACES=329, PETRI_TRANSITIONS=904} [2024-06-14 11:50:37,297 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 284 predicate places. [2024-06-14 11:50:37,297 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 904 transitions, 15443 flow [2024-06-14 11:50:37,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:50:37,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:50:37,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:50:37,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 11:50:37,298 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-14 11:50:37,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:50:37,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1136947715, now seen corresponding path program 10 times [2024-06-14 11:50:37,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:50:37,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163846586] [2024-06-14 11:50:37,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:50:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:50:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:50:38,596 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-14 11:50:38,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:50:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163846586] [2024-06-14 11:50:38,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163846586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:50:38,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:50:38,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 11:50:38,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203113695] [2024-06-14 11:50:38,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:50:38,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:50:38,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:50:38,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:50:38,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:50:38,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:50:38,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 904 transitions, 15443 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:50:38,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:50:38,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:50:38,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:50:41,148 INFO L124 PetriNetUnfolderBase]: 5965/9162 cut-off events. [2024-06-14 11:50:41,148 INFO L125 PetriNetUnfolderBase]: For 879844/879911 co-relation queries the response was YES. [2024-06-14 11:50:41,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88451 conditions, 9162 events. 5965/9162 cut-off events. For 879844/879911 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 56216 event pairs, 1355 based on Foata normal form. 18/9137 useless extension candidates. Maximal degree in co-relation 88304. Up to 8311 conditions per place. [2024-06-14 11:50:41,295 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 799 selfloop transitions, 142 changer transitions 0/955 dead transitions. [2024-06-14 11:50:41,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 955 transitions, 17756 flow [2024-06-14 11:50:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:50:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:50:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-14 11:50:41,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44772727272727275 [2024-06-14 11:50:41,296 INFO L175 Difference]: Start difference. First operand has 329 places, 904 transitions, 15443 flow. Second operand 10 states and 197 transitions. [2024-06-14 11:50:41,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 955 transitions, 17756 flow [2024-06-14 11:50:43,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 955 transitions, 17588 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 11:50:43,359 INFO L231 Difference]: Finished difference. Result has 331 places, 908 transitions, 15673 flow [2024-06-14 11:50:43,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15275, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15673, PETRI_PLACES=331, PETRI_TRANSITIONS=908} [2024-06-14 11:50:43,360 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 286 predicate places. [2024-06-14 11:50:43,360 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 908 transitions, 15673 flow [2024-06-14 11:50:43,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:50:43,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:50:43,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:50:43,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 11:50:43,361 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-14 11:50:43,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:50:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1263479235, now seen corresponding path program 1 times [2024-06-14 11:50:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:50:43,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109837828] [2024-06-14 11:50:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:50:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:50:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:50:44,565 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-14 11:50:44,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:50:44,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109837828] [2024-06-14 11:50:44,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109837828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:50:44,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:50:44,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:50:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794971013] [2024-06-14 11:50:44,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:50:44,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:50:44,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:50:44,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:50:44,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:50:44,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 11:50:44,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 908 transitions, 15673 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-14 11:50:44,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:50:44,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 11:50:44,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:50:48,000 INFO L124 PetriNetUnfolderBase]: 7061/10539 cut-off events. [2024-06-14 11:50:48,000 INFO L125 PetriNetUnfolderBase]: For 932881/932918 co-relation queries the response was YES. [2024-06-14 11:50:48,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99253 conditions, 10539 events. 7061/10539 cut-off events. For 932881/932918 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 61488 event pairs, 1730 based on Foata normal form. 6/10501 useless extension candidates. Maximal degree in co-relation 99105. Up to 9947 conditions per place. [2024-06-14 11:50:48,152 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 845 selfloop transitions, 107 changer transitions 0/964 dead transitions. [2024-06-14 11:50:48,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 964 transitions, 18114 flow [2024-06-14 11:50:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 11:50:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 11:50:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-14 11:50:48,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-14 11:50:48,153 INFO L175 Difference]: Start difference. First operand has 331 places, 908 transitions, 15673 flow. Second operand 10 states and 190 transitions. [2024-06-14 11:50:48,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 964 transitions, 18114 flow [2024-06-14 11:50:50,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 964 transitions, 17824 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-14 11:50:50,239 INFO L231 Difference]: Finished difference. Result has 337 places, 928 transitions, 16031 flow [2024-06-14 11:50:50,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15383, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16031, PETRI_PLACES=337, PETRI_TRANSITIONS=928} [2024-06-14 11:50:50,240 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 292 predicate places. [2024-06-14 11:50:50,240 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 928 transitions, 16031 flow [2024-06-14 11:50:50,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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-14 11:50:50,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:50:50,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:50:50,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 11:50:50,241 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-14 11:50:50,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:50:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1302586849, now seen corresponding path program 11 times [2024-06-14 11:50:50,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:50:50,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510725726] [2024-06-14 11:50:50,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:50:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:50:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:50:51,798 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-14 11:50:51,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:50:51,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510725726] [2024-06-14 11:50:51,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510725726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:50:51,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:50:51,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:50:51,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570606220] [2024-06-14 11:50:51,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:50:51,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:50:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:50:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:50:51,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:50:51,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:50:51,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 928 transitions, 16031 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:50:51,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:50:51,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:50:51,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:50:54,908 INFO L124 PetriNetUnfolderBase]: 6033/9255 cut-off events. [2024-06-14 11:50:54,909 INFO L125 PetriNetUnfolderBase]: For 909798/909875 co-relation queries the response was YES. [2024-06-14 11:50:55,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90641 conditions, 9255 events. 6033/9255 cut-off events. For 909798/909875 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 56640 event pairs, 1432 based on Foata normal form. 23/9235 useless extension candidates. Maximal degree in co-relation 90490. Up to 8639 conditions per place. [2024-06-14 11:50:55,076 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 899 selfloop transitions, 55 changer transitions 0/969 dead transitions. [2024-06-14 11:50:55,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 969 transitions, 18242 flow [2024-06-14 11:50:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 11:50:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 11:50:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-14 11:50:55,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42768595041322316 [2024-06-14 11:50:55,080 INFO L175 Difference]: Start difference. First operand has 337 places, 928 transitions, 16031 flow. Second operand 11 states and 207 transitions. [2024-06-14 11:50:55,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 969 transitions, 18242 flow [2024-06-14 11:50:57,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 969 transitions, 18013 flow, removed 52 selfloop flow, removed 5 redundant places. [2024-06-14 11:50:57,436 INFO L231 Difference]: Finished difference. Result has 344 places, 932 transitions, 16057 flow [2024-06-14 11:50:57,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15802, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=873, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16057, PETRI_PLACES=344, PETRI_TRANSITIONS=932} [2024-06-14 11:50:57,437 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 299 predicate places. [2024-06-14 11:50:57,437 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 932 transitions, 16057 flow [2024-06-14 11:50:57,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:50:57,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:50:57,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:50:57,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 11:50:57,438 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:50:57,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:50:57,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1039245777, now seen corresponding path program 1 times [2024-06-14 11:50:57,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:50:57,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838771462] [2024-06-14 11:50:57,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:50:57,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:50:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:50:58,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-14 11:50:58,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:50:58,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838771462] [2024-06-14 11:50:58,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838771462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:50:58,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:50:58,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 11:50:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664624386] [2024-06-14 11:50:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:50:58,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 11:50:58,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:50:58,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 11:50:58,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 11:50:58,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:50:58,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 932 transitions, 16057 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 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-14 11:50:58,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:50:58,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:50:58,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:51:02,276 INFO L124 PetriNetUnfolderBase]: 6563/10022 cut-off events. [2024-06-14 11:51:02,276 INFO L125 PetriNetUnfolderBase]: For 1000235/1000578 co-relation queries the response was YES. [2024-06-14 11:51:02,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95223 conditions, 10022 events. 6563/10022 cut-off events. For 1000235/1000578 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 61263 event pairs, 1834 based on Foata normal form. 117/10016 useless extension candidates. Maximal degree in co-relation 95070. Up to 8984 conditions per place. [2024-06-14 11:51:02,424 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 736 selfloop transitions, 60 changer transitions 0/984 dead transitions. [2024-06-14 11:51:02,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 984 transitions, 18409 flow [2024-06-14 11:51:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 11:51:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 11:51:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-14 11:51:02,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45202020202020204 [2024-06-14 11:51:02,425 INFO L175 Difference]: Start difference. First operand has 344 places, 932 transitions, 16057 flow. Second operand 9 states and 179 transitions. [2024-06-14 11:51:02,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 984 transitions, 18409 flow [2024-06-14 11:51:04,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 984 transitions, 18202 flow, removed 52 selfloop flow, removed 8 redundant places. [2024-06-14 11:51:04,446 INFO L231 Difference]: Finished difference. Result has 349 places, 954 transitions, 16287 flow [2024-06-14 11:51:04,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15850, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=880, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16287, PETRI_PLACES=349, PETRI_TRANSITIONS=954} [2024-06-14 11:51:04,447 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 304 predicate places. [2024-06-14 11:51:04,447 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 954 transitions, 16287 flow [2024-06-14 11:51:04,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 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-14 11:51:04,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:51:04,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:51:04,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 11:51:04,448 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-14 11:51:04,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:51:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash 487706396, now seen corresponding path program 1 times [2024-06-14 11:51:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:51:04,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190330288] [2024-06-14 11:51:04,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:51:04,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:51:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:51:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:51:05,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:51:05,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190330288] [2024-06-14 11:51:05,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190330288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:51:05,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:51:05,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:51:05,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820252167] [2024-06-14 11:51:05,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:51:05,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:51:05,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:51:05,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:51:05,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:51:06,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:51:06,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 954 transitions, 16287 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 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-14 11:51:06,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:51:06,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:51:06,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:51:09,599 INFO L124 PetriNetUnfolderBase]: 6374/9789 cut-off events. [2024-06-14 11:51:09,599 INFO L125 PetriNetUnfolderBase]: For 1094422/1094481 co-relation queries the response was YES. [2024-06-14 11:51:09,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98787 conditions, 9789 events. 6374/9789 cut-off events. For 1094422/1094481 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 60556 event pairs, 1271 based on Foata normal form. 35/9779 useless extension candidates. Maximal degree in co-relation 98629. Up to 7845 conditions per place. [2024-06-14 11:51:09,904 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 798 selfloop transitions, 213 changer transitions 0/1028 dead transitions. [2024-06-14 11:51:09,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1028 transitions, 19494 flow [2024-06-14 11:51:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 11:51:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 11:51:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 266 transitions. [2024-06-14 11:51:09,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46503496503496505 [2024-06-14 11:51:09,905 INFO L175 Difference]: Start difference. First operand has 349 places, 954 transitions, 16287 flow. Second operand 13 states and 266 transitions. [2024-06-14 11:51:09,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1028 transitions, 19494 flow [2024-06-14 11:51:11,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1028 transitions, 19431 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-14 11:51:11,993 INFO L231 Difference]: Finished difference. Result has 360 places, 956 transitions, 16790 flow [2024-06-14 11:51:11,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16224, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=16790, PETRI_PLACES=360, PETRI_TRANSITIONS=956} [2024-06-14 11:51:11,993 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 315 predicate places. [2024-06-14 11:51:11,994 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 956 transitions, 16790 flow [2024-06-14 11:51:11,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 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-14 11:51:11,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:51:11,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:51:11,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 11:51:11,994 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-14 11:51:11,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:51:11,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1129604385, now seen corresponding path program 2 times [2024-06-14 11:51:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:51:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564454202] [2024-06-14 11:51:11,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:51:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:51:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:51:13,004 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-14 11:51:13,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:51:13,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564454202] [2024-06-14 11:51:13,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564454202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:51:13,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:51:13,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 11:51:13,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804454430] [2024-06-14 11:51:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:51:13,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 11:51:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:51:13,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 11:51:13,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 11:51:13,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:51:13,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 956 transitions, 16790 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-14 11:51:13,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:51:13,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:51:13,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:51:16,610 INFO L124 PetriNetUnfolderBase]: 6782/10388 cut-off events. [2024-06-14 11:51:16,610 INFO L125 PetriNetUnfolderBase]: For 1135157/1135500 co-relation queries the response was YES. [2024-06-14 11:51:16,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102532 conditions, 10388 events. 6782/10388 cut-off events. For 1135157/1135500 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 64150 event pairs, 2011 based on Foata normal form. 117/10382 useless extension candidates. Maximal degree in co-relation 102372. Up to 9400 conditions per place. [2024-06-14 11:51:16,795 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 746 selfloop transitions, 48 changer transitions 0/982 dead transitions. [2024-06-14 11:51:16,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 982 transitions, 18666 flow [2024-06-14 11:51:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:51:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:51:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 11:51:16,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403409090909091 [2024-06-14 11:51:16,796 INFO L175 Difference]: Start difference. First operand has 360 places, 956 transitions, 16790 flow. Second operand 8 states and 155 transitions. [2024-06-14 11:51:16,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 982 transitions, 18666 flow [2024-06-14 11:51:19,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 982 transitions, 18413 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-14 11:51:19,168 INFO L231 Difference]: Finished difference. Result has 361 places, 958 transitions, 16698 flow [2024-06-14 11:51:19,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16539, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=956, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16698, PETRI_PLACES=361, PETRI_TRANSITIONS=958} [2024-06-14 11:51:19,168 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 316 predicate places. [2024-06-14 11:51:19,169 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 958 transitions, 16698 flow [2024-06-14 11:51:19,169 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-14 11:51:19,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:51:19,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:51:19,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 11:51:19,169 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:51:19,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:51:19,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1255505018, now seen corresponding path program 2 times [2024-06-14 11:51:19,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:51:19,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144777905] [2024-06-14 11:51:19,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:51:19,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:51:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:51:20,708 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-14 11:51:20,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:51:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144777905] [2024-06-14 11:51:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144777905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:51:20,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:51:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:51:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193166882] [2024-06-14 11:51:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:51:20,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:51:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:51:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:51:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:51:20,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:51:20,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 958 transitions, 16698 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 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-14 11:51:20,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:51:20,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:51:20,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:51:24,844 INFO L124 PetriNetUnfolderBase]: 6700/10326 cut-off events. [2024-06-14 11:51:24,844 INFO L125 PetriNetUnfolderBase]: For 1256316/1256417 co-relation queries the response was YES. [2024-06-14 11:51:24,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107188 conditions, 10326 events. 6700/10326 cut-off events. For 1256316/1256417 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 64855 event pairs, 1523 based on Foata normal form. 35/10313 useless extension candidates. Maximal degree in co-relation 107025. Up to 8685 conditions per place. [2024-06-14 11:51:25,020 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 865 selfloop transitions, 139 changer transitions 0/1022 dead transitions. [2024-06-14 11:51:25,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1022 transitions, 19517 flow [2024-06-14 11:51:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 11:51:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 11:51:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 244 transitions. [2024-06-14 11:51:25,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2024-06-14 11:51:25,021 INFO L175 Difference]: Start difference. First operand has 361 places, 958 transitions, 16698 flow. Second operand 12 states and 244 transitions. [2024-06-14 11:51:25,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 1022 transitions, 19517 flow [2024-06-14 11:51:27,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1022 transitions, 19440 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 11:51:27,771 INFO L231 Difference]: Finished difference. Result has 368 places, 962 transitions, 17174 flow [2024-06-14 11:51:27,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16621, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=820, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17174, PETRI_PLACES=368, PETRI_TRANSITIONS=962} [2024-06-14 11:51:27,772 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 323 predicate places. [2024-06-14 11:51:27,772 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 962 transitions, 17174 flow [2024-06-14 11:51:27,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 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-14 11:51:27,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:51:27,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:51:27,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 11:51:27,773 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:51:27,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:51:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2045043923, now seen corresponding path program 3 times [2024-06-14 11:51:27,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:51:27,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872851191] [2024-06-14 11:51:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:51:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:51:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:51:28,950 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-14 11:51:28,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:51:28,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872851191] [2024-06-14 11:51:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872851191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:51:28,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:51:28,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 11:51:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743933129] [2024-06-14 11:51:28,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:51:28,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 11:51:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:51:28,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 11:51:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 11:51:29,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:51:29,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 962 transitions, 17174 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-14 11:51:29,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:51:29,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:51:29,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:51:32,812 INFO L124 PetriNetUnfolderBase]: 7151/10984 cut-off events. [2024-06-14 11:51:32,813 INFO L125 PetriNetUnfolderBase]: For 1319588/1319895 co-relation queries the response was YES. [2024-06-14 11:51:32,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112477 conditions, 10984 events. 7151/10984 cut-off events. For 1319588/1319895 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 68646 event pairs, 2252 based on Foata normal form. 98/10944 useless extension candidates. Maximal degree in co-relation 112312. Up to 10035 conditions per place. [2024-06-14 11:51:32,997 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 762 selfloop transitions, 30 changer transitions 0/980 dead transitions. [2024-06-14 11:51:32,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 980 transitions, 18830 flow [2024-06-14 11:51:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 11:51:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 11:51:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 11:51:32,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-06-14 11:51:32,998 INFO L175 Difference]: Start difference. First operand has 368 places, 962 transitions, 17174 flow. Second operand 8 states and 148 transitions. [2024-06-14 11:51:32,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 980 transitions, 18830 flow [2024-06-14 11:51:35,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 980 transitions, 18619 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-14 11:51:35,795 INFO L231 Difference]: Finished difference. Result has 368 places, 962 transitions, 17029 flow [2024-06-14 11:51:35,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16963, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17029, PETRI_PLACES=368, PETRI_TRANSITIONS=962} [2024-06-14 11:51:35,796 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 323 predicate places. [2024-06-14 11:51:35,796 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 962 transitions, 17029 flow [2024-06-14 11:51:35,796 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-14 11:51:35,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:51:35,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:51:35,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 11:51:35,796 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:51:35,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:51:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 705181320, now seen corresponding path program 3 times [2024-06-14 11:51:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:51:35,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489268721] [2024-06-14 11:51:35,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:51:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:51:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:51:37,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-14 11:51:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:51:37,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489268721] [2024-06-14 11:51:37,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489268721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:51:37,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:51:37,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:51:37,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045240660] [2024-06-14 11:51:37,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:51:37,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:51:37,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:51:37,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:51:37,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:51:37,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:51:37,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 962 transitions, 17029 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 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-14 11:51:37,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:51:37,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:51:37,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:51:41,801 INFO L124 PetriNetUnfolderBase]: 7480/11529 cut-off events. [2024-06-14 11:51:41,801 INFO L125 PetriNetUnfolderBase]: For 1373990/1374071 co-relation queries the response was YES. [2024-06-14 11:51:41,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117657 conditions, 11529 events. 7480/11529 cut-off events. For 1373990/1374071 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 74069 event pairs, 1238 based on Foata normal form. 66/11548 useless extension candidates. Maximal degree in co-relation 117490. Up to 7585 conditions per place. [2024-06-14 11:51:42,000 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 561 selfloop transitions, 631 changer transitions 0/1210 dead transitions. [2024-06-14 11:51:42,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1210 transitions, 23125 flow [2024-06-14 11:51:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 11:51:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 11:51:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 237 transitions. [2024-06-14 11:51:42,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896694214876033 [2024-06-14 11:51:42,001 INFO L175 Difference]: Start difference. First operand has 368 places, 962 transitions, 17029 flow. Second operand 11 states and 237 transitions. [2024-06-14 11:51:42,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 1210 transitions, 23125 flow [2024-06-14 11:51:45,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 1210 transitions, 23038 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 11:51:45,272 INFO L231 Difference]: Finished difference. Result has 373 places, 1127 transitions, 21188 flow [2024-06-14 11:51:45,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16942, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=494, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21188, PETRI_PLACES=373, PETRI_TRANSITIONS=1127} [2024-06-14 11:51:45,273 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 328 predicate places. [2024-06-14 11:51:45,273 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 1127 transitions, 21188 flow [2024-06-14 11:51:45,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 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-14 11:51:45,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:51:45,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:51:45,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 11:51:45,273 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:51:45,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:51:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2138773955, now seen corresponding path program 12 times [2024-06-14 11:51:45,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:51:45,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048801913] [2024-06-14 11:51:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:51:45,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:51:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:51:46,991 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-14 11:51:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:51:46,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048801913] [2024-06-14 11:51:46,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048801913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:51:46,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:51:46,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 11:51:46,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493275797] [2024-06-14 11:51:46,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:51:46,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 11:51:46,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:51:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 11:51:46,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 11:51:47,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 11:51:47,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1127 transitions, 21188 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 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-14 11:51:47,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:51:47,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 11:51:47,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand