./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.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-06-19_11-23-25.files/protection/mix052_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i ./goblint.2024-06-19_11-23-25.files/protection/mix052_tso.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-7724a2d-m [2024-06-27 20:36:07,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 20:36:07,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 20:36:07,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 20:36:07,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 20:36:07,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 20:36:07,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 20:36:07,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 20:36:07,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 20:36:07,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 20:36:07,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 20:36:07,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 20:36:07,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 20:36:07,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 20:36:07,377 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 20:36:07,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 20:36:07,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 20:36:07,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 20:36:07,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 20:36:07,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 20:36:07,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 20:36:07,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 20:36:07,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 20:36:07,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 20:36:07,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 20:36:07,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 20:36:07,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 20:36:07,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 20:36:07,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 20:36:07,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 20:36:07,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 20:36:07,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 20:36:07,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 20:36:07,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 20:36:07,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 20:36:07,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 20:36:07,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 20:36:07,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 20:36:07,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 20:36:07,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 20:36:07,383 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 20:36:07,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 20:36:07,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 20:36:07,383 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-27 20:36:07,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 20:36:07,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 20:36:07,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 20:36:07,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 20:36:07,570 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 20:36:07,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2024-06-27 20:36:08,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 20:36:08,859 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 20:36:08,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2024-06-27 20:36:08,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eabe47cb/f56043faeb3b4ccfa9fe567ca5903e1e/FLAG6db6d5972 [2024-06-27 20:36:08,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eabe47cb/f56043faeb3b4ccfa9fe567ca5903e1e [2024-06-27 20:36:08,884 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 20:36:08,884 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 20:36:08,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/mix052_tso.oepc.yml/witness.yml [2024-06-27 20:36:09,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 20:36:09,037 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 20:36:09,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 20:36:09,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 20:36:09,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 20:36:09,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 08:36:08" (1/2) ... [2024-06-27 20:36:09,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9ff51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 08:36:09, skipping insertion in model container [2024-06-27 20:36:09,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 08:36:08" (1/2) ... [2024-06-27 20:36:09,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c17c9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 08:36:09, skipping insertion in model container [2024-06-27 20:36:09,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 08:36:09" (2/2) ... [2024-06-27 20:36:09,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9ff51b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09, skipping insertion in model container [2024-06-27 20:36:09,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 08:36:09" (2/2) ... [2024-06-27 20:36:09,046 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 20:36:09,169 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 20:36:09,170 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] (((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (z == 0 || z == 1)) [2024-06-27 20:36:09,170 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] (((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (z == 0 || z == 1)) [2024-06-27 20:36:09,170 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] (((((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (z == 0 || z == 1)) [2024-06-27 20:36:09,170 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 20:36:09,170 INFO L106 edCorrectnessWitness]: ghost_update [L821-L821] multithreaded = 1; [2024-06-27 20:36:09,209 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 20:36:09,482 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 20:36:09,490 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 20:36:09,561 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 20:36:09,588 INFO L206 MainTranslator]: Completed translation [2024-06-27 20:36:09,589 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09 WrapperNode [2024-06-27 20:36:09,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 20:36:09,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 20:36:09,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 20:36:09,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 20:36:09,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,629 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2024-06-27 20:36:09,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 20:36:09,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 20:36:09,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 20:36:09,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 20:36:09,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,654 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 20:36:09,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 20:36:09,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 20:36:09,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 20:36:09,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 20:36:09,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (1/1) ... [2024-06-27 20:36:09,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 20:36:09,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 20:36:09,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 20:36:09,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 20:36:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 20:36:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 20:36:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 20:36:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 20:36:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 20:36:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 20:36:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 20:36:09,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 20:36:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 20:36:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 20:36:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 20:36:09,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 20:36:09,737 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 20:36:09,828 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 20:36:09,830 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 20:36:10,129 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 20:36:10,130 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 20:36:10,270 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 20:36:10,271 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 20:36:10,271 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 08:36:10 BoogieIcfgContainer [2024-06-27 20:36:10,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 20:36:10,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 20:36:10,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 20:36:10,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 20:36:10,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 08:36:08" (1/4) ... [2024-06-27 20:36:10,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7301f24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 08:36:10, skipping insertion in model container [2024-06-27 20:36:10,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 08:36:09" (2/4) ... [2024-06-27 20:36:10,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7301f24a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 08:36:10, skipping insertion in model container [2024-06-27 20:36:10,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 08:36:09" (3/4) ... [2024-06-27 20:36:10,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7301f24a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 08:36:10, skipping insertion in model container [2024-06-27 20:36:10,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 08:36:10" (4/4) ... [2024-06-27 20:36:10,279 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2024-06-27 20:36:10,294 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 20:36:10,294 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 20:36:10,294 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 20:36:10,333 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 20:36:10,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow [2024-06-27 20:36:10,387 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-06-27 20:36:10,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 20:36:10,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 20:36:10,389 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow [2024-06-27 20:36:10,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2024-06-27 20:36:10,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 20:36:10,408 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;@c243156, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 20:36:10,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 20:36:10,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 20:36:10,414 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 20:36:10,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 20:36:10,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:10,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 20:36:10,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:10,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash 372110564, now seen corresponding path program 1 times [2024-06-27 20:36:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:10,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119275674] [2024-06-27 20:36:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:11,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:11,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119275674] [2024-06-27 20:36:11,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119275674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:11,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:11,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 20:36:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848558718] [2024-06-27 20:36:11,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:11,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 20:36:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:11,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 20:36:11,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 20:36:11,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-06-27 20:36:11,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:11,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:11,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-06-27 20:36:11,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:11,618 INFO L124 PetriNetUnfolderBase]: 1156/1825 cut-off events. [2024-06-27 20:36:11,618 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-06-27 20:36:11,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 1825 events. 1156/1825 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8869 event pairs, 805 based on Foata normal form. 1/1786 useless extension candidates. Maximal degree in co-relation 3640. Up to 1740 conditions per place. [2024-06-27 20:36:11,629 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 31 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2024-06-27 20:36:11,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 167 flow [2024-06-27 20:36:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 20:36:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 20:36:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-06-27 20:36:11,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2024-06-27 20:36:11,642 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 71 transitions. [2024-06-27 20:36:11,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 167 flow [2024-06-27 20:36:11,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:11,646 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow [2024-06-27 20:36:11,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-06-27 20:36:11,649 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2024-06-27 20:36:11,650 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow [2024-06-27 20:36:11,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:11,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:11,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:11,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 20:36:11,650 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:11,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1117077401, now seen corresponding path program 1 times [2024-06-27 20:36:11,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:11,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587992981] [2024-06-27 20:36:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587992981] [2024-06-27 20:36:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587992981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:12,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:12,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 20:36:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849469757] [2024-06-27 20:36:12,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:12,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 20:36:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:12,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 20:36:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 20:36:12,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-27 20:36:12,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-27 20:36:12,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:12,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-27 20:36:12,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:12,374 INFO L124 PetriNetUnfolderBase]: 1357/2070 cut-off events. [2024-06-27 20:36:12,374 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2024-06-27 20:36:12,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4737 conditions, 2070 events. 1357/2070 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9703 event pairs, 840 based on Foata normal form. 3/2072 useless extension candidates. Maximal degree in co-relation 4725. Up to 2013 conditions per place. [2024-06-27 20:36:12,384 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 39 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2024-06-27 20:36:12,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 236 flow [2024-06-27 20:36:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 20:36:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 20:36:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-06-27 20:36:12,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55625 [2024-06-27 20:36:12,387 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 89 transitions. [2024-06-27 20:36:12,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 236 flow [2024-06-27 20:36:12,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 20:36:12,390 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 134 flow [2024-06-27 20:36:12,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-27 20:36:12,391 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-06-27 20:36:12,391 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 134 flow [2024-06-27 20:36:12,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-27 20:36:12,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:12,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:12,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 20:36:12,394 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:12,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash 269662507, now seen corresponding path program 1 times [2024-06-27 20:36:12,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317287071] [2024-06-27 20:36:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:12,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317287071] [2024-06-27 20:36:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317287071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:12,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 20:36:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993846367] [2024-06-27 20:36:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:12,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 20:36:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:12,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 20:36:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 20:36:12,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-27 20:36:12,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:12,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:12,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-27 20:36:12,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:13,099 INFO L124 PetriNetUnfolderBase]: 1345/2054 cut-off events. [2024-06-27 20:36:13,100 INFO L125 PetriNetUnfolderBase]: For 1116/1116 co-relation queries the response was YES. [2024-06-27 20:36:13,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5226 conditions, 2054 events. 1345/2054 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9587 event pairs, 592 based on Foata normal form. 6/2059 useless extension candidates. Maximal degree in co-relation 5212. Up to 1965 conditions per place. [2024-06-27 20:36:13,110 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 47 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2024-06-27 20:36:13,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 318 flow [2024-06-27 20:36:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 20:36:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 20:36:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-06-27 20:36:13,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-06-27 20:36:13,112 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 134 flow. Second operand 5 states and 110 transitions. [2024-06-27 20:36:13,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 318 flow [2024-06-27 20:36:13,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 304 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 20:36:13,114 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 170 flow [2024-06-27 20:36:13,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-06-27 20:36:13,115 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2024-06-27 20:36:13,115 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 170 flow [2024-06-27 20:36:13,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:13,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:13,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:13,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 20:36:13,116 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:13,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:13,116 INFO L85 PathProgramCache]: Analyzing trace with hash -265907840, now seen corresponding path program 1 times [2024-06-27 20:36:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772888768] [2024-06-27 20:36:13,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:13,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-27 20:36:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:13,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772888768] [2024-06-27 20:36:13,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772888768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:13,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:13,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 20:36:13,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748587317] [2024-06-27 20:36:13,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:13,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 20:36:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:13,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 20:36:13,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 20:36:13,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-27 20:36:13,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:13,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:13,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-27 20:36:13,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:14,298 INFO L124 PetriNetUnfolderBase]: 1336/2037 cut-off events. [2024-06-27 20:36:14,298 INFO L125 PetriNetUnfolderBase]: For 2056/2056 co-relation queries the response was YES. [2024-06-27 20:36:14,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5693 conditions, 2037 events. 1336/2037 cut-off events. For 2056/2056 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9478 event pairs, 450 based on Foata normal form. 6/2042 useless extension candidates. Maximal degree in co-relation 5678. Up to 1920 conditions per place. [2024-06-27 20:36:14,309 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 51 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2024-06-27 20:36:14,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 372 flow [2024-06-27 20:36:14,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 20:36:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 20:36:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-27 20:36:14,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 20:36:14,311 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 170 flow. Second operand 6 states and 126 transitions. [2024-06-27 20:36:14,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 372 flow [2024-06-27 20:36:14,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 348 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:14,314 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 189 flow [2024-06-27 20:36:14,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-06-27 20:36:14,315 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2024-06-27 20:36:14,315 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 189 flow [2024-06-27 20:36:14,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:14,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:14,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:14,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 20:36:14,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:14,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1195026544, now seen corresponding path program 1 times [2024-06-27 20:36:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:14,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630535225] [2024-06-27 20:36:14,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:14,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:14,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630535225] [2024-06-27 20:36:14,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630535225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:14,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:14,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 20:36:14,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271274889] [2024-06-27 20:36:14,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:14,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 20:36:14,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:14,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 20:36:14,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 20:36:14,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-27 20:36:14,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:14,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:14,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-27 20:36:14,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:15,102 INFO L124 PetriNetUnfolderBase]: 1124/1816 cut-off events. [2024-06-27 20:36:15,102 INFO L125 PetriNetUnfolderBase]: For 2652/2652 co-relation queries the response was YES. [2024-06-27 20:36:15,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5287 conditions, 1816 events. 1124/1816 cut-off events. For 2652/2652 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8843 event pairs, 527 based on Foata normal form. 2/1817 useless extension candidates. Maximal degree in co-relation 5270. Up to 1682 conditions per place. [2024-06-27 20:36:15,110 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 42 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2024-06-27 20:36:15,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 333 flow [2024-06-27 20:36:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 20:36:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 20:36:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-27 20:36:15,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445 [2024-06-27 20:36:15,112 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 189 flow. Second operand 5 states and 89 transitions. [2024-06-27 20:36:15,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 333 flow [2024-06-27 20:36:15,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 300 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 20:36:15,115 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 202 flow [2024-06-27 20:36:15,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-06-27 20:36:15,116 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-06-27 20:36:15,116 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 202 flow [2024-06-27 20:36:15,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:15,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:15,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:15,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 20:36:15,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:15,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash -5272493, now seen corresponding path program 1 times [2024-06-27 20:36:15,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173487646] [2024-06-27 20:36:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:15,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:15,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:15,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173487646] [2024-06-27 20:36:15,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173487646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:15,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:15,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 20:36:15,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789315341] [2024-06-27 20:36:15,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:15,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 20:36:15,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:15,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 20:36:15,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 20:36:15,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:15,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:15,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:15,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:15,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:15,989 INFO L124 PetriNetUnfolderBase]: 1342/2046 cut-off events. [2024-06-27 20:36:15,989 INFO L125 PetriNetUnfolderBase]: For 4400/4400 co-relation queries the response was YES. [2024-06-27 20:36:15,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6516 conditions, 2046 events. 1342/2046 cut-off events. For 4400/4400 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9533 event pairs, 626 based on Foata normal form. 2/2047 useless extension candidates. Maximal degree in co-relation 6497. Up to 1980 conditions per place. [2024-06-27 20:36:16,000 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 50 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2024-06-27 20:36:16,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 390 flow [2024-06-27 20:36:16,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 20:36:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 20:36:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-27 20:36:16,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42916666666666664 [2024-06-27 20:36:16,002 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 202 flow. Second operand 6 states and 103 transitions. [2024-06-27 20:36:16,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 390 flow [2024-06-27 20:36:16,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 368 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:16,005 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 236 flow [2024-06-27 20:36:16,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-06-27 20:36:16,006 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2024-06-27 20:36:16,006 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 236 flow [2024-06-27 20:36:16,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:16,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:16,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:16,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 20:36:16,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:16,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:16,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1664223377, now seen corresponding path program 2 times [2024-06-27 20:36:16,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:16,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58224809] [2024-06-27 20:36:16,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:16,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:16,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58224809] [2024-06-27 20:36:16,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58224809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:16,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:16,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 20:36:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550619429] [2024-06-27 20:36:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:16,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 20:36:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:16,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 20:36:16,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 20:36:16,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:16,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:16,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:16,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:16,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:16,907 INFO L124 PetriNetUnfolderBase]: 1337/2041 cut-off events. [2024-06-27 20:36:16,907 INFO L125 PetriNetUnfolderBase]: For 5954/5964 co-relation queries the response was YES. [2024-06-27 20:36:16,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6991 conditions, 2041 events. 1337/2041 cut-off events. For 5954/5964 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9506 event pairs, 627 based on Foata normal form. 10/2049 useless extension candidates. Maximal degree in co-relation 6971. Up to 1955 conditions per place. [2024-06-27 20:36:16,921 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 45 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2024-06-27 20:36:16,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 422 flow [2024-06-27 20:36:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 20:36:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 20:36:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-27 20:36:16,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-27 20:36:16,922 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 236 flow. Second operand 6 states and 102 transitions. [2024-06-27 20:36:16,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 422 flow [2024-06-27 20:36:16,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 390 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 20:36:16,926 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 276 flow [2024-06-27 20:36:16,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=276, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-06-27 20:36:16,928 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2024-06-27 20:36:16,928 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 276 flow [2024-06-27 20:36:16,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:16,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:16,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:16,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 20:36:16,928 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:16,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash -639107131, now seen corresponding path program 1 times [2024-06-27 20:36:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:16,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697950035] [2024-06-27 20:36:16,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:16,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:17,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:17,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697950035] [2024-06-27 20:36:17,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697950035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:17,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:17,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:36:17,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781592174] [2024-06-27 20:36:17,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:17,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:36:17,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:36:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:36:17,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:17,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 276 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:17,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:17,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:17,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:17,928 INFO L124 PetriNetUnfolderBase]: 1377/2169 cut-off events. [2024-06-27 20:36:17,928 INFO L125 PetriNetUnfolderBase]: For 7619/7619 co-relation queries the response was YES. [2024-06-27 20:36:17,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7684 conditions, 2169 events. 1377/2169 cut-off events. For 7619/7619 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10312 event pairs, 625 based on Foata normal form. 2/2170 useless extension candidates. Maximal degree in co-relation 7663. Up to 2033 conditions per place. [2024-06-27 20:36:17,951 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 57 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2024-06-27 20:36:17,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 505 flow [2024-06-27 20:36:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:36:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:36:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-27 20:36:17,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-27 20:36:17,954 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 276 flow. Second operand 7 states and 115 transitions. [2024-06-27 20:36:17,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 505 flow [2024-06-27 20:36:17,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 454 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 20:36:17,961 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 312 flow [2024-06-27 20:36:17,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2024-06-27 20:36:17,963 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2024-06-27 20:36:17,963 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 312 flow [2024-06-27 20:36:17,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:17,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:17,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:17,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 20:36:17,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:17,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:17,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1780256499, now seen corresponding path program 1 times [2024-06-27 20:36:17,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:17,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327039450] [2024-06-27 20:36:17,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:17,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:18,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327039450] [2024-06-27 20:36:18,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327039450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:18,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:18,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:36:18,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521903044] [2024-06-27 20:36:18,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:18,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:36:18,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:18,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:36:18,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:36:18,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:18,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 312 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:18,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:18,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:18,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:19,013 INFO L124 PetriNetUnfolderBase]: 1589/2407 cut-off events. [2024-06-27 20:36:19,013 INFO L125 PetriNetUnfolderBase]: For 11696/11706 co-relation queries the response was YES. [2024-06-27 20:36:19,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9443 conditions, 2407 events. 1589/2407 cut-off events. For 11696/11706 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11405 event pairs, 560 based on Foata normal form. 4/2410 useless extension candidates. Maximal degree in co-relation 9420. Up to 2295 conditions per place. [2024-06-27 20:36:19,027 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 66 selfloop transitions, 17 changer transitions 0/88 dead transitions. [2024-06-27 20:36:19,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 584 flow [2024-06-27 20:36:19,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:36:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:36:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-27 20:36:19,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-27 20:36:19,029 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 312 flow. Second operand 7 states and 123 transitions. [2024-06-27 20:36:19,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 584 flow [2024-06-27 20:36:19,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 544 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 20:36:19,034 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 366 flow [2024-06-27 20:36:19,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2024-06-27 20:36:19,034 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2024-06-27 20:36:19,034 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 366 flow [2024-06-27 20:36:19,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:19,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:19,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:19,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 20:36:19,035 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:19,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1655840917, now seen corresponding path program 2 times [2024-06-27 20:36:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:19,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003016075] [2024-06-27 20:36:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:19,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:19,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:19,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003016075] [2024-06-27 20:36:19,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003016075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:19,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:36:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799914458] [2024-06-27 20:36:19,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:19,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:36:19,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:19,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:36:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:36:19,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:19,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 366 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:19,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:19,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:19,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:20,007 INFO L124 PetriNetUnfolderBase]: 1669/2526 cut-off events. [2024-06-27 20:36:20,007 INFO L125 PetriNetUnfolderBase]: For 15386/15396 co-relation queries the response was YES. [2024-06-27 20:36:20,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10815 conditions, 2526 events. 1669/2526 cut-off events. For 15386/15396 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11971 event pairs, 557 based on Foata normal form. 18/2543 useless extension candidates. Maximal degree in co-relation 10790. Up to 2297 conditions per place. [2024-06-27 20:36:20,022 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 68 selfloop transitions, 24 changer transitions 0/97 dead transitions. [2024-06-27 20:36:20,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 742 flow [2024-06-27 20:36:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:36:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:36:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 20:36:20,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2024-06-27 20:36:20,024 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 366 flow. Second operand 7 states and 127 transitions. [2024-06-27 20:36:20,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 742 flow [2024-06-27 20:36:20,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 97 transitions, 700 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:20,032 INFO L231 Difference]: Finished difference. Result has 68 places, 70 transitions, 482 flow [2024-06-27 20:36:20,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=482, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2024-06-27 20:36:20,034 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2024-06-27 20:36:20,034 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 482 flow [2024-06-27 20:36:20,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:20,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:20,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:20,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 20:36:20,035 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:20,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:20,035 INFO L85 PathProgramCache]: Analyzing trace with hash -51316531, now seen corresponding path program 3 times [2024-06-27 20:36:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:20,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546820610] [2024-06-27 20:36:20,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:20,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:20,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546820610] [2024-06-27 20:36:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546820610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:36:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143217557] [2024-06-27 20:36:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:20,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:36:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:20,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:36:20,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:36:20,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:20,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 482 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:20,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:20,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:20,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:20,974 INFO L124 PetriNetUnfolderBase]: 1687/2559 cut-off events. [2024-06-27 20:36:20,974 INFO L125 PetriNetUnfolderBase]: For 19907/19914 co-relation queries the response was YES. [2024-06-27 20:36:20,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11916 conditions, 2559 events. 1687/2559 cut-off events. For 19907/19914 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12238 event pairs, 521 based on Foata normal form. 12/2568 useless extension candidates. Maximal degree in co-relation 11889. Up to 2208 conditions per place. [2024-06-27 20:36:20,991 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 63 selfloop transitions, 37 changer transitions 0/105 dead transitions. [2024-06-27 20:36:20,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 936 flow [2024-06-27 20:36:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:36:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:36:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-27 20:36:20,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2024-06-27 20:36:20,992 INFO L175 Difference]: Start difference. First operand has 68 places, 70 transitions, 482 flow. Second operand 7 states and 131 transitions. [2024-06-27 20:36:20,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 936 flow [2024-06-27 20:36:21,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 105 transitions, 890 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:21,002 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 634 flow [2024-06-27 20:36:21,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=634, PETRI_PLACES=73, PETRI_TRANSITIONS=78} [2024-06-27 20:36:21,003 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2024-06-27 20:36:21,003 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 634 flow [2024-06-27 20:36:21,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:21,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:21,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:21,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 20:36:21,003 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:21,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1662516271, now seen corresponding path program 1 times [2024-06-27 20:36:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114581142] [2024-06-27 20:36:21,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114581142] [2024-06-27 20:36:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114581142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:21,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:21,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:36:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506801162] [2024-06-27 20:36:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:21,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:36:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:21,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:36:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:36:21,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:21,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 634 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:21,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:21,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:21,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:22,243 INFO L124 PetriNetUnfolderBase]: 1573/2452 cut-off events. [2024-06-27 20:36:22,244 INFO L125 PetriNetUnfolderBase]: For 20059/20059 co-relation queries the response was YES. [2024-06-27 20:36:22,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11731 conditions, 2452 events. 1573/2452 cut-off events. For 20059/20059 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11744 event pairs, 470 based on Foata normal form. 4/2455 useless extension candidates. Maximal degree in co-relation 11701. Up to 2302 conditions per place. [2024-06-27 20:36:22,258 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 84 selfloop transitions, 16 changer transitions 0/104 dead transitions. [2024-06-27 20:36:22,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 104 transitions, 926 flow [2024-06-27 20:36:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:36:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:36:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-27 20:36:22,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-27 20:36:22,259 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 634 flow. Second operand 8 states and 130 transitions. [2024-06-27 20:36:22,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 104 transitions, 926 flow [2024-06-27 20:36:22,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 822 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-27 20:36:22,273 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 605 flow [2024-06-27 20:36:22,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=605, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2024-06-27 20:36:22,274 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2024-06-27 20:36:22,274 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 605 flow [2024-06-27 20:36:22,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:22,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:22,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:22,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 20:36:22,275 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:22,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash -351837238, now seen corresponding path program 1 times [2024-06-27 20:36:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:22,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354900686] [2024-06-27 20:36:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:22,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354900686] [2024-06-27 20:36:22,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354900686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:22,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:22,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 20:36:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479878549] [2024-06-27 20:36:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:22,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 20:36:22,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:22,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 20:36:22,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 20:36:22,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:22,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 605 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:22,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:22,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:22,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:23,086 INFO L124 PetriNetUnfolderBase]: 1567/2444 cut-off events. [2024-06-27 20:36:23,087 INFO L125 PetriNetUnfolderBase]: For 20150/20150 co-relation queries the response was YES. [2024-06-27 20:36:23,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11365 conditions, 2444 events. 1567/2444 cut-off events. For 20150/20150 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11645 event pairs, 490 based on Foata normal form. 2/2445 useless extension candidates. Maximal degree in co-relation 11334. Up to 2333 conditions per place. [2024-06-27 20:36:23,099 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 80 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-06-27 20:36:23,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 92 transitions, 825 flow [2024-06-27 20:36:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 20:36:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 20:36:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-27 20:36:23,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2024-06-27 20:36:23,101 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 605 flow. Second operand 5 states and 82 transitions. [2024-06-27 20:36:23,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 92 transitions, 825 flow [2024-06-27 20:36:23,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 92 transitions, 770 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-27 20:36:23,112 INFO L231 Difference]: Finished difference. Result has 76 places, 83 transitions, 600 flow [2024-06-27 20:36:23,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=600, PETRI_PLACES=76, PETRI_TRANSITIONS=83} [2024-06-27 20:36:23,112 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2024-06-27 20:36:23,113 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 83 transitions, 600 flow [2024-06-27 20:36:23,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:23,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:23,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:23,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 20:36:23,113 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-27 20:36:23,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1504236366, now seen corresponding path program 1 times [2024-06-27 20:36:23,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:23,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587582714] [2024-06-27 20:36:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:23,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587582714] [2024-06-27 20:36:23,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587582714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:23,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:23,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:36:23,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417323557] [2024-06-27 20:36:23,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:23,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:36:23,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:23,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:36:23,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:36:23,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:23,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 83 transitions, 600 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:23,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:23,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:23,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:24,358 INFO L124 PetriNetUnfolderBase]: 1665/2523 cut-off events. [2024-06-27 20:36:24,359 INFO L125 PetriNetUnfolderBase]: For 26069/26069 co-relation queries the response was YES. [2024-06-27 20:36:24,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12770 conditions, 2523 events. 1665/2523 cut-off events. For 26069/26069 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12018 event pairs, 507 based on Foata normal form. 2/2524 useless extension candidates. Maximal degree in co-relation 12738. Up to 2402 conditions per place. [2024-06-27 20:36:24,374 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 88 selfloop transitions, 19 changer transitions 0/112 dead transitions. [2024-06-27 20:36:24,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 112 transitions, 928 flow [2024-06-27 20:36:24,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:36:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:36:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-27 20:36:24,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-27 20:36:24,376 INFO L175 Difference]: Start difference. First operand has 76 places, 83 transitions, 600 flow. Second operand 7 states and 123 transitions. [2024-06-27 20:36:24,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 112 transitions, 928 flow [2024-06-27 20:36:24,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 112 transitions, 900 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:24,389 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 674 flow [2024-06-27 20:36:24,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=674, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2024-06-27 20:36:24,390 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2024-06-27 20:36:24,390 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 674 flow [2024-06-27 20:36:24,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:24,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:24,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:24,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 20:36:24,391 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:24,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash -771873166, now seen corresponding path program 1 times [2024-06-27 20:36:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:24,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122691912] [2024-06-27 20:36:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:25,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-27 20:36:25,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:25,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122691912] [2024-06-27 20:36:25,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122691912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:25,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:25,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:36:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789497648] [2024-06-27 20:36:25,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:25,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:36:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:25,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:36:25,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:36:25,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:25,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 674 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:25,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:25,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:25,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:25,577 INFO L124 PetriNetUnfolderBase]: 1785/2662 cut-off events. [2024-06-27 20:36:25,577 INFO L125 PetriNetUnfolderBase]: For 28843/28843 co-relation queries the response was YES. [2024-06-27 20:36:25,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13292 conditions, 2662 events. 1785/2662 cut-off events. For 28843/28843 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12104 event pairs, 501 based on Foata normal form. 6/2667 useless extension candidates. Maximal degree in co-relation 13259. Up to 2435 conditions per place. [2024-06-27 20:36:25,595 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 88 selfloop transitions, 35 changer transitions 0/126 dead transitions. [2024-06-27 20:36:25,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 126 transitions, 1095 flow [2024-06-27 20:36:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:36:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:36:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 20:36:25,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-27 20:36:25,597 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 674 flow. Second operand 8 states and 134 transitions. [2024-06-27 20:36:25,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 126 transitions, 1095 flow [2024-06-27 20:36:25,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 126 transitions, 999 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-27 20:36:25,614 INFO L231 Difference]: Finished difference. Result has 84 places, 96 transitions, 766 flow [2024-06-27 20:36:25,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=766, PETRI_PLACES=84, PETRI_TRANSITIONS=96} [2024-06-27 20:36:25,616 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2024-06-27 20:36:25,616 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 766 flow [2024-06-27 20:36:25,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:25,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:25,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:25,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 20:36:25,616 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:25,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:25,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1590805874, now seen corresponding path program 2 times [2024-06-27 20:36:25,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:25,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610682377] [2024-06-27 20:36:25,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:25,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:26,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610682377] [2024-06-27 20:36:26,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610682377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:26,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:26,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:36:26,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037476205] [2024-06-27 20:36:26,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:26,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:36:26,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:26,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:36:26,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:36:26,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:26,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 766 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:26,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:26,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:26,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:26,841 INFO L124 PetriNetUnfolderBase]: 1851/2763 cut-off events. [2024-06-27 20:36:26,841 INFO L125 PetriNetUnfolderBase]: For 32971/32978 co-relation queries the response was YES. [2024-06-27 20:36:26,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14142 conditions, 2763 events. 1851/2763 cut-off events. For 32971/32978 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12592 event pairs, 520 based on Foata normal form. 10/2770 useless extension candidates. Maximal degree in co-relation 14107. Up to 2437 conditions per place. [2024-06-27 20:36:26,854 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 84 selfloop transitions, 49 changer transitions 0/136 dead transitions. [2024-06-27 20:36:26,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 136 transitions, 1208 flow [2024-06-27 20:36:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:36:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:36:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-27 20:36:26,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428125 [2024-06-27 20:36:26,855 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 766 flow. Second operand 8 states and 137 transitions. [2024-06-27 20:36:26,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 136 transitions, 1208 flow [2024-06-27 20:36:26,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 136 transitions, 1155 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 20:36:26,872 INFO L231 Difference]: Finished difference. Result has 89 places, 108 transitions, 937 flow [2024-06-27 20:36:26,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=937, PETRI_PLACES=89, PETRI_TRANSITIONS=108} [2024-06-27 20:36:26,873 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places. [2024-06-27 20:36:26,873 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 108 transitions, 937 flow [2024-06-27 20:36:26,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:26,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:26,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:26,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 20:36:26,874 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:26,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1590596624, now seen corresponding path program 3 times [2024-06-27 20:36:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:26,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870288189] [2024-06-27 20:36:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:27,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:27,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870288189] [2024-06-27 20:36:27,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870288189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:27,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:27,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:36:27,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100780492] [2024-06-27 20:36:27,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:27,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:36:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:27,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:36:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:36:27,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:27,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 108 transitions, 937 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:27,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:27,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:27,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:28,164 INFO L124 PetriNetUnfolderBase]: 1840/2743 cut-off events. [2024-06-27 20:36:28,164 INFO L125 PetriNetUnfolderBase]: For 36126/36139 co-relation queries the response was YES. [2024-06-27 20:36:28,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14617 conditions, 2743 events. 1840/2743 cut-off events. For 36126/36139 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12505 event pairs, 508 based on Foata normal form. 12/2753 useless extension candidates. Maximal degree in co-relation 14579. Up to 2610 conditions per place. [2024-06-27 20:36:28,179 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 105 selfloop transitions, 39 changer transitions 0/147 dead transitions. [2024-06-27 20:36:28,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 147 transitions, 1424 flow [2024-06-27 20:36:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:36:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:36:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-27 20:36:28,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2024-06-27 20:36:28,181 INFO L175 Difference]: Start difference. First operand has 89 places, 108 transitions, 937 flow. Second operand 9 states and 141 transitions. [2024-06-27 20:36:28,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 147 transitions, 1424 flow [2024-06-27 20:36:28,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 147 transitions, 1327 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:28,202 INFO L231 Difference]: Finished difference. Result has 97 places, 120 transitions, 1096 flow [2024-06-27 20:36:28,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1096, PETRI_PLACES=97, PETRI_TRANSITIONS=120} [2024-06-27 20:36:28,202 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places. [2024-06-27 20:36:28,203 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 120 transitions, 1096 flow [2024-06-27 20:36:28,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:28,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:28,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:28,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 20:36:28,203 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:28,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1053991146, now seen corresponding path program 1 times [2024-06-27 20:36:28,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:28,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927792647] [2024-06-27 20:36:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:28,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:29,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:29,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927792647] [2024-06-27 20:36:29,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927792647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:29,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:29,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:29,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163357120] [2024-06-27 20:36:29,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:29,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:29,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:29,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:29,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:29,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 120 transitions, 1096 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:29,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:29,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:29,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:29,625 INFO L124 PetriNetUnfolderBase]: 1819/2779 cut-off events. [2024-06-27 20:36:29,626 INFO L125 PetriNetUnfolderBase]: For 40042/40051 co-relation queries the response was YES. [2024-06-27 20:36:29,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15204 conditions, 2779 events. 1819/2779 cut-off events. For 40042/40051 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13318 event pairs, 464 based on Foata normal form. 8/2779 useless extension candidates. Maximal degree in co-relation 15162. Up to 2565 conditions per place. [2024-06-27 20:36:29,641 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 134 selfloop transitions, 31 changer transitions 0/174 dead transitions. [2024-06-27 20:36:29,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 174 transitions, 1710 flow [2024-06-27 20:36:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:36:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:36:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-27 20:36:29,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-27 20:36:29,645 INFO L175 Difference]: Start difference. First operand has 97 places, 120 transitions, 1096 flow. Second operand 9 states and 156 transitions. [2024-06-27 20:36:29,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 174 transitions, 1710 flow [2024-06-27 20:36:29,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 174 transitions, 1638 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:29,676 INFO L231 Difference]: Finished difference. Result has 106 places, 139 transitions, 1316 flow [2024-06-27 20:36:29,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1316, PETRI_PLACES=106, PETRI_TRANSITIONS=139} [2024-06-27 20:36:29,677 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2024-06-27 20:36:29,677 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 139 transitions, 1316 flow [2024-06-27 20:36:29,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:29,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:29,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:29,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 20:36:29,678 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:29,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:29,678 INFO L85 PathProgramCache]: Analyzing trace with hash -613372694, now seen corresponding path program 2 times [2024-06-27 20:36:29,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:29,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823782077] [2024-06-27 20:36:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:29,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:30,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:30,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823782077] [2024-06-27 20:36:30,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823782077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:30,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:30,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:30,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983009905] [2024-06-27 20:36:30,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:30,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:30,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:30,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:30,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:30,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:30,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 139 transitions, 1316 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:30,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:30,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:30,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:31,108 INFO L124 PetriNetUnfolderBase]: 1852/2836 cut-off events. [2024-06-27 20:36:31,108 INFO L125 PetriNetUnfolderBase]: For 45843/45856 co-relation queries the response was YES. [2024-06-27 20:36:31,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16158 conditions, 2836 events. 1852/2836 cut-off events. For 45843/45856 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13687 event pairs, 326 based on Foata normal form. 12/2840 useless extension candidates. Maximal degree in co-relation 16112. Up to 2558 conditions per place. [2024-06-27 20:36:31,127 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 129 selfloop transitions, 34 changer transitions 0/172 dead transitions. [2024-06-27 20:36:31,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 172 transitions, 1784 flow [2024-06-27 20:36:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:36:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:36:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-27 20:36:31,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428125 [2024-06-27 20:36:31,129 INFO L175 Difference]: Start difference. First operand has 106 places, 139 transitions, 1316 flow. Second operand 8 states and 137 transitions. [2024-06-27 20:36:31,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 172 transitions, 1784 flow [2024-06-27 20:36:31,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 172 transitions, 1718 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:31,167 INFO L231 Difference]: Finished difference. Result has 111 places, 141 transitions, 1376 flow [2024-06-27 20:36:31,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1376, PETRI_PLACES=111, PETRI_TRANSITIONS=141} [2024-06-27 20:36:31,168 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2024-06-27 20:36:31,168 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 141 transitions, 1376 flow [2024-06-27 20:36:31,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:31,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:31,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:31,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 20:36:31,168 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:31,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:31,169 INFO L85 PathProgramCache]: Analyzing trace with hash -613312244, now seen corresponding path program 3 times [2024-06-27 20:36:31,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:31,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346892271] [2024-06-27 20:36:31,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:31,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:32,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:32,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346892271] [2024-06-27 20:36:32,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346892271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:32,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:32,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:32,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143526434] [2024-06-27 20:36:32,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:32,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:32,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:32,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:32,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:32,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 141 transitions, 1376 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:32,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:32,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:32,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:32,730 INFO L124 PetriNetUnfolderBase]: 1881/2885 cut-off events. [2024-06-27 20:36:32,731 INFO L125 PetriNetUnfolderBase]: For 52616/52629 co-relation queries the response was YES. [2024-06-27 20:36:32,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16848 conditions, 2885 events. 1881/2885 cut-off events. For 52616/52629 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 14017 event pairs, 428 based on Foata normal form. 16/2893 useless extension candidates. Maximal degree in co-relation 16801. Up to 2613 conditions per place. [2024-06-27 20:36:32,748 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 127 selfloop transitions, 38 changer transitions 0/174 dead transitions. [2024-06-27 20:36:32,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 174 transitions, 1854 flow [2024-06-27 20:36:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:36:32,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:36:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-27 20:36:32,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43125 [2024-06-27 20:36:32,750 INFO L175 Difference]: Start difference. First operand has 111 places, 141 transitions, 1376 flow. Second operand 8 states and 138 transitions. [2024-06-27 20:36:32,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 174 transitions, 1854 flow [2024-06-27 20:36:32,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 174 transitions, 1744 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 20:36:32,790 INFO L231 Difference]: Finished difference. Result has 113 places, 143 transitions, 1404 flow [2024-06-27 20:36:32,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1404, PETRI_PLACES=113, PETRI_TRANSITIONS=143} [2024-06-27 20:36:32,791 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2024-06-27 20:36:32,791 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 143 transitions, 1404 flow [2024-06-27 20:36:32,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:32,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:32,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:32,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 20:36:32,791 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:32,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash -495039866, now seen corresponding path program 1 times [2024-06-27 20:36:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:32,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948194827] [2024-06-27 20:36:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:32,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:33,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948194827] [2024-06-27 20:36:33,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948194827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:33,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:33,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:33,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642690962] [2024-06-27 20:36:33,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:33,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:33,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:33,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:33,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:33,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:33,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 143 transitions, 1404 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:33,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:33,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:33,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:34,287 INFO L124 PetriNetUnfolderBase]: 2112/3183 cut-off events. [2024-06-27 20:36:34,287 INFO L125 PetriNetUnfolderBase]: For 58103/58109 co-relation queries the response was YES. [2024-06-27 20:36:34,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18003 conditions, 3183 events. 2112/3183 cut-off events. For 58103/58109 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15091 event pairs, 490 based on Foata normal form. 30/3212 useless extension candidates. Maximal degree in co-relation 17955. Up to 2742 conditions per place. [2024-06-27 20:36:34,307 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 127 selfloop transitions, 52 changer transitions 0/182 dead transitions. [2024-06-27 20:36:34,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 182 transitions, 1924 flow [2024-06-27 20:36:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:36:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:36:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-27 20:36:34,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-27 20:36:34,309 INFO L175 Difference]: Start difference. First operand has 113 places, 143 transitions, 1404 flow. Second operand 9 states and 152 transitions. [2024-06-27 20:36:34,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 182 transitions, 1924 flow [2024-06-27 20:36:34,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 182 transitions, 1814 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 20:36:34,353 INFO L231 Difference]: Finished difference. Result has 116 places, 145 transitions, 1451 flow [2024-06-27 20:36:34,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1451, PETRI_PLACES=116, PETRI_TRANSITIONS=145} [2024-06-27 20:36:34,354 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2024-06-27 20:36:34,354 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 145 transitions, 1451 flow [2024-06-27 20:36:34,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:34,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:34,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:34,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 20:36:34,354 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-27 20:36:34,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:34,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1841551784, now seen corresponding path program 4 times [2024-06-27 20:36:34,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:34,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142044314] [2024-06-27 20:36:34,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:34,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:35,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:35,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142044314] [2024-06-27 20:36:35,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142044314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:35,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:35,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:35,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384838980] [2024-06-27 20:36:35,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:35,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:35,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:35,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:35,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:35,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:35,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 145 transitions, 1451 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:35,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:35,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:35,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:35,967 INFO L124 PetriNetUnfolderBase]: 2069/3200 cut-off events. [2024-06-27 20:36:35,967 INFO L125 PetriNetUnfolderBase]: For 66425/66436 co-relation queries the response was YES. [2024-06-27 20:36:35,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18767 conditions, 3200 events. 2069/3200 cut-off events. For 66425/66436 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16123 event pairs, 466 based on Foata normal form. 34/3226 useless extension candidates. Maximal degree in co-relation 18718. Up to 2709 conditions per place. [2024-06-27 20:36:35,987 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 118 selfloop transitions, 52 changer transitions 0/179 dead transitions. [2024-06-27 20:36:35,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 179 transitions, 1947 flow [2024-06-27 20:36:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:36:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:36:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 20:36:35,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 20:36:35,989 INFO L175 Difference]: Start difference. First operand has 116 places, 145 transitions, 1451 flow. Second operand 8 states and 144 transitions. [2024-06-27 20:36:35,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 179 transitions, 1947 flow [2024-06-27 20:36:36,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 179 transitions, 1820 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-27 20:36:36,043 INFO L231 Difference]: Finished difference. Result has 117 places, 147 transitions, 1492 flow [2024-06-27 20:36:36,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1492, PETRI_PLACES=117, PETRI_TRANSITIONS=147} [2024-06-27 20:36:36,043 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2024-06-27 20:36:36,043 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 147 transitions, 1492 flow [2024-06-27 20:36:36,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:36,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:36,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:36,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 20:36:36,044 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:36,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1038641055, now seen corresponding path program 1 times [2024-06-27 20:36:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:36,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629280511] [2024-06-27 20:36:36,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:36,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:36,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629280511] [2024-06-27 20:36:36,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629280511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:36,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:36,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 20:36:36,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382231649] [2024-06-27 20:36:36,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:36,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 20:36:36,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:36,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 20:36:36,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 20:36:36,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:36,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 147 transitions, 1492 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:36,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:36,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:36,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:37,137 INFO L124 PetriNetUnfolderBase]: 2226/3367 cut-off events. [2024-06-27 20:36:37,137 INFO L125 PetriNetUnfolderBase]: For 65649/65657 co-relation queries the response was YES. [2024-06-27 20:36:37,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19494 conditions, 3367 events. 2226/3367 cut-off events. For 65649/65657 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16238 event pairs, 513 based on Foata normal form. 9/3375 useless extension candidates. Maximal degree in co-relation 19444. Up to 3317 conditions per place. [2024-06-27 20:36:37,160 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 151 selfloop transitions, 19 changer transitions 0/173 dead transitions. [2024-06-27 20:36:37,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 173 transitions, 1996 flow [2024-06-27 20:36:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 20:36:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 20:36:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-27 20:36:37,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-27 20:36:37,161 INFO L175 Difference]: Start difference. First operand has 117 places, 147 transitions, 1492 flow. Second operand 6 states and 97 transitions. [2024-06-27 20:36:37,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 173 transitions, 1996 flow [2024-06-27 20:36:37,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 173 transitions, 1862 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-27 20:36:37,224 INFO L231 Difference]: Finished difference. Result has 118 places, 156 transitions, 1485 flow [2024-06-27 20:36:37,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1485, PETRI_PLACES=118, PETRI_TRANSITIONS=156} [2024-06-27 20:36:37,224 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 77 predicate places. [2024-06-27 20:36:37,224 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 156 transitions, 1485 flow [2024-06-27 20:36:37,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:37,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:37,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:37,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 20:36:37,225 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:37,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2070340986, now seen corresponding path program 2 times [2024-06-27 20:36:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:37,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360839855] [2024-06-27 20:36:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:38,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:38,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360839855] [2024-06-27 20:36:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360839855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:38,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:38,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:38,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126889385] [2024-06-27 20:36:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:38,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:38,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:38,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:38,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:38,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:38,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 156 transitions, 1485 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:38,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:38,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:38,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:38,702 INFO L124 PetriNetUnfolderBase]: 2243/3396 cut-off events. [2024-06-27 20:36:38,702 INFO L125 PetriNetUnfolderBase]: For 68673/68697 co-relation queries the response was YES. [2024-06-27 20:36:38,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19671 conditions, 3396 events. 2243/3396 cut-off events. For 68673/68697 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16425 event pairs, 517 based on Foata normal form. 24/3417 useless extension candidates. Maximal degree in co-relation 19619. Up to 3261 conditions per place. [2024-06-27 20:36:38,728 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 151 selfloop transitions, 34 changer transitions 0/188 dead transitions. [2024-06-27 20:36:38,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 188 transitions, 1999 flow [2024-06-27 20:36:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:36:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:36:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-27 20:36:38,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2024-06-27 20:36:38,730 INFO L175 Difference]: Start difference. First operand has 118 places, 156 transitions, 1485 flow. Second operand 9 states and 141 transitions. [2024-06-27 20:36:38,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 188 transitions, 1999 flow [2024-06-27 20:36:38,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 188 transitions, 1971 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-06-27 20:36:38,787 INFO L231 Difference]: Finished difference. Result has 126 places, 158 transitions, 1584 flow [2024-06-27 20:36:38,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1584, PETRI_PLACES=126, PETRI_TRANSITIONS=158} [2024-06-27 20:36:38,787 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 85 predicate places. [2024-06-27 20:36:38,787 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 158 transitions, 1584 flow [2024-06-27 20:36:38,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:38,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:38,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:38,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 20:36:38,788 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:38,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2007190918, now seen corresponding path program 5 times [2024-06-27 20:36:38,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:38,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290105810] [2024-06-27 20:36:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:39,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290105810] [2024-06-27 20:36:39,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290105810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:39,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:39,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:39,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974858706] [2024-06-27 20:36:39,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:39,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:39,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:39,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:39,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:39,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 158 transitions, 1584 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:39,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:39,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:39,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:40,273 INFO L124 PetriNetUnfolderBase]: 2154/3343 cut-off events. [2024-06-27 20:36:40,273 INFO L125 PetriNetUnfolderBase]: For 82367/82393 co-relation queries the response was YES. [2024-06-27 20:36:40,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19989 conditions, 3343 events. 2154/3343 cut-off events. For 82367/82393 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 16970 event pairs, 474 based on Foata normal form. 38/3362 useless extension candidates. Maximal degree in co-relation 19934. Up to 2655 conditions per place. [2024-06-27 20:36:40,340 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 103 selfloop transitions, 81 changer transitions 0/193 dead transitions. [2024-06-27 20:36:40,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 193 transitions, 2204 flow [2024-06-27 20:36:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:36:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:36:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 20:36:40,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-27 20:36:40,342 INFO L175 Difference]: Start difference. First operand has 126 places, 158 transitions, 1584 flow. Second operand 8 states and 148 transitions. [2024-06-27 20:36:40,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 193 transitions, 2204 flow [2024-06-27 20:36:40,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 193 transitions, 2101 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-27 20:36:40,398 INFO L231 Difference]: Finished difference. Result has 129 places, 160 transitions, 1713 flow [2024-06-27 20:36:40,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1713, PETRI_PLACES=129, PETRI_TRANSITIONS=160} [2024-06-27 20:36:40,400 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 88 predicate places. [2024-06-27 20:36:40,400 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 160 transitions, 1713 flow [2024-06-27 20:36:40,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:40,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:40,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:40,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 20:36:40,401 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-27 20:36:40,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:40,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1834165626, now seen corresponding path program 3 times [2024-06-27 20:36:40,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:40,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658738190] [2024-06-27 20:36:40,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:41,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658738190] [2024-06-27 20:36:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658738190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505641976] [2024-06-27 20:36:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:41,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:41,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:41,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:41,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:41,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 160 transitions, 1713 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:41,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:41,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:41,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:41,973 INFO L124 PetriNetUnfolderBase]: 2319/3524 cut-off events. [2024-06-27 20:36:41,973 INFO L125 PetriNetUnfolderBase]: For 82358/82382 co-relation queries the response was YES. [2024-06-27 20:36:41,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21208 conditions, 3524 events. 2319/3524 cut-off events. For 82358/82382 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17291 event pairs, 543 based on Foata normal form. 24/3545 useless extension candidates. Maximal degree in co-relation 21152. Up to 3357 conditions per place. [2024-06-27 20:36:41,994 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 149 selfloop transitions, 44 changer transitions 0/196 dead transitions. [2024-06-27 20:36:41,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 196 transitions, 2261 flow [2024-06-27 20:36:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:36:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:36:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-06-27 20:36:41,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-27 20:36:41,996 INFO L175 Difference]: Start difference. First operand has 129 places, 160 transitions, 1713 flow. Second operand 10 states and 155 transitions. [2024-06-27 20:36:41,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 196 transitions, 2261 flow [2024-06-27 20:36:42,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 196 transitions, 2086 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 20:36:42,067 INFO L231 Difference]: Finished difference. Result has 134 places, 162 transitions, 1691 flow [2024-06-27 20:36:42,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1691, PETRI_PLACES=134, PETRI_TRANSITIONS=162} [2024-06-27 20:36:42,068 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 93 predicate places. [2024-06-27 20:36:42,068 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 162 transitions, 1691 flow [2024-06-27 20:36:42,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:42,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:42,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:42,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 20:36:42,069 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:42,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1833868956, now seen corresponding path program 4 times [2024-06-27 20:36:42,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:42,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995884384] [2024-06-27 20:36:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:42,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995884384] [2024-06-27 20:36:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995884384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:42,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:42,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870396413] [2024-06-27 20:36:42,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:42,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:42,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:42,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:42,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:42,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:42,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 162 transitions, 1691 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:42,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:42,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:42,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:43,503 INFO L124 PetriNetUnfolderBase]: 2311/3512 cut-off events. [2024-06-27 20:36:43,504 INFO L125 PetriNetUnfolderBase]: For 82711/82735 co-relation queries the response was YES. [2024-06-27 20:36:43,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20785 conditions, 3512 events. 2311/3512 cut-off events. For 82711/82735 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17257 event pairs, 492 based on Foata normal form. 24/3533 useless extension candidates. Maximal degree in co-relation 20728. Up to 3268 conditions per place. [2024-06-27 20:36:43,528 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 143 selfloop transitions, 50 changer transitions 0/196 dead transitions. [2024-06-27 20:36:43,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 196 transitions, 2245 flow [2024-06-27 20:36:43,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:36:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:36:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-27 20:36:43,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2024-06-27 20:36:43,530 INFO L175 Difference]: Start difference. First operand has 134 places, 162 transitions, 1691 flow. Second operand 9 states and 142 transitions. [2024-06-27 20:36:43,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 196 transitions, 2245 flow [2024-06-27 20:36:43,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 196 transitions, 2110 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-27 20:36:43,604 INFO L231 Difference]: Finished difference. Result has 136 places, 165 transitions, 1751 flow [2024-06-27 20:36:43,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1751, PETRI_PLACES=136, PETRI_TRANSITIONS=165} [2024-06-27 20:36:43,605 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 95 predicate places. [2024-06-27 20:36:43,605 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 165 transitions, 1751 flow [2024-06-27 20:36:43,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:43,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:43,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:43,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 20:36:43,605 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:43,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:43,606 INFO L85 PathProgramCache]: Analyzing trace with hash -699767202, now seen corresponding path program 1 times [2024-06-27 20:36:43,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:43,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613259363] [2024-06-27 20:36:43,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:43,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:44,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:44,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613259363] [2024-06-27 20:36:44,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613259363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:44,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328395638] [2024-06-27 20:36:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:44,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:44,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:44,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:44,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:44,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 165 transitions, 1751 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:44,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:44,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:44,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:44,963 INFO L124 PetriNetUnfolderBase]: 2323/3534 cut-off events. [2024-06-27 20:36:44,964 INFO L125 PetriNetUnfolderBase]: For 87476/87492 co-relation queries the response was YES. [2024-06-27 20:36:44,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21053 conditions, 3534 events. 2323/3534 cut-off events. For 87476/87492 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17363 event pairs, 522 based on Foata normal form. 14/3543 useless extension candidates. Maximal degree in co-relation 20994. Up to 2986 conditions per place. [2024-06-27 20:36:44,988 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 114 selfloop transitions, 84 changer transitions 0/201 dead transitions. [2024-06-27 20:36:44,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 201 transitions, 2286 flow [2024-06-27 20:36:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:36:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:36:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 20:36:44,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-27 20:36:44,990 INFO L175 Difference]: Start difference. First operand has 136 places, 165 transitions, 1751 flow. Second operand 9 states and 151 transitions. [2024-06-27 20:36:44,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 201 transitions, 2286 flow [2024-06-27 20:36:45,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 201 transitions, 2117 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-27 20:36:45,083 INFO L231 Difference]: Finished difference. Result has 139 places, 170 transitions, 1799 flow [2024-06-27 20:36:45,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1799, PETRI_PLACES=139, PETRI_TRANSITIONS=170} [2024-06-27 20:36:45,083 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places. [2024-06-27 20:36:45,083 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 170 transitions, 1799 flow [2024-06-27 20:36:45,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:45,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:45,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:45,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 20:36:45,084 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:45,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:45,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1186858601, now seen corresponding path program 2 times [2024-06-27 20:36:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:45,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236822734] [2024-06-27 20:36:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:45,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:45,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:45,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236822734] [2024-06-27 20:36:45,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236822734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:45,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:45,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 20:36:45,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567696315] [2024-06-27 20:36:45,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:45,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 20:36:45,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 20:36:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 20:36:45,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:45,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 170 transitions, 1799 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:45,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:45,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:45,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:46,101 INFO L124 PetriNetUnfolderBase]: 2320/3526 cut-off events. [2024-06-27 20:36:46,101 INFO L125 PetriNetUnfolderBase]: For 90314/90338 co-relation queries the response was YES. [2024-06-27 20:36:46,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21193 conditions, 3526 events. 2320/3526 cut-off events. For 90314/90338 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17289 event pairs, 544 based on Foata normal form. 21/3544 useless extension candidates. Maximal degree in co-relation 21133. Up to 3475 conditions per place. [2024-06-27 20:36:46,126 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 159 selfloop transitions, 19 changer transitions 0/181 dead transitions. [2024-06-27 20:36:46,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 181 transitions, 2193 flow [2024-06-27 20:36:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 20:36:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 20:36:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2024-06-27 20:36:46,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-27 20:36:46,127 INFO L175 Difference]: Start difference. First operand has 139 places, 170 transitions, 1799 flow. Second operand 6 states and 90 transitions. [2024-06-27 20:36:46,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 181 transitions, 2193 flow [2024-06-27 20:36:46,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 181 transitions, 2026 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-27 20:36:46,202 INFO L231 Difference]: Finished difference. Result has 139 places, 170 transitions, 1676 flow [2024-06-27 20:36:46,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1676, PETRI_PLACES=139, PETRI_TRANSITIONS=170} [2024-06-27 20:36:46,203 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places. [2024-06-27 20:36:46,203 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 170 transitions, 1676 flow [2024-06-27 20:36:46,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:46,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:46,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:46,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 20:36:46,204 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:46,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1700747563, now seen corresponding path program 1 times [2024-06-27 20:36:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302022601] [2024-06-27 20:36:46,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:46,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:46,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302022601] [2024-06-27 20:36:46,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302022601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:46,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:46,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 20:36:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065758326] [2024-06-27 20:36:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:46,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 20:36:46,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 20:36:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 20:36:46,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:46,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 170 transitions, 1676 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:46,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:46,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:46,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:47,130 INFO L124 PetriNetUnfolderBase]: 2167/3378 cut-off events. [2024-06-27 20:36:47,130 INFO L125 PetriNetUnfolderBase]: For 80714/80714 co-relation queries the response was YES. [2024-06-27 20:36:47,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19505 conditions, 3378 events. 2167/3378 cut-off events. For 80714/80714 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17272 event pairs, 487 based on Foata normal form. 2/3367 useless extension candidates. Maximal degree in co-relation 19444. Up to 3246 conditions per place. [2024-06-27 20:36:47,154 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 169 selfloop transitions, 18 changer transitions 0/194 dead transitions. [2024-06-27 20:36:47,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 194 transitions, 2210 flow [2024-06-27 20:36:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 20:36:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 20:36:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-27 20:36:47,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2024-06-27 20:36:47,156 INFO L175 Difference]: Start difference. First operand has 139 places, 170 transitions, 1676 flow. Second operand 6 states and 101 transitions. [2024-06-27 20:36:47,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 194 transitions, 2210 flow [2024-06-27 20:36:47,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 194 transitions, 2170 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 20:36:47,237 INFO L231 Difference]: Finished difference. Result has 142 places, 179 transitions, 1760 flow [2024-06-27 20:36:47,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1760, PETRI_PLACES=142, PETRI_TRANSITIONS=179} [2024-06-27 20:36:47,237 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 101 predicate places. [2024-06-27 20:36:47,237 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 179 transitions, 1760 flow [2024-06-27 20:36:47,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:47,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:47,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:47,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 20:36:47,238 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:47,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:47,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1903290053, now seen corresponding path program 2 times [2024-06-27 20:36:47,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:47,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169681877] [2024-06-27 20:36:47,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:47,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169681877] [2024-06-27 20:36:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169681877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:47,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:47,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 20:36:47,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521375498] [2024-06-27 20:36:47,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:47,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 20:36:47,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:47,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 20:36:47,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 20:36:47,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:36:47,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 179 transitions, 1760 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:47,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:47,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:36:47,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:48,175 INFO L124 PetriNetUnfolderBase]: 2161/3371 cut-off events. [2024-06-27 20:36:48,175 INFO L125 PetriNetUnfolderBase]: For 84820/84820 co-relation queries the response was YES. [2024-06-27 20:36:48,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20027 conditions, 3371 events. 2161/3371 cut-off events. For 84820/84820 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17246 event pairs, 485 based on Foata normal form. 2/3363 useless extension candidates. Maximal degree in co-relation 19964. Up to 3256 conditions per place. [2024-06-27 20:36:48,201 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 169 selfloop transitions, 13 changer transitions 0/189 dead transitions. [2024-06-27 20:36:48,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 189 transitions, 2154 flow [2024-06-27 20:36:48,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 20:36:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 20:36:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-06-27 20:36:48,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2024-06-27 20:36:48,202 INFO L175 Difference]: Start difference. First operand has 142 places, 179 transitions, 1760 flow. Second operand 6 states and 94 transitions. [2024-06-27 20:36:48,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 189 transitions, 2154 flow [2024-06-27 20:36:48,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 189 transitions, 2114 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-06-27 20:36:48,293 INFO L231 Difference]: Finished difference. Result has 147 places, 179 transitions, 1753 flow [2024-06-27 20:36:48,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1720, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1753, PETRI_PLACES=147, PETRI_TRANSITIONS=179} [2024-06-27 20:36:48,294 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 106 predicate places. [2024-06-27 20:36:48,294 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 179 transitions, 1753 flow [2024-06-27 20:36:48,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:48,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:48,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:48,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 20:36:48,295 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:48,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1874062779, now seen corresponding path program 1 times [2024-06-27 20:36:48,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:48,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426390429] [2024-06-27 20:36:48,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:48,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:48,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426390429] [2024-06-27 20:36:48,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426390429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:48,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:48,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:36:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910123603] [2024-06-27 20:36:48,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:48,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:36:48,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:48,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:36:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:36:48,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:48,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 179 transitions, 1753 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:48,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:48,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:48,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:49,442 INFO L124 PetriNetUnfolderBase]: 2344/3558 cut-off events. [2024-06-27 20:36:49,442 INFO L125 PetriNetUnfolderBase]: For 104408/104416 co-relation queries the response was YES. [2024-06-27 20:36:49,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21801 conditions, 3558 events. 2344/3558 cut-off events. For 104408/104416 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17455 event pairs, 536 based on Foata normal form. 10/3567 useless extension candidates. Maximal degree in co-relation 21735. Up to 3414 conditions per place. [2024-06-27 20:36:49,468 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 169 selfloop transitions, 38 changer transitions 0/210 dead transitions. [2024-06-27 20:36:49,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 210 transitions, 2361 flow [2024-06-27 20:36:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:36:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:36:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-27 20:36:49,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2024-06-27 20:36:49,470 INFO L175 Difference]: Start difference. First operand has 147 places, 179 transitions, 1753 flow. Second operand 7 states and 117 transitions. [2024-06-27 20:36:49,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 210 transitions, 2361 flow [2024-06-27 20:36:49,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 210 transitions, 2321 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 20:36:49,568 INFO L231 Difference]: Finished difference. Result has 148 places, 185 transitions, 1858 flow [2024-06-27 20:36:49,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1713, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1858, PETRI_PLACES=148, PETRI_TRANSITIONS=185} [2024-06-27 20:36:49,569 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 107 predicate places. [2024-06-27 20:36:49,569 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 185 transitions, 1858 flow [2024-06-27 20:36:49,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:49,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:49,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:49,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 20:36:49,570 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:49,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1988447608, now seen corresponding path program 1 times [2024-06-27 20:36:49,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:49,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571461586] [2024-06-27 20:36:49,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:49,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:50,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:50,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571461586] [2024-06-27 20:36:50,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571461586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:50,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:50,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121484668] [2024-06-27 20:36:50,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:50,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:50,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:50,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:50,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:50,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 185 transitions, 1858 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:50,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:50,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:50,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:51,053 INFO L124 PetriNetUnfolderBase]: 2497/3815 cut-off events. [2024-06-27 20:36:51,053 INFO L125 PetriNetUnfolderBase]: For 126579/126585 co-relation queries the response was YES. [2024-06-27 20:36:51,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24050 conditions, 3815 events. 2497/3815 cut-off events. For 126579/126585 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19185 event pairs, 556 based on Foata normal form. 22/3836 useless extension candidates. Maximal degree in co-relation 23985. Up to 2998 conditions per place. [2024-06-27 20:36:51,081 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 175 selfloop transitions, 55 changer transitions 0/233 dead transitions. [2024-06-27 20:36:51,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 233 transitions, 2678 flow [2024-06-27 20:36:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:36:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:36:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-27 20:36:51,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-27 20:36:51,082 INFO L175 Difference]: Start difference. First operand has 148 places, 185 transitions, 1858 flow. Second operand 9 states and 156 transitions. [2024-06-27 20:36:51,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 233 transitions, 2678 flow [2024-06-27 20:36:51,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 233 transitions, 2634 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:51,179 INFO L231 Difference]: Finished difference. Result has 155 places, 189 transitions, 2046 flow [2024-06-27 20:36:51,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1814, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2046, PETRI_PLACES=155, PETRI_TRANSITIONS=189} [2024-06-27 20:36:51,179 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 114 predicate places. [2024-06-27 20:36:51,179 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 189 transitions, 2046 flow [2024-06-27 20:36:51,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:51,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:51,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:51,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 20:36:51,180 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:51,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:51,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1016034919, now seen corresponding path program 1 times [2024-06-27 20:36:51,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:51,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635400602] [2024-06-27 20:36:51,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:51,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:51,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635400602] [2024-06-27 20:36:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635400602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:51,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:51,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:36:51,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996790109] [2024-06-27 20:36:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:51,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:36:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:51,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:36:51,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:36:51,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:51,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 189 transitions, 2046 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:51,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:51,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:51,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:52,440 INFO L124 PetriNetUnfolderBase]: 2507/3827 cut-off events. [2024-06-27 20:36:52,440 INFO L125 PetriNetUnfolderBase]: For 129167/129175 co-relation queries the response was YES. [2024-06-27 20:36:52,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24761 conditions, 3827 events. 2507/3827 cut-off events. For 129167/129175 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19330 event pairs, 596 based on Foata normal form. 10/3836 useless extension candidates. Maximal degree in co-relation 24693. Up to 3753 conditions per place. [2024-06-27 20:36:52,470 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 184 selfloop transitions, 28 changer transitions 0/215 dead transitions. [2024-06-27 20:36:52,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 215 transitions, 2688 flow [2024-06-27 20:36:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:36:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:36:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-27 20:36:52,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2024-06-27 20:36:52,472 INFO L175 Difference]: Start difference. First operand has 155 places, 189 transitions, 2046 flow. Second operand 7 states and 113 transitions. [2024-06-27 20:36:52,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 215 transitions, 2688 flow [2024-06-27 20:36:52,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 215 transitions, 2613 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 20:36:52,578 INFO L231 Difference]: Finished difference. Result has 158 places, 195 transitions, 2127 flow [2024-06-27 20:36:52,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1971, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2127, PETRI_PLACES=158, PETRI_TRANSITIONS=195} [2024-06-27 20:36:52,578 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 117 predicate places. [2024-06-27 20:36:52,578 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 195 transitions, 2127 flow [2024-06-27 20:36:52,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:52,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:52,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:52,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 20:36:52,579 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:52,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:52,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2078616157, now seen corresponding path program 2 times [2024-06-27 20:36:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:52,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920186137] [2024-06-27 20:36:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:52,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:53,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:53,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920186137] [2024-06-27 20:36:53,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920186137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:53,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:53,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:36:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171334763] [2024-06-27 20:36:53,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:53,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:36:53,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:36:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:36:53,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:53,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 195 transitions, 2127 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:53,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:53,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:53,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:53,854 INFO L124 PetriNetUnfolderBase]: 2517/3843 cut-off events. [2024-06-27 20:36:53,854 INFO L125 PetriNetUnfolderBase]: For 133506/133512 co-relation queries the response was YES. [2024-06-27 20:36:53,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25066 conditions, 3843 events. 2517/3843 cut-off events. For 133506/133512 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19401 event pairs, 602 based on Foata normal form. 8/3850 useless extension candidates. Maximal degree in co-relation 24996. Up to 3693 conditions per place. [2024-06-27 20:36:53,883 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 174 selfloop transitions, 40 changer transitions 0/217 dead transitions. [2024-06-27 20:36:53,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 217 transitions, 2707 flow [2024-06-27 20:36:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:36:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:36:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-27 20:36:53,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2024-06-27 20:36:53,884 INFO L175 Difference]: Start difference. First operand has 158 places, 195 transitions, 2127 flow. Second operand 7 states and 113 transitions. [2024-06-27 20:36:53,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 217 transitions, 2707 flow [2024-06-27 20:36:53,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 217 transitions, 2646 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-06-27 20:36:53,997 INFO L231 Difference]: Finished difference. Result has 162 places, 198 transitions, 2180 flow [2024-06-27 20:36:53,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2180, PETRI_PLACES=162, PETRI_TRANSITIONS=198} [2024-06-27 20:36:53,998 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 121 predicate places. [2024-06-27 20:36:53,998 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 198 transitions, 2180 flow [2024-06-27 20:36:53,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:53,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:53,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:53,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 20:36:53,998 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:53,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash 238367848, now seen corresponding path program 2 times [2024-06-27 20:36:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:53,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940641887] [2024-06-27 20:36:53,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:54,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-27 20:36:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940641887] [2024-06-27 20:36:54,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940641887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:54,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:54,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 20:36:54,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839543710] [2024-06-27 20:36:54,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:54,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 20:36:54,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:54,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 20:36:54,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 20:36:55,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:55,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 198 transitions, 2180 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:55,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:55,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:55,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:55,770 INFO L124 PetriNetUnfolderBase]: 2653/4063 cut-off events. [2024-06-27 20:36:55,771 INFO L125 PetriNetUnfolderBase]: For 152685/152701 co-relation queries the response was YES. [2024-06-27 20:36:55,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26463 conditions, 4063 events. 2653/4063 cut-off events. For 152685/152701 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 20875 event pairs, 602 based on Foata normal form. 30/4088 useless extension candidates. Maximal degree in co-relation 26391. Up to 3520 conditions per place. [2024-06-27 20:36:55,797 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 172 selfloop transitions, 72 changer transitions 0/247 dead transitions. [2024-06-27 20:36:55,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 247 transitions, 2916 flow [2024-06-27 20:36:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:36:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:36:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-27 20:36:55,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175 [2024-06-27 20:36:55,800 INFO L175 Difference]: Start difference. First operand has 162 places, 198 transitions, 2180 flow. Second operand 10 states and 167 transitions. [2024-06-27 20:36:55,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 247 transitions, 2916 flow [2024-06-27 20:36:55,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 247 transitions, 2850 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 20:36:55,917 INFO L231 Difference]: Finished difference. Result has 169 places, 207 transitions, 2398 flow [2024-06-27 20:36:55,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2398, PETRI_PLACES=169, PETRI_TRANSITIONS=207} [2024-06-27 20:36:55,920 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places. [2024-06-27 20:36:55,921 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 207 transitions, 2398 flow [2024-06-27 20:36:55,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:55,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:55,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:55,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 20:36:55,921 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:55,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash 243730228, now seen corresponding path program 3 times [2024-06-27 20:36:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:55,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529246775] [2024-06-27 20:36:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:56,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:56,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529246775] [2024-06-27 20:36:56,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529246775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:56,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:56,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 20:36:56,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638806209] [2024-06-27 20:36:56,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:56,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 20:36:56,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:56,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 20:36:56,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 20:36:56,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:56,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 207 transitions, 2398 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:56,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:56,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:56,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:57,791 INFO L124 PetriNetUnfolderBase]: 2745/4215 cut-off events. [2024-06-27 20:36:57,791 INFO L125 PetriNetUnfolderBase]: For 166538/166554 co-relation queries the response was YES. [2024-06-27 20:36:57,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27887 conditions, 4215 events. 2745/4215 cut-off events. For 166538/166554 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 21949 event pairs, 626 based on Foata normal form. 30/4240 useless extension candidates. Maximal degree in co-relation 27813. Up to 3672 conditions per place. [2024-06-27 20:36:57,826 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 177 selfloop transitions, 71 changer transitions 0/251 dead transitions. [2024-06-27 20:36:57,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 251 transitions, 3098 flow [2024-06-27 20:36:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:36:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:36:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 20:36:57,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4225 [2024-06-27 20:36:57,827 INFO L175 Difference]: Start difference. First operand has 169 places, 207 transitions, 2398 flow. Second operand 10 states and 169 transitions. [2024-06-27 20:36:57,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 251 transitions, 3098 flow [2024-06-27 20:36:57,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 251 transitions, 2944 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 20:36:57,980 INFO L231 Difference]: Finished difference. Result has 174 places, 210 transitions, 2468 flow [2024-06-27 20:36:57,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2468, PETRI_PLACES=174, PETRI_TRANSITIONS=210} [2024-06-27 20:36:57,980 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 133 predicate places. [2024-06-27 20:36:57,981 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 210 transitions, 2468 flow [2024-06-27 20:36:57,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:57,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:57,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:57,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 20:36:57,981 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-27 20:36:57,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash -280787220, now seen corresponding path program 4 times [2024-06-27 20:36:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238108172] [2024-06-27 20:36:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:36:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:36:58,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:36:58,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238108172] [2024-06-27 20:36:58,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238108172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:36:58,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:36:58,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:36:58,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460545113] [2024-06-27 20:36:58,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:36:58,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:36:58,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:36:58,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:36:58,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:36:58,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:36:58,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 210 transitions, 2468 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:58,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:36:58,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:36:58,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:36:59,410 INFO L124 PetriNetUnfolderBase]: 2939/4541 cut-off events. [2024-06-27 20:36:59,411 INFO L125 PetriNetUnfolderBase]: For 182350/182366 co-relation queries the response was YES. [2024-06-27 20:36:59,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30066 conditions, 4541 events. 2939/4541 cut-off events. For 182350/182366 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 24244 event pairs, 650 based on Foata normal form. 26/4562 useless extension candidates. Maximal degree in co-relation 29991. Up to 3346 conditions per place. [2024-06-27 20:36:59,448 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 158 selfloop transitions, 93 changer transitions 0/254 dead transitions. [2024-06-27 20:36:59,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 254 transitions, 3346 flow [2024-06-27 20:36:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:36:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:36:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 20:36:59,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2024-06-27 20:36:59,452 INFO L175 Difference]: Start difference. First operand has 174 places, 210 transitions, 2468 flow. Second operand 9 states and 161 transitions. [2024-06-27 20:36:59,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 254 transitions, 3346 flow [2024-06-27 20:36:59,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 254 transitions, 3146 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-27 20:36:59,623 INFO L231 Difference]: Finished difference. Result has 175 places, 213 transitions, 2589 flow [2024-06-27 20:36:59,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2589, PETRI_PLACES=175, PETRI_TRANSITIONS=213} [2024-06-27 20:36:59,624 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places. [2024-06-27 20:36:59,624 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 213 transitions, 2589 flow [2024-06-27 20:36:59,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:36:59,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:36:59,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:36:59,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 20:36:59,625 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:36:59,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:36:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1540088882, now seen corresponding path program 5 times [2024-06-27 20:36:59,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:36:59,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173676307] [2024-06-27 20:36:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:36:59,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:36:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:00,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:00,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173676307] [2024-06-27 20:37:00,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173676307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:00,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:00,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:37:00,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997214607] [2024-06-27 20:37:00,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:00,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:37:00,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:00,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:37:00,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:37:00,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:00,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 213 transitions, 2589 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:00,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:00,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:00,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:00,989 INFO L124 PetriNetUnfolderBase]: 3075/4769 cut-off events. [2024-06-27 20:37:00,989 INFO L125 PetriNetUnfolderBase]: For 202570/202586 co-relation queries the response was YES. [2024-06-27 20:37:01,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32049 conditions, 4769 events. 3075/4769 cut-off events. For 202570/202586 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 25864 event pairs, 624 based on Foata normal form. 26/4790 useless extension candidates. Maximal degree in co-relation 31973. Up to 2603 conditions per place. [2024-06-27 20:37:01,030 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 151 selfloop transitions, 106 changer transitions 0/260 dead transitions. [2024-06-27 20:37:01,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 260 transitions, 3507 flow [2024-06-27 20:37:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:37:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:37:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-27 20:37:01,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4361111111111111 [2024-06-27 20:37:01,031 INFO L175 Difference]: Start difference. First operand has 175 places, 213 transitions, 2589 flow. Second operand 9 states and 157 transitions. [2024-06-27 20:37:01,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 260 transitions, 3507 flow [2024-06-27 20:37:01,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 260 transitions, 3345 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 20:37:01,313 INFO L231 Difference]: Finished difference. Result has 180 places, 216 transitions, 2806 flow [2024-06-27 20:37:01,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2427, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2806, PETRI_PLACES=180, PETRI_TRANSITIONS=216} [2024-06-27 20:37:01,313 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 139 predicate places. [2024-06-27 20:37:01,313 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 216 transitions, 2806 flow [2024-06-27 20:37:01,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:01,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:01,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:01,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 20:37:01,314 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:01,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1549285652, now seen corresponding path program 6 times [2024-06-27 20:37:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632871165] [2024-06-27 20:37:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:01,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:01,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632871165] [2024-06-27 20:37:01,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632871165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:01,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:01,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:37:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495430108] [2024-06-27 20:37:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:01,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:37:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:37:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:37:02,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:02,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 216 transitions, 2806 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:02,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:02,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:02,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:02,808 INFO L124 PetriNetUnfolderBase]: 3133/4867 cut-off events. [2024-06-27 20:37:02,808 INFO L125 PetriNetUnfolderBase]: For 214068/214084 co-relation queries the response was YES. [2024-06-27 20:37:02,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33514 conditions, 4867 events. 3133/4867 cut-off events. For 214068/214084 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 26746 event pairs, 695 based on Foata normal form. 26/4888 useless extension candidates. Maximal degree in co-relation 33435. Up to 3859 conditions per place. [2024-06-27 20:37:02,844 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 165 selfloop transitions, 91 changer transitions 0/259 dead transitions. [2024-06-27 20:37:02,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 259 transitions, 3655 flow [2024-06-27 20:37:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:37:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:37:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 20:37:02,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-27 20:37:02,846 INFO L175 Difference]: Start difference. First operand has 180 places, 216 transitions, 2806 flow. Second operand 9 states and 159 transitions. [2024-06-27 20:37:02,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 259 transitions, 3655 flow [2024-06-27 20:37:03,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 259 transitions, 3507 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-27 20:37:03,073 INFO L231 Difference]: Finished difference. Result has 184 places, 217 transitions, 2897 flow [2024-06-27 20:37:03,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2658, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2897, PETRI_PLACES=184, PETRI_TRANSITIONS=217} [2024-06-27 20:37:03,083 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 143 predicate places. [2024-06-27 20:37:03,083 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 217 transitions, 2897 flow [2024-06-27 20:37:03,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:03,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:03,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:03,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 20:37:03,083 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:03,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:03,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1805995412, now seen corresponding path program 7 times [2024-06-27 20:37:03,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:03,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707656225] [2024-06-27 20:37:03,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:03,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707656225] [2024-06-27 20:37:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707656225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:04,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:04,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 20:37:04,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412302017] [2024-06-27 20:37:04,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:04,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 20:37:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:04,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 20:37:04,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 20:37:04,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:04,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 217 transitions, 2897 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:04,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:04,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:04,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:04,886 INFO L124 PetriNetUnfolderBase]: 3158/4914 cut-off events. [2024-06-27 20:37:04,887 INFO L125 PetriNetUnfolderBase]: For 219868/219884 co-relation queries the response was YES. [2024-06-27 20:37:04,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33821 conditions, 4914 events. 3158/4914 cut-off events. For 219868/219884 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 27167 event pairs, 741 based on Foata normal form. 30/4939 useless extension candidates. Maximal degree in co-relation 33740. Up to 4371 conditions per place. [2024-06-27 20:37:04,931 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 184 selfloop transitions, 73 changer transitions 0/260 dead transitions. [2024-06-27 20:37:04,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 260 transitions, 3631 flow [2024-06-27 20:37:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:37:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:37:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 20:37:04,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415 [2024-06-27 20:37:04,933 INFO L175 Difference]: Start difference. First operand has 184 places, 217 transitions, 2897 flow. Second operand 10 states and 166 transitions. [2024-06-27 20:37:04,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 260 transitions, 3631 flow [2024-06-27 20:37:05,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 260 transitions, 3242 flow, removed 26 selfloop flow, removed 10 redundant places. [2024-06-27 20:37:05,227 INFO L231 Difference]: Finished difference. Result has 184 places, 220 transitions, 2756 flow [2024-06-27 20:37:05,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2518, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2756, PETRI_PLACES=184, PETRI_TRANSITIONS=220} [2024-06-27 20:37:05,228 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 143 predicate places. [2024-06-27 20:37:05,228 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 220 transitions, 2756 flow [2024-06-27 20:37:05,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:05,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:05,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:05,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 20:37:05,229 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:05,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1865060957, now seen corresponding path program 2 times [2024-06-27 20:37:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660280632] [2024-06-27 20:37:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:05,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660280632] [2024-06-27 20:37:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660280632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:05,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:05,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:37:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230547847] [2024-06-27 20:37:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:05,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:37:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:05,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:37:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:37:05,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:05,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 220 transitions, 2756 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:05,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:05,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:05,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:06,655 INFO L124 PetriNetUnfolderBase]: 3168/4924 cut-off events. [2024-06-27 20:37:06,655 INFO L125 PetriNetUnfolderBase]: For 208393/208414 co-relation queries the response was YES. [2024-06-27 20:37:06,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32948 conditions, 4924 events. 3168/4924 cut-off events. For 208393/208414 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 27238 event pairs, 788 based on Foata normal form. 20/4941 useless extension candidates. Maximal degree in co-relation 32869. Up to 4844 conditions per place. [2024-06-27 20:37:06,700 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 205 selfloop transitions, 31 changer transitions 0/239 dead transitions. [2024-06-27 20:37:06,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 239 transitions, 3406 flow [2024-06-27 20:37:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:37:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:37:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2024-06-27 20:37:06,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821428571428571 [2024-06-27 20:37:06,702 INFO L175 Difference]: Start difference. First operand has 184 places, 220 transitions, 2756 flow. Second operand 7 states and 107 transitions. [2024-06-27 20:37:06,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 239 transitions, 3406 flow [2024-06-27 20:37:06,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 239 transitions, 3230 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-27 20:37:06,983 INFO L231 Difference]: Finished difference. Result has 184 places, 223 transitions, 2692 flow [2024-06-27 20:37:06,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2692, PETRI_PLACES=184, PETRI_TRANSITIONS=223} [2024-06-27 20:37:06,984 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 143 predicate places. [2024-06-27 20:37:06,984 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 223 transitions, 2692 flow [2024-06-27 20:37:06,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:06,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:06,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:06,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 20:37:06,985 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:06,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1862088099, now seen corresponding path program 3 times [2024-06-27 20:37:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:06,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213033555] [2024-06-27 20:37:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:07,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:07,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213033555] [2024-06-27 20:37:07,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213033555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:07,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:07,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:37:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20458299] [2024-06-27 20:37:07,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:07,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:37:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:37:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:37:07,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:07,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 223 transitions, 2692 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:07,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:07,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:07,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:08,352 INFO L124 PetriNetUnfolderBase]: 3162/4920 cut-off events. [2024-06-27 20:37:08,352 INFO L125 PetriNetUnfolderBase]: For 210579/210595 co-relation queries the response was YES. [2024-06-27 20:37:08,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32444 conditions, 4920 events. 3162/4920 cut-off events. For 210579/210595 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 27214 event pairs, 805 based on Foata normal form. 12/4927 useless extension candidates. Maximal degree in co-relation 32364. Up to 4769 conditions per place. [2024-06-27 20:37:08,398 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 192 selfloop transitions, 40 changer transitions 0/235 dead transitions. [2024-06-27 20:37:08,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 235 transitions, 3192 flow [2024-06-27 20:37:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:37:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:37:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2024-06-27 20:37:08,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2024-06-27 20:37:08,399 INFO L175 Difference]: Start difference. First operand has 184 places, 223 transitions, 2692 flow. Second operand 7 states and 106 transitions. [2024-06-27 20:37:08,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 235 transitions, 3192 flow [2024-06-27 20:37:08,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 235 transitions, 3083 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 20:37:08,609 INFO L231 Difference]: Finished difference. Result has 186 places, 223 transitions, 2669 flow [2024-06-27 20:37:08,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2583, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2669, PETRI_PLACES=186, PETRI_TRANSITIONS=223} [2024-06-27 20:37:08,610 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 145 predicate places. [2024-06-27 20:37:08,611 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 223 transitions, 2669 flow [2024-06-27 20:37:08,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:08,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:08,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:08,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 20:37:08,611 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:08,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1865048867, now seen corresponding path program 3 times [2024-06-27 20:37:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:08,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259100592] [2024-06-27 20:37:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:09,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:09,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259100592] [2024-06-27 20:37:09,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259100592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:09,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:09,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:37:09,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173898587] [2024-06-27 20:37:09,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:09,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:37:09,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:37:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:37:09,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:09,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 223 transitions, 2669 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:09,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:09,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:09,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:10,005 INFO L124 PetriNetUnfolderBase]: 3156/4910 cut-off events. [2024-06-27 20:37:10,006 INFO L125 PetriNetUnfolderBase]: For 215802/215802 co-relation queries the response was YES. [2024-06-27 20:37:10,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32461 conditions, 4910 events. 3156/4910 cut-off events. For 215802/215802 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 27178 event pairs, 809 based on Foata normal form. 2/4911 useless extension candidates. Maximal degree in co-relation 32380. Up to 4871 conditions per place. [2024-06-27 20:37:10,052 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 215 selfloop transitions, 16 changer transitions 0/234 dead transitions. [2024-06-27 20:37:10,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 234 transitions, 3163 flow [2024-06-27 20:37:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:37:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:37:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-27 20:37:10,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3607142857142857 [2024-06-27 20:37:10,054 INFO L175 Difference]: Start difference. First operand has 186 places, 223 transitions, 2669 flow. Second operand 7 states and 101 transitions. [2024-06-27 20:37:10,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 234 transitions, 3163 flow [2024-06-27 20:37:10,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 234 transitions, 3004 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 20:37:10,378 INFO L231 Difference]: Finished difference. Result has 186 places, 223 transitions, 2549 flow [2024-06-27 20:37:10,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2549, PETRI_PLACES=186, PETRI_TRANSITIONS=223} [2024-06-27 20:37:10,378 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 145 predicate places. [2024-06-27 20:37:10,378 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 223 transitions, 2549 flow [2024-06-27 20:37:10,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:10,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:10,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:10,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 20:37:10,379 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:10,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1344903401, now seen corresponding path program 1 times [2024-06-27 20:37:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126592210] [2024-06-27 20:37:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126592210] [2024-06-27 20:37:10,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126592210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:10,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:10,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:37:10,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687520661] [2024-06-27 20:37:10,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:10,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:37:10,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:10,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:37:10,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:37:11,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:37:11,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 223 transitions, 2549 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:11,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:11,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:37:11,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:11,785 INFO L124 PetriNetUnfolderBase]: 2996/4745 cut-off events. [2024-06-27 20:37:11,785 INFO L125 PetriNetUnfolderBase]: For 192785/192789 co-relation queries the response was YES. [2024-06-27 20:37:11,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30496 conditions, 4745 events. 2996/4745 cut-off events. For 192785/192789 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26977 event pairs, 733 based on Foata normal form. 2/4732 useless extension candidates. Maximal degree in co-relation 30414. Up to 4613 conditions per place. [2024-06-27 20:37:11,822 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 219 selfloop transitions, 14 changer transitions 0/243 dead transitions. [2024-06-27 20:37:11,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 243 transitions, 3113 flow [2024-06-27 20:37:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:37:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:37:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-27 20:37:11,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-27 20:37:11,824 INFO L175 Difference]: Start difference. First operand has 186 places, 223 transitions, 2549 flow. Second operand 7 states and 112 transitions. [2024-06-27 20:37:11,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 243 transitions, 3113 flow [2024-06-27 20:37:12,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 243 transitions, 3048 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-27 20:37:12,070 INFO L231 Difference]: Finished difference. Result has 185 places, 226 transitions, 2570 flow [2024-06-27 20:37:12,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2484, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2570, PETRI_PLACES=185, PETRI_TRANSITIONS=226} [2024-06-27 20:37:12,070 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2024-06-27 20:37:12,070 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 226 transitions, 2570 flow [2024-06-27 20:37:12,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:12,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:12,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:12,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 20:37:12,071 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:12,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1183565781, now seen corresponding path program 2 times [2024-06-27 20:37:12,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:12,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404711290] [2024-06-27 20:37:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:12,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:12,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:12,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404711290] [2024-06-27 20:37:12,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404711290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:12,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:12,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:37:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128567659] [2024-06-27 20:37:12,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:12,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:37:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:12,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:37:12,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:37:12,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:37:12,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 226 transitions, 2570 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:12,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:12,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:37:12,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:13,428 INFO L124 PetriNetUnfolderBase]: 3014/4769 cut-off events. [2024-06-27 20:37:13,429 INFO L125 PetriNetUnfolderBase]: For 199281/199285 co-relation queries the response was YES. [2024-06-27 20:37:13,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31121 conditions, 4769 events. 3014/4769 cut-off events. For 199281/199285 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 27116 event pairs, 735 based on Foata normal form. 2/4755 useless extension candidates. Maximal degree in co-relation 31040. Up to 4602 conditions per place. [2024-06-27 20:37:13,473 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 211 selfloop transitions, 28 changer transitions 0/249 dead transitions. [2024-06-27 20:37:13,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 249 transitions, 3292 flow [2024-06-27 20:37:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:37:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:37:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-27 20:37:13,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-27 20:37:13,474 INFO L175 Difference]: Start difference. First operand has 185 places, 226 transitions, 2570 flow. Second operand 7 states and 116 transitions. [2024-06-27 20:37:13,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 249 transitions, 3292 flow [2024-06-27 20:37:13,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 249 transitions, 3228 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 20:37:13,759 INFO L231 Difference]: Finished difference. Result has 187 places, 232 transitions, 2678 flow [2024-06-27 20:37:13,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2506, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2678, PETRI_PLACES=187, PETRI_TRANSITIONS=232} [2024-06-27 20:37:13,759 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 146 predicate places. [2024-06-27 20:37:13,759 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 232 transitions, 2678 flow [2024-06-27 20:37:13,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:13,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:13,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:13,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 20:37:13,760 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:13,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:13,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1144530251, now seen corresponding path program 3 times [2024-06-27 20:37:13,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:13,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102642807] [2024-06-27 20:37:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:13,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102642807] [2024-06-27 20:37:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102642807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:14,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:14,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:37:14,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498057608] [2024-06-27 20:37:14,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:14,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:37:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:37:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:37:14,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:37:14,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 232 transitions, 2678 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:14,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:14,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:37:14,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:15,176 INFO L124 PetriNetUnfolderBase]: 3008/4762 cut-off events. [2024-06-27 20:37:15,176 INFO L125 PetriNetUnfolderBase]: For 205448/205452 co-relation queries the response was YES. [2024-06-27 20:37:15,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31353 conditions, 4762 events. 3008/4762 cut-off events. For 205448/205452 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 27065 event pairs, 733 based on Foata normal form. 2/4749 useless extension candidates. Maximal degree in co-relation 31271. Up to 4635 conditions per place. [2024-06-27 20:37:15,212 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 218 selfloop transitions, 16 changer transitions 0/244 dead transitions. [2024-06-27 20:37:15,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 244 transitions, 3182 flow [2024-06-27 20:37:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:37:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:37:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2024-06-27 20:37:15,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821428571428571 [2024-06-27 20:37:15,214 INFO L175 Difference]: Start difference. First operand has 187 places, 232 transitions, 2678 flow. Second operand 7 states and 107 transitions. [2024-06-27 20:37:15,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 244 transitions, 3182 flow [2024-06-27 20:37:15,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 244 transitions, 3080 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-06-27 20:37:15,461 INFO L231 Difference]: Finished difference. Result has 191 places, 232 transitions, 2614 flow [2024-06-27 20:37:15,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2576, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2614, PETRI_PLACES=191, PETRI_TRANSITIONS=232} [2024-06-27 20:37:15,461 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 150 predicate places. [2024-06-27 20:37:15,461 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 232 transitions, 2614 flow [2024-06-27 20:37:15,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:15,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:15,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:15,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 20:37:15,465 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:15,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:15,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1861657137, now seen corresponding path program 1 times [2024-06-27 20:37:15,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457711588] [2024-06-27 20:37:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:15,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:16,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:16,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457711588] [2024-06-27 20:37:16,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457711588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:16,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:16,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:37:16,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106436541] [2024-06-27 20:37:16,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:16,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:37:16,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:16,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:37:16,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:37:16,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:16,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 232 transitions, 2614 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:16,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:16,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:16,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:17,248 INFO L124 PetriNetUnfolderBase]: 3180/4944 cut-off events. [2024-06-27 20:37:17,248 INFO L125 PetriNetUnfolderBase]: For 244162/244162 co-relation queries the response was YES. [2024-06-27 20:37:17,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33484 conditions, 4944 events. 3180/4944 cut-off events. For 244162/244162 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 27284 event pairs, 814 based on Foata normal form. 2/4945 useless extension candidates. Maximal degree in co-relation 33400. Up to 4907 conditions per place. [2024-06-27 20:37:17,284 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 227 selfloop transitions, 15 changer transitions 0/245 dead transitions. [2024-06-27 20:37:17,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 245 transitions, 3164 flow [2024-06-27 20:37:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:37:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:37:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2024-06-27 20:37:17,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-27 20:37:17,286 INFO L175 Difference]: Start difference. First operand has 191 places, 232 transitions, 2614 flow. Second operand 7 states and 100 transitions. [2024-06-27 20:37:17,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 245 transitions, 3164 flow [2024-06-27 20:37:17,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 245 transitions, 3115 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 20:37:17,523 INFO L231 Difference]: Finished difference. Result has 192 places, 234 transitions, 2640 flow [2024-06-27 20:37:17,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2565, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2640, PETRI_PLACES=192, PETRI_TRANSITIONS=234} [2024-06-27 20:37:17,524 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 151 predicate places. [2024-06-27 20:37:17,524 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 234 transitions, 2640 flow [2024-06-27 20:37:17,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:17,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:17,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:17,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 20:37:17,525 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:17,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1591420779, now seen corresponding path program 1 times [2024-06-27 20:37:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:17,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766774326] [2024-06-27 20:37:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:18,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766774326] [2024-06-27 20:37:18,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766774326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:18,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:18,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:37:18,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215917375] [2024-06-27 20:37:18,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:18,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:37:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:18,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:37:18,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:37:18,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:18,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 234 transitions, 2640 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:18,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:18,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:18,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:19,369 INFO L124 PetriNetUnfolderBase]: 3221/5013 cut-off events. [2024-06-27 20:37:19,369 INFO L125 PetriNetUnfolderBase]: For 264075/264081 co-relation queries the response was YES. [2024-06-27 20:37:19,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34211 conditions, 5013 events. 3221/5013 cut-off events. For 264075/264081 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 27601 event pairs, 614 based on Foata normal form. 18/5030 useless extension candidates. Maximal degree in co-relation 34126. Up to 4676 conditions per place. [2024-06-27 20:37:19,408 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 234 selfloop transitions, 36 changer transitions 0/273 dead transitions. [2024-06-27 20:37:19,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 273 transitions, 3350 flow [2024-06-27 20:37:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:37:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:37:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-27 20:37:19,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-06-27 20:37:19,410 INFO L175 Difference]: Start difference. First operand has 192 places, 234 transitions, 2640 flow. Second operand 9 states and 143 transitions. [2024-06-27 20:37:19,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 273 transitions, 3350 flow [2024-06-27 20:37:19,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 273 transitions, 3291 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-27 20:37:19,737 INFO L231 Difference]: Finished difference. Result has 197 places, 238 transitions, 2735 flow [2024-06-27 20:37:19,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2581, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2735, PETRI_PLACES=197, PETRI_TRANSITIONS=238} [2024-06-27 20:37:19,738 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places. [2024-06-27 20:37:19,738 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 238 transitions, 2735 flow [2024-06-27 20:37:19,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:19,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:19,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:19,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 20:37:19,739 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:19,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1224732959, now seen corresponding path program 2 times [2024-06-27 20:37:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:19,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148231854] [2024-06-27 20:37:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:20,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148231854] [2024-06-27 20:37:20,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148231854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:20,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:20,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:37:20,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829811899] [2024-06-27 20:37:20,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:20,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:37:20,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:20,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:37:20,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:37:20,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:20,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 238 transitions, 2735 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:20,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:20,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:20,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:21,750 INFO L124 PetriNetUnfolderBase]: 3201/4981 cut-off events. [2024-06-27 20:37:21,751 INFO L125 PetriNetUnfolderBase]: For 263515/263521 co-relation queries the response was YES. [2024-06-27 20:37:21,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33995 conditions, 4981 events. 3201/4981 cut-off events. For 263515/263521 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 27556 event pairs, 734 based on Foata normal form. 18/4998 useless extension candidates. Maximal degree in co-relation 33908. Up to 4605 conditions per place. [2024-06-27 20:37:21,798 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 224 selfloop transitions, 49 changer transitions 0/276 dead transitions. [2024-06-27 20:37:21,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 276 transitions, 3415 flow [2024-06-27 20:37:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:37:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:37:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-27 20:37:21,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-27 20:37:21,799 INFO L175 Difference]: Start difference. First operand has 197 places, 238 transitions, 2735 flow. Second operand 9 states and 147 transitions. [2024-06-27 20:37:21,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 276 transitions, 3415 flow [2024-06-27 20:37:22,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 276 transitions, 3278 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-27 20:37:22,183 INFO L231 Difference]: Finished difference. Result has 201 places, 241 transitions, 2742 flow [2024-06-27 20:37:22,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2598, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2742, PETRI_PLACES=201, PETRI_TRANSITIONS=241} [2024-06-27 20:37:22,183 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 160 predicate places. [2024-06-27 20:37:22,183 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 241 transitions, 2742 flow [2024-06-27 20:37:22,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:22,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:22,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:22,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 20:37:22,184 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-27 20:37:22,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:22,185 INFO L85 PathProgramCache]: Analyzing trace with hash -982521621, now seen corresponding path program 3 times [2024-06-27 20:37:22,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:22,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035132299] [2024-06-27 20:37:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:22,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:23,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:23,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035132299] [2024-06-27 20:37:23,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035132299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:23,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:23,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 20:37:23,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621825328] [2024-06-27 20:37:23,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:23,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 20:37:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:23,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 20:37:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-27 20:37:23,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:23,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 241 transitions, 2742 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:23,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:23,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:23,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:24,649 INFO L124 PetriNetUnfolderBase]: 3394/5282 cut-off events. [2024-06-27 20:37:24,649 INFO L125 PetriNetUnfolderBase]: For 277711/277721 co-relation queries the response was YES. [2024-06-27 20:37:24,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35761 conditions, 5282 events. 3394/5282 cut-off events. For 277711/277721 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 29482 event pairs, 766 based on Foata normal form. 22/5300 useless extension candidates. Maximal degree in co-relation 35672. Up to 4943 conditions per place. [2024-06-27 20:37:24,695 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 254 selfloop transitions, 58 changer transitions 0/315 dead transitions. [2024-06-27 20:37:24,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 315 transitions, 4015 flow [2024-06-27 20:37:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 20:37:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 20:37:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-06-27 20:37:24,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2024-06-27 20:37:24,697 INFO L175 Difference]: Start difference. First operand has 201 places, 241 transitions, 2742 flow. Second operand 11 states and 172 transitions. [2024-06-27 20:37:24,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 315 transitions, 4015 flow [2024-06-27 20:37:25,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 315 transitions, 3858 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 20:37:25,054 INFO L231 Difference]: Finished difference. Result has 212 places, 275 transitions, 3318 flow [2024-06-27 20:37:25,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2634, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3318, PETRI_PLACES=212, PETRI_TRANSITIONS=275} [2024-06-27 20:37:25,055 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 171 predicate places. [2024-06-27 20:37:25,055 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 275 transitions, 3318 flow [2024-06-27 20:37:25,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:25,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:25,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:25,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 20:37:25,056 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-27 20:37:25,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash 197966579, now seen corresponding path program 4 times [2024-06-27 20:37:25,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:25,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803240196] [2024-06-27 20:37:25,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:25,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:26,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803240196] [2024-06-27 20:37:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803240196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:26,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 20:37:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462322339] [2024-06-27 20:37:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:26,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 20:37:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:26,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 20:37:26,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 20:37:26,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:26,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 275 transitions, 3318 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:26,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:26,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:26,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:27,331 INFO L124 PetriNetUnfolderBase]: 3668/5712 cut-off events. [2024-06-27 20:37:27,332 INFO L125 PetriNetUnfolderBase]: For 297547/297555 co-relation queries the response was YES. [2024-06-27 20:37:27,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39025 conditions, 5712 events. 3668/5712 cut-off events. For 297547/297555 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 32517 event pairs, 991 based on Foata normal form. 20/5731 useless extension candidates. Maximal degree in co-relation 38929. Up to 5255 conditions per place. [2024-06-27 20:37:27,384 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 276 selfloop transitions, 84 changer transitions 0/363 dead transitions. [2024-06-27 20:37:27,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 363 transitions, 4855 flow [2024-06-27 20:37:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 20:37:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 20:37:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-06-27 20:37:27,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2024-06-27 20:37:27,386 INFO L175 Difference]: Start difference. First operand has 212 places, 275 transitions, 3318 flow. Second operand 11 states and 178 transitions. [2024-06-27 20:37:27,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 363 transitions, 4855 flow [2024-06-27 20:37:27,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 363 transitions, 4745 flow, removed 54 selfloop flow, removed 1 redundant places. [2024-06-27 20:37:27,855 INFO L231 Difference]: Finished difference. Result has 226 places, 317 transitions, 4198 flow [2024-06-27 20:37:27,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3262, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4198, PETRI_PLACES=226, PETRI_TRANSITIONS=317} [2024-06-27 20:37:27,856 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 185 predicate places. [2024-06-27 20:37:27,856 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 317 transitions, 4198 flow [2024-06-27 20:37:27,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:27,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:27,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:27,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 20:37:27,857 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:27,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:27,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1490785415, now seen corresponding path program 1 times [2024-06-27 20:37:27,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:27,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036621108] [2024-06-27 20:37:27,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:28,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:28,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036621108] [2024-06-27 20:37:28,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036621108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:28,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:28,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:37:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177738674] [2024-06-27 20:37:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:28,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:37:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:37:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:37:28,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:28,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 317 transitions, 4198 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:28,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:28,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:28,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:29,426 INFO L124 PetriNetUnfolderBase]: 3732/5803 cut-off events. [2024-06-27 20:37:29,426 INFO L125 PetriNetUnfolderBase]: For 302229/302243 co-relation queries the response was YES. [2024-06-27 20:37:29,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40490 conditions, 5803 events. 3732/5803 cut-off events. For 302229/302243 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 32992 event pairs, 890 based on Foata normal form. 18/5820 useless extension candidates. Maximal degree in co-relation 40387. Up to 5497 conditions per place. [2024-06-27 20:37:29,490 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 288 selfloop transitions, 89 changer transitions 0/380 dead transitions. [2024-06-27 20:37:29,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 380 transitions, 5627 flow [2024-06-27 20:37:29,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:37:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:37:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 20:37:29,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2024-06-27 20:37:29,491 INFO L175 Difference]: Start difference. First operand has 226 places, 317 transitions, 4198 flow. Second operand 9 states and 154 transitions. [2024-06-27 20:37:29,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 380 transitions, 5627 flow [2024-06-27 20:37:29,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 380 transitions, 5510 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-27 20:37:30,000 INFO L231 Difference]: Finished difference. Result has 234 places, 346 transitions, 4697 flow [2024-06-27 20:37:30,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4090, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4697, PETRI_PLACES=234, PETRI_TRANSITIONS=346} [2024-06-27 20:37:30,001 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 193 predicate places. [2024-06-27 20:37:30,001 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 346 transitions, 4697 flow [2024-06-27 20:37:30,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:30,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:30,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:30,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 20:37:30,002 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:30,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash 321916733, now seen corresponding path program 5 times [2024-06-27 20:37:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899198338] [2024-06-27 20:37:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:31,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:31,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899198338] [2024-06-27 20:37:31,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899198338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:31,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 20:37:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114290081] [2024-06-27 20:37:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:31,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 20:37:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:31,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 20:37:31,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 20:37:31,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:31,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 346 transitions, 4697 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:31,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:31,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:31,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:32,523 INFO L124 PetriNetUnfolderBase]: 3992/6207 cut-off events. [2024-06-27 20:37:32,523 INFO L125 PetriNetUnfolderBase]: For 321676/321680 co-relation queries the response was YES. [2024-06-27 20:37:32,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43909 conditions, 6207 events. 3992/6207 cut-off events. For 321676/321680 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 35640 event pairs, 797 based on Foata normal form. 16/6222 useless extension candidates. Maximal degree in co-relation 43801. Up to 5286 conditions per place. [2024-06-27 20:37:32,595 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 280 selfloop transitions, 139 changer transitions 0/422 dead transitions. [2024-06-27 20:37:32,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 422 transitions, 6208 flow [2024-06-27 20:37:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:37:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:37:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 20:37:32,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2024-06-27 20:37:32,597 INFO L175 Difference]: Start difference. First operand has 234 places, 346 transitions, 4697 flow. Second operand 10 states and 164 transitions. [2024-06-27 20:37:32,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 422 transitions, 6208 flow [2024-06-27 20:37:33,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 422 transitions, 6143 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-27 20:37:33,050 INFO L231 Difference]: Finished difference. Result has 245 places, 379 transitions, 5600 flow [2024-06-27 20:37:33,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4632, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5600, PETRI_PLACES=245, PETRI_TRANSITIONS=379} [2024-06-27 20:37:33,051 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2024-06-27 20:37:33,051 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 379 transitions, 5600 flow [2024-06-27 20:37:33,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:33,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:33,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:33,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 20:37:33,052 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:33,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash -385287186, now seen corresponding path program 1 times [2024-06-27 20:37:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:33,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901079947] [2024-06-27 20:37:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:33,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:33,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:33,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901079947] [2024-06-27 20:37:33,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901079947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:33,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:33,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:37:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97583743] [2024-06-27 20:37:33,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:33,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:37:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:33,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:37:33,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:37:33,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:33,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 379 transitions, 5600 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:33,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:33,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:33,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:34,717 INFO L124 PetriNetUnfolderBase]: 4010/6237 cut-off events. [2024-06-27 20:37:34,718 INFO L125 PetriNetUnfolderBase]: For 328862/328866 co-relation queries the response was YES. [2024-06-27 20:37:34,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45533 conditions, 6237 events. 4010/6237 cut-off events. For 328862/328866 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 36025 event pairs, 1208 based on Foata normal form. 5/6241 useless extension candidates. Maximal degree in co-relation 45420. Up to 6148 conditions per place. [2024-06-27 20:37:34,797 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 374 selfloop transitions, 35 changer transitions 0/412 dead transitions. [2024-06-27 20:37:34,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 412 transitions, 6733 flow [2024-06-27 20:37:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:37:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:37:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-27 20:37:34,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-27 20:37:34,798 INFO L175 Difference]: Start difference. First operand has 245 places, 379 transitions, 5600 flow. Second operand 8 states and 128 transitions. [2024-06-27 20:37:34,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 412 transitions, 6733 flow [2024-06-27 20:37:35,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 412 transitions, 6542 flow, removed 62 selfloop flow, removed 4 redundant places. [2024-06-27 20:37:35,434 INFO L231 Difference]: Finished difference. Result has 250 places, 390 transitions, 5645 flow [2024-06-27 20:37:35,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5415, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5645, PETRI_PLACES=250, PETRI_TRANSITIONS=390} [2024-06-27 20:37:35,434 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places. [2024-06-27 20:37:35,435 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 390 transitions, 5645 flow [2024-06-27 20:37:35,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:35,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:35,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:35,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 20:37:35,435 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:35,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash -361295046, now seen corresponding path program 2 times [2024-06-27 20:37:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:35,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325488668] [2024-06-27 20:37:35,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:35,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:35,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325488668] [2024-06-27 20:37:35,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325488668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:35,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:35,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:37:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052936233] [2024-06-27 20:37:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:35,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:37:35,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:35,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:37:35,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:37:35,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:35,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 390 transitions, 5645 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:35,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:35,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:35,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:37,061 INFO L124 PetriNetUnfolderBase]: 4007/6233 cut-off events. [2024-06-27 20:37:37,061 INFO L125 PetriNetUnfolderBase]: For 321590/321594 co-relation queries the response was YES. [2024-06-27 20:37:37,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45206 conditions, 6233 events. 4007/6233 cut-off events. For 321590/321594 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 35968 event pairs, 1207 based on Foata normal form. 5/6237 useless extension candidates. Maximal degree in co-relation 45090. Up to 6160 conditions per place. [2024-06-27 20:37:37,162 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 374 selfloop transitions, 31 changer transitions 0/408 dead transitions. [2024-06-27 20:37:37,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 408 transitions, 6511 flow [2024-06-27 20:37:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:37:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:37:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-27 20:37:37,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-27 20:37:37,163 INFO L175 Difference]: Start difference. First operand has 250 places, 390 transitions, 5645 flow. Second operand 8 states and 122 transitions. [2024-06-27 20:37:37,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 408 transitions, 6511 flow [2024-06-27 20:37:37,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 408 transitions, 6396 flow, removed 39 selfloop flow, removed 3 redundant places. [2024-06-27 20:37:37,826 INFO L231 Difference]: Finished difference. Result has 255 places, 390 transitions, 5598 flow [2024-06-27 20:37:37,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5530, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5598, PETRI_PLACES=255, PETRI_TRANSITIONS=390} [2024-06-27 20:37:37,827 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 214 predicate places. [2024-06-27 20:37:37,827 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 390 transitions, 5598 flow [2024-06-27 20:37:37,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:37,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:37,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:37,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 20:37:37,828 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:37,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:37,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1086978603, now seen corresponding path program 2 times [2024-06-27 20:37:37,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:37,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834431779] [2024-06-27 20:37:37,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:37,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:38,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:38,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834431779] [2024-06-27 20:37:38,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834431779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:38,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:38,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:37:38,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775082447] [2024-06-27 20:37:38,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:38,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:37:38,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:37:38,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:37:38,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:38,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 390 transitions, 5598 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:38,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:38,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:38,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:39,827 INFO L124 PetriNetUnfolderBase]: 4148/6420 cut-off events. [2024-06-27 20:37:39,827 INFO L125 PetriNetUnfolderBase]: For 346740/346748 co-relation queries the response was YES. [2024-06-27 20:37:39,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46785 conditions, 6420 events. 4148/6420 cut-off events. For 346740/346748 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 36892 event pairs, 874 based on Foata normal form. 12/6431 useless extension candidates. Maximal degree in co-relation 46668. Up to 6022 conditions per place. [2024-06-27 20:37:39,895 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 346 selfloop transitions, 114 changer transitions 0/463 dead transitions. [2024-06-27 20:37:39,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 463 transitions, 7334 flow [2024-06-27 20:37:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:37:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:37:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-27 20:37:39,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2024-06-27 20:37:39,897 INFO L175 Difference]: Start difference. First operand has 255 places, 390 transitions, 5598 flow. Second operand 9 states and 158 transitions. [2024-06-27 20:37:39,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 463 transitions, 7334 flow [2024-06-27 20:37:40,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 463 transitions, 7274 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 20:37:40,494 INFO L231 Difference]: Finished difference. Result has 261 places, 420 transitions, 6138 flow [2024-06-27 20:37:40,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5538, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6138, PETRI_PLACES=261, PETRI_TRANSITIONS=420} [2024-06-27 20:37:40,495 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 220 predicate places. [2024-06-27 20:37:40,495 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 420 transitions, 6138 flow [2024-06-27 20:37:40,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:40,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:40,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:40,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 20:37:40,495 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:40,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash -361835283, now seen corresponding path program 3 times [2024-06-27 20:37:40,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:40,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449098760] [2024-06-27 20:37:40,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:40,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:41,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:41,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449098760] [2024-06-27 20:37:41,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449098760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:41,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:41,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:37:41,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391306708] [2024-06-27 20:37:41,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:41,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:37:41,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:41,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:37:41,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:37:41,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:41,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 420 transitions, 6138 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:41,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:41,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:41,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:42,480 INFO L124 PetriNetUnfolderBase]: 4165/6447 cut-off events. [2024-06-27 20:37:42,480 INFO L125 PetriNetUnfolderBase]: For 359910/359914 co-relation queries the response was YES. [2024-06-27 20:37:42,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47589 conditions, 6447 events. 4165/6447 cut-off events. For 359910/359914 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 37070 event pairs, 872 based on Foata normal form. 9/6455 useless extension candidates. Maximal degree in co-relation 47469. Up to 6036 conditions per place. [2024-06-27 20:37:42,559 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 330 selfloop transitions, 127 changer transitions 0/460 dead transitions. [2024-06-27 20:37:42,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 460 transitions, 7500 flow [2024-06-27 20:37:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:37:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:37:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 20:37:42,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-27 20:37:42,561 INFO L175 Difference]: Start difference. First operand has 261 places, 420 transitions, 6138 flow. Second operand 9 states and 150 transitions. [2024-06-27 20:37:42,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 460 transitions, 7500 flow [2024-06-27 20:37:43,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 460 transitions, 7336 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-27 20:37:43,280 INFO L231 Difference]: Finished difference. Result has 268 places, 426 transitions, 6359 flow [2024-06-27 20:37:43,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5984, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6359, PETRI_PLACES=268, PETRI_TRANSITIONS=426} [2024-06-27 20:37:43,280 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 227 predicate places. [2024-06-27 20:37:43,280 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 426 transitions, 6359 flow [2024-06-27 20:37:43,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:43,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:43,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:43,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 20:37:43,281 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:43,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:43,282 INFO L85 PathProgramCache]: Analyzing trace with hash -385083423, now seen corresponding path program 4 times [2024-06-27 20:37:43,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:43,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906691518] [2024-06-27 20:37:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:43,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:43,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906691518] [2024-06-27 20:37:43,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906691518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:43,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:43,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:37:43,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183688855] [2024-06-27 20:37:43,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:43,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:37:43,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:43,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:37:43,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:37:43,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:43,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 426 transitions, 6359 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:43,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:43,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:43,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:45,216 INFO L124 PetriNetUnfolderBase]: 4153/6431 cut-off events. [2024-06-27 20:37:45,217 INFO L125 PetriNetUnfolderBase]: For 364198/364202 co-relation queries the response was YES. [2024-06-27 20:37:45,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47476 conditions, 6431 events. 4153/6431 cut-off events. For 364198/364202 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 36978 event pairs, 873 based on Foata normal form. 8/6438 useless extension candidates. Maximal degree in co-relation 47354. Up to 6028 conditions per place. [2024-06-27 20:37:45,294 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 336 selfloop transitions, 123 changer transitions 0/462 dead transitions. [2024-06-27 20:37:45,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 462 transitions, 7655 flow [2024-06-27 20:37:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:37:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:37:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-27 20:37:45,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-27 20:37:45,305 INFO L175 Difference]: Start difference. First operand has 268 places, 426 transitions, 6359 flow. Second operand 9 states and 152 transitions. [2024-06-27 20:37:45,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 462 transitions, 7655 flow [2024-06-27 20:37:45,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 462 transitions, 7377 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-27 20:37:45,923 INFO L231 Difference]: Finished difference. Result has 272 places, 426 transitions, 6334 flow [2024-06-27 20:37:45,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6081, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6334, PETRI_PLACES=272, PETRI_TRANSITIONS=426} [2024-06-27 20:37:45,923 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 231 predicate places. [2024-06-27 20:37:45,923 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 426 transitions, 6334 flow [2024-06-27 20:37:45,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:45,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:45,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:45,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 20:37:45,924 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:45,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash 6882440, now seen corresponding path program 3 times [2024-06-27 20:37:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:45,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204339195] [2024-06-27 20:37:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:45,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204339195] [2024-06-27 20:37:46,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204339195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:46,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:37:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932096315] [2024-06-27 20:37:46,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:46,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:37:46,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:46,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:37:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:37:46,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:46,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 426 transitions, 6334 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:46,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:46,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:46,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:47,653 INFO L124 PetriNetUnfolderBase]: 4166/6455 cut-off events. [2024-06-27 20:37:47,653 INFO L125 PetriNetUnfolderBase]: For 371846/371850 co-relation queries the response was YES. [2024-06-27 20:37:47,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47731 conditions, 6455 events. 4166/6455 cut-off events. For 371846/371850 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 37297 event pairs, 1216 based on Foata normal form. 5/6459 useless extension candidates. Maximal degree in co-relation 47608. Up to 6349 conditions per place. [2024-06-27 20:37:47,731 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 405 selfloop transitions, 42 changer transitions 0/450 dead transitions. [2024-06-27 20:37:47,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 450 transitions, 7500 flow [2024-06-27 20:37:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:37:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:37:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-27 20:37:47,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-27 20:37:47,732 INFO L175 Difference]: Start difference. First operand has 272 places, 426 transitions, 6334 flow. Second operand 7 states and 112 transitions. [2024-06-27 20:37:47,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 450 transitions, 7500 flow [2024-06-27 20:37:48,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 450 transitions, 7272 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-27 20:37:48,368 INFO L231 Difference]: Finished difference. Result has 273 places, 432 transitions, 6306 flow [2024-06-27 20:37:48,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6106, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6306, PETRI_PLACES=273, PETRI_TRANSITIONS=432} [2024-06-27 20:37:48,370 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 232 predicate places. [2024-06-27 20:37:48,370 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 432 transitions, 6306 flow [2024-06-27 20:37:48,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:48,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:48,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:48,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 20:37:48,371 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:48,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash 12596360, now seen corresponding path program 4 times [2024-06-27 20:37:48,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:48,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550391108] [2024-06-27 20:37:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:48,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:48,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550391108] [2024-06-27 20:37:48,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550391108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:48,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:48,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:37:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687268124] [2024-06-27 20:37:48,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:48,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:37:48,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:48,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:37:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:37:48,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:48,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 432 transitions, 6306 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:48,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:48,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:48,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:50,119 INFO L124 PetriNetUnfolderBase]: 4171/6462 cut-off events. [2024-06-27 20:37:50,119 INFO L125 PetriNetUnfolderBase]: For 382616/382620 co-relation queries the response was YES. [2024-06-27 20:37:50,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48021 conditions, 6462 events. 4171/6462 cut-off events. For 382616/382620 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 37384 event pairs, 1217 based on Foata normal form. 5/6466 useless extension candidates. Maximal degree in co-relation 47897. Up to 6386 conditions per place. [2024-06-27 20:37:50,190 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 413 selfloop transitions, 33 changer transitions 0/449 dead transitions. [2024-06-27 20:37:50,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 449 transitions, 7298 flow [2024-06-27 20:37:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:37:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:37:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2024-06-27 20:37:50,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821428571428571 [2024-06-27 20:37:50,192 INFO L175 Difference]: Start difference. First operand has 273 places, 432 transitions, 6306 flow. Second operand 7 states and 107 transitions. [2024-06-27 20:37:50,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 449 transitions, 7298 flow [2024-06-27 20:37:50,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 449 transitions, 7180 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-27 20:37:50,891 INFO L231 Difference]: Finished difference. Result has 276 places, 435 transitions, 6326 flow [2024-06-27 20:37:50,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6208, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6326, PETRI_PLACES=276, PETRI_TRANSITIONS=435} [2024-06-27 20:37:50,892 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places. [2024-06-27 20:37:50,892 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 435 transitions, 6326 flow [2024-06-27 20:37:50,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:50,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:50,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:50,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 20:37:50,893 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-27 20:37:50,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash 830589163, now seen corresponding path program 6 times [2024-06-27 20:37:50,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:50,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000961692] [2024-06-27 20:37:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:50,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:52,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-27 20:37:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000961692] [2024-06-27 20:37:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000961692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:52,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:52,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 20:37:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890943879] [2024-06-27 20:37:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:52,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 20:37:52,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:52,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 20:37:52,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-27 20:37:52,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:52,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 435 transitions, 6326 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:52,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:52,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:52,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:53,825 INFO L124 PetriNetUnfolderBase]: 4253/6598 cut-off events. [2024-06-27 20:37:53,825 INFO L125 PetriNetUnfolderBase]: For 395459/395469 co-relation queries the response was YES. [2024-06-27 20:37:53,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48477 conditions, 6598 events. 4253/6598 cut-off events. For 395459/395469 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 38275 event pairs, 863 based on Foata normal form. 22/6619 useless extension candidates. Maximal degree in co-relation 48352. Up to 5800 conditions per place. [2024-06-27 20:37:53,906 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 342 selfloop transitions, 135 changer transitions 0/480 dead transitions. [2024-06-27 20:37:53,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 480 transitions, 7532 flow [2024-06-27 20:37:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:37:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:37:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 20:37:53,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4075 [2024-06-27 20:37:53,907 INFO L175 Difference]: Start difference. First operand has 276 places, 435 transitions, 6326 flow. Second operand 10 states and 163 transitions. [2024-06-27 20:37:53,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 480 transitions, 7532 flow [2024-06-27 20:37:54,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 480 transitions, 7450 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 20:37:54,573 INFO L231 Difference]: Finished difference. Result has 281 places, 440 transitions, 6649 flow [2024-06-27 20:37:54,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6244, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6649, PETRI_PLACES=281, PETRI_TRANSITIONS=440} [2024-06-27 20:37:54,574 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 240 predicate places. [2024-06-27 20:37:54,574 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 440 transitions, 6649 flow [2024-06-27 20:37:54,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:54,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:54,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:54,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 20:37:54,575 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:54,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash 3338303, now seen corresponding path program 5 times [2024-06-27 20:37:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:54,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229527976] [2024-06-27 20:37:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:55,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:55,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229527976] [2024-06-27 20:37:55,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229527976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:55,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:55,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:37:55,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83190762] [2024-06-27 20:37:55,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:55,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:37:55,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:55,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:37:55,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:37:55,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:55,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 440 transitions, 6649 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:55,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:55,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:55,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:56,622 INFO L124 PetriNetUnfolderBase]: 4267/6626 cut-off events. [2024-06-27 20:37:56,622 INFO L125 PetriNetUnfolderBase]: For 394430/394434 co-relation queries the response was YES. [2024-06-27 20:37:56,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49209 conditions, 6626 events. 4267/6626 cut-off events. For 394430/394434 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38692 event pairs, 1216 based on Foata normal form. 10/6635 useless extension candidates. Maximal degree in co-relation 49083. Up to 6206 conditions per place. [2024-06-27 20:37:56,703 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 337 selfloop transitions, 134 changer transitions 0/474 dead transitions. [2024-06-27 20:37:56,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 474 transitions, 7895 flow [2024-06-27 20:37:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:37:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:37:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-27 20:37:56,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-27 20:37:56,705 INFO L175 Difference]: Start difference. First operand has 281 places, 440 transitions, 6649 flow. Second operand 8 states and 136 transitions. [2024-06-27 20:37:56,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 474 transitions, 7895 flow [2024-06-27 20:37:57,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 474 transitions, 7554 flow, removed 53 selfloop flow, removed 5 redundant places. [2024-06-27 20:37:57,403 INFO L231 Difference]: Finished difference. Result has 284 places, 444 transitions, 6667 flow [2024-06-27 20:37:57,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6308, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6667, PETRI_PLACES=284, PETRI_TRANSITIONS=444} [2024-06-27 20:37:57,404 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 243 predicate places. [2024-06-27 20:37:57,404 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 444 transitions, 6667 flow [2024-06-27 20:37:57,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:57,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:37:57,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:37:57,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 20:37:57,405 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:37:57,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:37:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash 12603893, now seen corresponding path program 6 times [2024-06-27 20:37:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:37:57,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641966591] [2024-06-27 20:37:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:37:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:37:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:37:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:37:57,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:37:57,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641966591] [2024-06-27 20:37:57,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641966591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:37:57,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:37:57,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:37:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747681587] [2024-06-27 20:37:57,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:37:57,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:37:57,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:37:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:37:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:37:58,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:37:58,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 444 transitions, 6667 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:37:58,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:37:58,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:37:58,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:37:59,432 INFO L124 PetriNetUnfolderBase]: 4324/6697 cut-off events. [2024-06-27 20:37:59,433 INFO L125 PetriNetUnfolderBase]: For 406753/406763 co-relation queries the response was YES. [2024-06-27 20:37:59,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49752 conditions, 6697 events. 4324/6697 cut-off events. For 406753/406763 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 38889 event pairs, 900 based on Foata normal form. 15/6711 useless extension candidates. Maximal degree in co-relation 49625. Up to 6250 conditions per place. [2024-06-27 20:37:59,516 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 338 selfloop transitions, 141 changer transitions 0/482 dead transitions. [2024-06-27 20:37:59,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 482 transitions, 8146 flow [2024-06-27 20:37:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:37:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:37:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-27 20:37:59,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-27 20:37:59,518 INFO L175 Difference]: Start difference. First operand has 284 places, 444 transitions, 6667 flow. Second operand 8 states and 133 transitions. [2024-06-27 20:37:59,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 482 transitions, 8146 flow [2024-06-27 20:38:00,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 482 transitions, 7868 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-27 20:38:00,253 INFO L231 Difference]: Finished difference. Result has 285 places, 453 transitions, 6855 flow [2024-06-27 20:38:00,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6418, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6855, PETRI_PLACES=285, PETRI_TRANSITIONS=453} [2024-06-27 20:38:00,253 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 244 predicate places. [2024-06-27 20:38:00,254 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 453 transitions, 6855 flow [2024-06-27 20:38:00,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:00,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:00,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:00,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 20:38:00,254 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:00,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash 12592733, now seen corresponding path program 7 times [2024-06-27 20:38:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:00,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885789366] [2024-06-27 20:38:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:00,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885789366] [2024-06-27 20:38:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885789366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:00,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:00,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972242706] [2024-06-27 20:38:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:00,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:00,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:00,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 453 transitions, 6855 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:00,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:00,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:00,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:02,405 INFO L124 PetriNetUnfolderBase]: 4312/6681 cut-off events. [2024-06-27 20:38:02,406 INFO L125 PetriNetUnfolderBase]: For 387714/387724 co-relation queries the response was YES. [2024-06-27 20:38:02,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49085 conditions, 6681 events. 4312/6681 cut-off events. For 387714/387724 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 38770 event pairs, 900 based on Foata normal form. 14/6694 useless extension candidates. Maximal degree in co-relation 48959. Up to 6242 conditions per place. [2024-06-27 20:38:02,475 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 344 selfloop transitions, 136 changer transitions 0/483 dead transitions. [2024-06-27 20:38:02,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 483 transitions, 8063 flow [2024-06-27 20:38:02,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:38:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:38:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 20:38:02,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-27 20:38:02,477 INFO L175 Difference]: Start difference. First operand has 285 places, 453 transitions, 6855 flow. Second operand 8 states and 134 transitions. [2024-06-27 20:38:02,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 483 transitions, 8063 flow [2024-06-27 20:38:03,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 483 transitions, 7803 flow, removed 44 selfloop flow, removed 5 redundant places. [2024-06-27 20:38:03,163 INFO L231 Difference]: Finished difference. Result has 288 places, 453 transitions, 6881 flow [2024-06-27 20:38:03,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6597, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6881, PETRI_PLACES=288, PETRI_TRANSITIONS=453} [2024-06-27 20:38:03,164 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 247 predicate places. [2024-06-27 20:38:03,164 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 453 transitions, 6881 flow [2024-06-27 20:38:03,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:03,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:03,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:03,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 20:38:03,165 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:03,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:03,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1952731828, now seen corresponding path program 5 times [2024-06-27 20:38:03,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:03,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72049937] [2024-06-27 20:38:03,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:03,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:03,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:03,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72049937] [2024-06-27 20:38:03,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72049937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:03,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:38:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654203407] [2024-06-27 20:38:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:03,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:38:03,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:03,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:38:03,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:38:03,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:03,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 453 transitions, 6881 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:03,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:03,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:03,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:04,938 INFO L124 PetriNetUnfolderBase]: 4317/6700 cut-off events. [2024-06-27 20:38:04,938 INFO L125 PetriNetUnfolderBase]: For 385457/385465 co-relation queries the response was YES. [2024-06-27 20:38:05,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49025 conditions, 6700 events. 4317/6700 cut-off events. For 385457/385465 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 39133 event pairs, 1250 based on Foata normal form. 9/6706 useless extension candidates. Maximal degree in co-relation 48899. Up to 6554 conditions per place. [2024-06-27 20:38:05,038 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 422 selfloop transitions, 56 changer transitions 0/481 dead transitions. [2024-06-27 20:38:05,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 481 transitions, 8261 flow [2024-06-27 20:38:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:38:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:38:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-27 20:38:05,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-27 20:38:05,039 INFO L175 Difference]: Start difference. First operand has 288 places, 453 transitions, 6881 flow. Second operand 7 states and 112 transitions. [2024-06-27 20:38:05,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 481 transitions, 8261 flow [2024-06-27 20:38:05,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 481 transitions, 7948 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-27 20:38:05,724 INFO L231 Difference]: Finished difference. Result has 288 places, 464 transitions, 6876 flow [2024-06-27 20:38:05,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6572, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6876, PETRI_PLACES=288, PETRI_TRANSITIONS=464} [2024-06-27 20:38:05,724 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 247 predicate places. [2024-06-27 20:38:05,725 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 464 transitions, 6876 flow [2024-06-27 20:38:05,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:05,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:05,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:05,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 20:38:05,725 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:05,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1214420104, now seen corresponding path program 6 times [2024-06-27 20:38:05,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:05,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955172850] [2024-06-27 20:38:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:05,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:06,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955172850] [2024-06-27 20:38:06,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955172850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:06,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:38:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577411681] [2024-06-27 20:38:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:06,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:38:06,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:06,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:38:06,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:38:06,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:06,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 464 transitions, 6876 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:06,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:06,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:06,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:07,605 INFO L124 PetriNetUnfolderBase]: 4322/6706 cut-off events. [2024-06-27 20:38:07,605 INFO L125 PetriNetUnfolderBase]: For 384962/384970 co-relation queries the response was YES. [2024-06-27 20:38:07,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49123 conditions, 6706 events. 4322/6706 cut-off events. For 384962/384970 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 39224 event pairs, 1247 based on Foata normal form. 9/6713 useless extension candidates. Maximal degree in co-relation 48996. Up to 6560 conditions per place. [2024-06-27 20:38:07,696 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 417 selfloop transitions, 61 changer transitions 0/481 dead transitions. [2024-06-27 20:38:07,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 481 transitions, 8057 flow [2024-06-27 20:38:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:38:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:38:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-27 20:38:07,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2024-06-27 20:38:07,697 INFO L175 Difference]: Start difference. First operand has 288 places, 464 transitions, 6876 flow. Second operand 7 states and 108 transitions. [2024-06-27 20:38:07,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 481 transitions, 8057 flow [2024-06-27 20:38:08,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 481 transitions, 7919 flow, removed 58 selfloop flow, removed 2 redundant places. [2024-06-27 20:38:08,368 INFO L231 Difference]: Finished difference. Result has 293 places, 468 transitions, 6935 flow [2024-06-27 20:38:08,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6770, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6935, PETRI_PLACES=293, PETRI_TRANSITIONS=468} [2024-06-27 20:38:08,368 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 252 predicate places. [2024-06-27 20:38:08,368 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 468 transitions, 6935 flow [2024-06-27 20:38:08,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:08,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:08,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:08,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 20:38:08,369 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:08,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash -594299228, now seen corresponding path program 7 times [2024-06-27 20:38:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49974471] [2024-06-27 20:38:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:08,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-27 20:38:08,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:08,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49974471] [2024-06-27 20:38:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49974471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:08,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:08,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:38:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946700072] [2024-06-27 20:38:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:08,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:38:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:38:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:38:08,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:08,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 468 transitions, 6935 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:08,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:08,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:08,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:10,425 INFO L124 PetriNetUnfolderBase]: 4319/6698 cut-off events. [2024-06-27 20:38:10,425 INFO L125 PetriNetUnfolderBase]: For 391432/391440 co-relation queries the response was YES. [2024-06-27 20:38:10,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49009 conditions, 6698 events. 4319/6698 cut-off events. For 391432/391440 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 39045 event pairs, 1248 based on Foata normal form. 9/6705 useless extension candidates. Maximal degree in co-relation 48880. Up to 6611 conditions per place. [2024-06-27 20:38:10,493 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 435 selfloop transitions, 40 changer transitions 0/478 dead transitions. [2024-06-27 20:38:10,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 478 transitions, 8031 flow [2024-06-27 20:38:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:38:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:38:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2024-06-27 20:38:10,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2024-06-27 20:38:10,494 INFO L175 Difference]: Start difference. First operand has 293 places, 468 transitions, 6935 flow. Second operand 7 states and 103 transitions. [2024-06-27 20:38:10,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 478 transitions, 8031 flow [2024-06-27 20:38:11,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 478 transitions, 7932 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-27 20:38:11,147 INFO L231 Difference]: Finished difference. Result has 297 places, 468 transitions, 6922 flow [2024-06-27 20:38:11,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6836, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6922, PETRI_PLACES=297, PETRI_TRANSITIONS=468} [2024-06-27 20:38:11,147 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 256 predicate places. [2024-06-27 20:38:11,148 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 468 transitions, 6922 flow [2024-06-27 20:38:11,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:11,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:11,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:11,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 20:38:11,148 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:11,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:11,148 INFO L85 PathProgramCache]: Analyzing trace with hash 367755288, now seen corresponding path program 8 times [2024-06-27 20:38:11,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:11,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665080295] [2024-06-27 20:38:11,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:11,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:11,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:11,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665080295] [2024-06-27 20:38:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665080295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:11,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:11,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:38:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927270957] [2024-06-27 20:38:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:11,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:38:11,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:11,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:38:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:38:11,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:11,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 468 transitions, 6922 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:11,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:11,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:11,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:13,031 INFO L124 PetriNetUnfolderBase]: 4316/6694 cut-off events. [2024-06-27 20:38:13,031 INFO L125 PetriNetUnfolderBase]: For 400514/400522 co-relation queries the response was YES. [2024-06-27 20:38:13,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49049 conditions, 6694 events. 4316/6694 cut-off events. For 400514/400522 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 39010 event pairs, 1246 based on Foata normal form. 9/6701 useless extension candidates. Maximal degree in co-relation 48919. Up to 6620 conditions per place. [2024-06-27 20:38:13,117 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 445 selfloop transitions, 29 changer transitions 0/477 dead transitions. [2024-06-27 20:38:13,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 477 transitions, 7896 flow [2024-06-27 20:38:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:38:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:38:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-27 20:38:13,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3607142857142857 [2024-06-27 20:38:13,119 INFO L175 Difference]: Start difference. First operand has 297 places, 468 transitions, 6922 flow. Second operand 7 states and 101 transitions. [2024-06-27 20:38:13,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 477 transitions, 7896 flow [2024-06-27 20:38:13,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 477 transitions, 7779 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-27 20:38:13,824 INFO L231 Difference]: Finished difference. Result has 299 places, 468 transitions, 6869 flow [2024-06-27 20:38:13,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6805, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6869, PETRI_PLACES=299, PETRI_TRANSITIONS=468} [2024-06-27 20:38:13,825 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 258 predicate places. [2024-06-27 20:38:13,825 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 468 transitions, 6869 flow [2024-06-27 20:38:13,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:13,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:13,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:13,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 20:38:13,825 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:13,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:13,826 INFO L85 PathProgramCache]: Analyzing trace with hash -151466615, now seen corresponding path program 7 times [2024-06-27 20:38:13,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:13,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600242769] [2024-06-27 20:38:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:13,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:14,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600242769] [2024-06-27 20:38:14,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600242769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:14,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:14,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 20:38:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774208422] [2024-06-27 20:38:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 20:38:14,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:14,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 20:38:14,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 20:38:14,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:14,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 468 transitions, 6869 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:14,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:14,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:14,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:16,227 INFO L124 PetriNetUnfolderBase]: 4296/6658 cut-off events. [2024-06-27 20:38:16,227 INFO L125 PetriNetUnfolderBase]: For 409632/409642 co-relation queries the response was YES. [2024-06-27 20:38:16,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48370 conditions, 6658 events. 4296/6658 cut-off events. For 409632/409642 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 38628 event pairs, 809 based on Foata normal form. 22/6676 useless extension candidates. Maximal degree in co-relation 48239. Up to 5904 conditions per place. [2024-06-27 20:38:16,310 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 353 selfloop transitions, 145 changer transitions 0/501 dead transitions. [2024-06-27 20:38:16,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 501 transitions, 7985 flow [2024-06-27 20:38:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:38:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:38:16,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-27 20:38:16,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-27 20:38:16,311 INFO L175 Difference]: Start difference. First operand has 299 places, 468 transitions, 6869 flow. Second operand 9 states and 149 transitions. [2024-06-27 20:38:16,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 501 transitions, 7985 flow [2024-06-27 20:38:17,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 501 transitions, 7885 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-27 20:38:17,077 INFO L231 Difference]: Finished difference. Result has 303 places, 468 transitions, 7065 flow [2024-06-27 20:38:17,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6769, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7065, PETRI_PLACES=303, PETRI_TRANSITIONS=468} [2024-06-27 20:38:17,078 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 262 predicate places. [2024-06-27 20:38:17,078 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 468 transitions, 7065 flow [2024-06-27 20:38:17,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:17,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:17,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:17,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 20:38:17,078 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:17,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -54429773, now seen corresponding path program 8 times [2024-06-27 20:38:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607698830] [2024-06-27 20:38:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:18,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607698830] [2024-06-27 20:38:18,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607698830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:18,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 20:38:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566410217] [2024-06-27 20:38:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:18,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 20:38:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:18,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 20:38:18,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-27 20:38:18,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:18,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 468 transitions, 7065 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:18,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:18,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:18,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:19,724 INFO L124 PetriNetUnfolderBase]: 4337/6729 cut-off events. [2024-06-27 20:38:19,725 INFO L125 PetriNetUnfolderBase]: For 424867/424877 co-relation queries the response was YES. [2024-06-27 20:38:19,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49404 conditions, 6729 events. 4337/6729 cut-off events. For 424867/424877 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 39136 event pairs, 818 based on Foata normal form. 22/6747 useless extension candidates. Maximal degree in co-relation 49272. Up to 5710 conditions per place. [2024-06-27 20:38:19,809 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 345 selfloop transitions, 159 changer transitions 0/507 dead transitions. [2024-06-27 20:38:19,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 507 transitions, 8260 flow [2024-06-27 20:38:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:38:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:38:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-27 20:38:19,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2024-06-27 20:38:19,811 INFO L175 Difference]: Start difference. First operand has 303 places, 468 transitions, 7065 flow. Second operand 10 states and 168 transitions. [2024-06-27 20:38:19,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 507 transitions, 8260 flow [2024-06-27 20:38:20,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 507 transitions, 7955 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 20:38:20,537 INFO L231 Difference]: Finished difference. Result has 307 places, 469 transitions, 7133 flow [2024-06-27 20:38:20,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6760, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7133, PETRI_PLACES=307, PETRI_TRANSITIONS=469} [2024-06-27 20:38:20,539 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 266 predicate places. [2024-06-27 20:38:20,539 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 469 transitions, 7133 flow [2024-06-27 20:38:20,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:20,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:20,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:20,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 20:38:20,540 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:20,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash -291957419, now seen corresponding path program 9 times [2024-06-27 20:38:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:20,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492542345] [2024-06-27 20:38:20,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:20,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:21,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:21,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492542345] [2024-06-27 20:38:21,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492542345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:21,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:21,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 20:38:21,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35770179] [2024-06-27 20:38:21,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:21,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 20:38:21,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:21,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 20:38:21,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-27 20:38:21,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:21,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 469 transitions, 7133 flow. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:21,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:21,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:21,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:23,580 INFO L124 PetriNetUnfolderBase]: 4317/6697 cut-off events. [2024-06-27 20:38:23,580 INFO L125 PetriNetUnfolderBase]: For 421309/421319 co-relation queries the response was YES. [2024-06-27 20:38:23,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48699 conditions, 6697 events. 4317/6697 cut-off events. For 421309/421319 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 38956 event pairs, 819 based on Foata normal form. 22/6715 useless extension candidates. Maximal degree in co-relation 48566. Up to 5866 conditions per place. [2024-06-27 20:38:23,657 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 354 selfloop transitions, 151 changer transitions 0/508 dead transitions. [2024-06-27 20:38:23,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 508 transitions, 8309 flow [2024-06-27 20:38:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:38:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:38:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 20:38:23,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4075 [2024-06-27 20:38:23,658 INFO L175 Difference]: Start difference. First operand has 307 places, 469 transitions, 7133 flow. Second operand 10 states and 163 transitions. [2024-06-27 20:38:23,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 508 transitions, 8309 flow [2024-06-27 20:38:24,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 508 transitions, 7946 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-27 20:38:24,374 INFO L231 Difference]: Finished difference. Result has 311 places, 471 transitions, 7128 flow [2024-06-27 20:38:24,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6770, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7128, PETRI_PLACES=311, PETRI_TRANSITIONS=471} [2024-06-27 20:38:24,375 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 270 predicate places. [2024-06-27 20:38:24,375 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 471 transitions, 7128 flow [2024-06-27 20:38:24,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:24,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:24,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:24,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 20:38:24,376 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-27 20:38:24,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash -121139669, now seen corresponding path program 10 times [2024-06-27 20:38:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:24,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280874169] [2024-06-27 20:38:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:25,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:25,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280874169] [2024-06-27 20:38:25,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280874169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:25,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:25,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 20:38:25,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103821060] [2024-06-27 20:38:25,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:25,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 20:38:25,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:25,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 20:38:25,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 20:38:25,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:25,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 471 transitions, 7128 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:25,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:25,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:25,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:26,868 INFO L124 PetriNetUnfolderBase]: 4297/6665 cut-off events. [2024-06-27 20:38:26,868 INFO L125 PetriNetUnfolderBase]: For 414220/414226 co-relation queries the response was YES. [2024-06-27 20:38:26,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47927 conditions, 6665 events. 4297/6665 cut-off events. For 414220/414226 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 38725 event pairs, 805 based on Foata normal form. 18/6679 useless extension candidates. Maximal degree in co-relation 47792. Up to 5824 conditions per place. [2024-06-27 20:38:26,955 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 355 selfloop transitions, 145 changer transitions 0/503 dead transitions. [2024-06-27 20:38:26,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 503 transitions, 8166 flow [2024-06-27 20:38:26,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:38:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:38:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-27 20:38:26,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-27 20:38:26,956 INFO L175 Difference]: Start difference. First operand has 311 places, 471 transitions, 7128 flow. Second operand 9 states and 149 transitions. [2024-06-27 20:38:26,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 503 transitions, 8166 flow [2024-06-27 20:38:27,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 503 transitions, 7630 flow, removed 65 selfloop flow, removed 7 redundant places. [2024-06-27 20:38:27,948 INFO L231 Difference]: Finished difference. Result has 312 places, 470 transitions, 6806 flow [2024-06-27 20:38:27,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6510, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6806, PETRI_PLACES=312, PETRI_TRANSITIONS=470} [2024-06-27 20:38:27,948 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 271 predicate places. [2024-06-27 20:38:27,948 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 470 transitions, 6806 flow [2024-06-27 20:38:27,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:27,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:27,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:27,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 20:38:27,949 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:27,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1981939095, now seen corresponding path program 8 times [2024-06-27 20:38:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424524537] [2024-06-27 20:38:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424524537] [2024-06-27 20:38:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424524537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:28,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:28,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:28,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744209747] [2024-06-27 20:38:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:28,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:28,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:28,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:28,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:28,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:28,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 470 transitions, 6806 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:28,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:28,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:28,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:29,971 INFO L124 PetriNetUnfolderBase]: 4322/6712 cut-off events. [2024-06-27 20:38:29,971 INFO L125 PetriNetUnfolderBase]: For 414599/414599 co-relation queries the response was YES. [2024-06-27 20:38:30,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47129 conditions, 6712 events. 4322/6712 cut-off events. For 414599/414599 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 39279 event pairs, 1571 based on Foata normal form. 5/6716 useless extension candidates. Maximal degree in co-relation 46994. Up to 6633 conditions per place. [2024-06-27 20:38:30,063 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 465 selfloop transitions, 22 changer transitions 0/490 dead transitions. [2024-06-27 20:38:30,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 490 transitions, 7919 flow [2024-06-27 20:38:30,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:38:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:38:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-27 20:38:30,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-27 20:38:30,064 INFO L175 Difference]: Start difference. First operand has 312 places, 470 transitions, 6806 flow. Second operand 8 states and 113 transitions. [2024-06-27 20:38:30,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 490 transitions, 7919 flow [2024-06-27 20:38:30,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 490 transitions, 7625 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 20:38:30,857 INFO L231 Difference]: Finished difference. Result has 314 places, 475 transitions, 6655 flow [2024-06-27 20:38:30,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6512, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6655, PETRI_PLACES=314, PETRI_TRANSITIONS=475} [2024-06-27 20:38:30,858 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 273 predicate places. [2024-06-27 20:38:30,858 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 475 transitions, 6655 flow [2024-06-27 20:38:30,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:30,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:30,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:30,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 20:38:30,859 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:30,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:30,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1982325045, now seen corresponding path program 9 times [2024-06-27 20:38:30,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:30,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929199443] [2024-06-27 20:38:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:30,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929199443] [2024-06-27 20:38:31,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929199443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:31,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:31,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509699680] [2024-06-27 20:38:31,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:31,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:31,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:31,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 475 transitions, 6655 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:31,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:31,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:31,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:32,815 INFO L124 PetriNetUnfolderBase]: 4342/6728 cut-off events. [2024-06-27 20:38:32,816 INFO L125 PetriNetUnfolderBase]: For 407837/407843 co-relation queries the response was YES. [2024-06-27 20:38:32,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46770 conditions, 6728 events. 4342/6728 cut-off events. For 407837/407843 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 39142 event pairs, 885 based on Foata normal form. 10/6734 useless extension candidates. Maximal degree in co-relation 46634. Up to 6259 conditions per place. [2024-06-27 20:38:32,898 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 356 selfloop transitions, 142 changer transitions 0/501 dead transitions. [2024-06-27 20:38:32,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 501 transitions, 7954 flow [2024-06-27 20:38:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:38:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:38:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-27 20:38:32,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-27 20:38:32,900 INFO L175 Difference]: Start difference. First operand has 314 places, 475 transitions, 6655 flow. Second operand 8 states and 125 transitions. [2024-06-27 20:38:32,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 501 transitions, 7954 flow [2024-06-27 20:38:33,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 501 transitions, 7872 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-27 20:38:33,723 INFO L231 Difference]: Finished difference. Result has 316 places, 479 transitions, 6941 flow [2024-06-27 20:38:33,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6573, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6941, PETRI_PLACES=316, PETRI_TRANSITIONS=479} [2024-06-27 20:38:33,724 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 275 predicate places. [2024-06-27 20:38:33,724 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 479 transitions, 6941 flow [2024-06-27 20:38:33,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:33,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:33,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:33,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 20:38:33,725 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:33,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:33,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1890143755, now seen corresponding path program 10 times [2024-06-27 20:38:33,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:33,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429460839] [2024-06-27 20:38:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:34,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:34,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429460839] [2024-06-27 20:38:34,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429460839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:34,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:34,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471838685] [2024-06-27 20:38:34,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:34,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:34,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:34,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:34,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 479 transitions, 6941 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:34,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:34,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:34,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:35,759 INFO L124 PetriNetUnfolderBase]: 4327/6708 cut-off events. [2024-06-27 20:38:35,759 INFO L125 PetriNetUnfolderBase]: For 411961/411967 co-relation queries the response was YES. [2024-06-27 20:38:35,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46806 conditions, 6708 events. 4327/6708 cut-off events. For 411961/411967 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 38959 event pairs, 884 based on Foata normal form. 11/6715 useless extension candidates. Maximal degree in co-relation 46669. Up to 6249 conditions per place. [2024-06-27 20:38:35,848 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 359 selfloop transitions, 141 changer transitions 0/503 dead transitions. [2024-06-27 20:38:35,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 503 transitions, 8053 flow [2024-06-27 20:38:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:38:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:38:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-27 20:38:35,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-27 20:38:35,849 INFO L175 Difference]: Start difference. First operand has 316 places, 479 transitions, 6941 flow. Second operand 8 states and 126 transitions. [2024-06-27 20:38:35,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 503 transitions, 8053 flow [2024-06-27 20:38:36,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 503 transitions, 7540 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-27 20:38:36,789 INFO L231 Difference]: Finished difference. Result has 317 places, 479 transitions, 6718 flow [2024-06-27 20:38:36,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6428, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6718, PETRI_PLACES=317, PETRI_TRANSITIONS=479} [2024-06-27 20:38:36,791 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 276 predicate places. [2024-06-27 20:38:36,791 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 479 transitions, 6718 flow [2024-06-27 20:38:36,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:36,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:36,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:36,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 20:38:36,791 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:36,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:36,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1210618760, now seen corresponding path program 1 times [2024-06-27 20:38:36,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:36,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083565791] [2024-06-27 20:38:36,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:36,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:37,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083565791] [2024-06-27 20:38:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083565791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:37,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121228396] [2024-06-27 20:38:37,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:37,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:37,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:37,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:38:37,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 479 transitions, 6718 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:37,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:37,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:38:37,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:38,855 INFO L124 PetriNetUnfolderBase]: 4233/6624 cut-off events. [2024-06-27 20:38:38,855 INFO L125 PetriNetUnfolderBase]: For 371970/372013 co-relation queries the response was YES. [2024-06-27 20:38:38,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45280 conditions, 6624 events. 4233/6624 cut-off events. For 371970/372013 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 39528 event pairs, 1471 based on Foata normal form. 2/6571 useless extension candidates. Maximal degree in co-relation 45142. Up to 6431 conditions per place. [2024-06-27 20:38:38,936 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 459 selfloop transitions, 24 changer transitions 0/509 dead transitions. [2024-06-27 20:38:38,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 509 transitions, 7984 flow [2024-06-27 20:38:38,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:38:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:38:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-27 20:38:38,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2024-06-27 20:38:38,938 INFO L175 Difference]: Start difference. First operand has 317 places, 479 transitions, 6718 flow. Second operand 9 states and 142 transitions. [2024-06-27 20:38:38,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 509 transitions, 7984 flow [2024-06-27 20:38:39,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 509 transitions, 7675 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-27 20:38:39,806 INFO L231 Difference]: Finished difference. Result has 319 places, 485 transitions, 6549 flow [2024-06-27 20:38:39,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6409, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6549, PETRI_PLACES=319, PETRI_TRANSITIONS=485} [2024-06-27 20:38:39,807 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 278 predicate places. [2024-06-27 20:38:39,807 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 485 transitions, 6549 flow [2024-06-27 20:38:39,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:39,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:39,807 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-27 20:38:39,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 20:38:39,808 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:39,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1692143758, now seen corresponding path program 1 times [2024-06-27 20:38:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:39,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176532849] [2024-06-27 20:38:39,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:39,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:40,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:40,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176532849] [2024-06-27 20:38:40,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176532849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:40,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:40,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:40,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243169116] [2024-06-27 20:38:40,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:40,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:40,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:40,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:40,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:40,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:40,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 485 transitions, 6549 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:40,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:40,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:40,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:41,806 INFO L124 PetriNetUnfolderBase]: 4376/6779 cut-off events. [2024-06-27 20:38:41,806 INFO L125 PetriNetUnfolderBase]: For 429954/429958 co-relation queries the response was YES. [2024-06-27 20:38:41,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47649 conditions, 6779 events. 4376/6779 cut-off events. For 429954/429958 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 39638 event pairs, 1215 based on Foata normal form. 6/6784 useless extension candidates. Maximal degree in co-relation 47510. Up to 6688 conditions per place. [2024-06-27 20:38:41,898 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 474 selfloop transitions, 41 changer transitions 0/518 dead transitions. [2024-06-27 20:38:41,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 518 transitions, 7800 flow [2024-06-27 20:38:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:38:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:38:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-27 20:38:41,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-27 20:38:41,900 INFO L175 Difference]: Start difference. First operand has 319 places, 485 transitions, 6549 flow. Second operand 9 states and 135 transitions. [2024-06-27 20:38:41,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 518 transitions, 7800 flow [2024-06-27 20:38:42,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 518 transitions, 7735 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-27 20:38:42,898 INFO L231 Difference]: Finished difference. Result has 325 places, 498 transitions, 6779 flow [2024-06-27 20:38:42,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6484, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6779, PETRI_PLACES=325, PETRI_TRANSITIONS=498} [2024-06-27 20:38:42,901 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 284 predicate places. [2024-06-27 20:38:42,901 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 498 transitions, 6779 flow [2024-06-27 20:38:42,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:42,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:42,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:42,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 20:38:42,902 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:42,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1210708970, now seen corresponding path program 2 times [2024-06-27 20:38:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:42,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078874453] [2024-06-27 20:38:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:43,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:43,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078874453] [2024-06-27 20:38:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078874453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:43,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:43,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:43,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781453902] [2024-06-27 20:38:43,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:43,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:43,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:43,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:43,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:43,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:38:43,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 498 transitions, 6779 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:43,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:43,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:38:43,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:45,026 INFO L124 PetriNetUnfolderBase]: 4231/6624 cut-off events. [2024-06-27 20:38:45,026 INFO L125 PetriNetUnfolderBase]: For 387421/387464 co-relation queries the response was YES. [2024-06-27 20:38:45,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46224 conditions, 6624 events. 4231/6624 cut-off events. For 387421/387464 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 39537 event pairs, 1464 based on Foata normal form. 2/6571 useless extension candidates. Maximal degree in co-relation 46081. Up to 6449 conditions per place. [2024-06-27 20:38:45,114 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 472 selfloop transitions, 18 changer transitions 0/516 dead transitions. [2024-06-27 20:38:45,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 516 transitions, 7831 flow [2024-06-27 20:38:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:38:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:38:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-27 20:38:45,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-27 20:38:45,115 INFO L175 Difference]: Start difference. First operand has 325 places, 498 transitions, 6779 flow. Second operand 8 states and 124 transitions. [2024-06-27 20:38:45,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 516 transitions, 7831 flow [2024-06-27 20:38:46,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 516 transitions, 7703 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-06-27 20:38:46,255 INFO L231 Difference]: Finished difference. Result has 329 places, 498 transitions, 6693 flow [2024-06-27 20:38:46,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6651, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6693, PETRI_PLACES=329, PETRI_TRANSITIONS=498} [2024-06-27 20:38:46,256 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 288 predicate places. [2024-06-27 20:38:46,256 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 498 transitions, 6693 flow [2024-06-27 20:38:46,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:46,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:46,256 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-27 20:38:46,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 20:38:46,257 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:46,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash 214114742, now seen corresponding path program 2 times [2024-06-27 20:38:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:46,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289843912] [2024-06-27 20:38:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:46,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:46,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289843912] [2024-06-27 20:38:46,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289843912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:46,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:46,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:46,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206654358] [2024-06-27 20:38:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:46,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:46,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:46,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:46,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:46,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:46,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 498 transitions, 6693 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:46,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:46,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:46,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:48,155 INFO L124 PetriNetUnfolderBase]: 4377/6781 cut-off events. [2024-06-27 20:38:48,156 INFO L125 PetriNetUnfolderBase]: For 445628/445632 co-relation queries the response was YES. [2024-06-27 20:38:48,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48270 conditions, 6781 events. 4377/6781 cut-off events. For 445628/445632 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 39681 event pairs, 1213 based on Foata normal form. 6/6786 useless extension candidates. Maximal degree in co-relation 48126. Up to 6681 conditions per place. [2024-06-27 20:38:48,252 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 473 selfloop transitions, 46 changer transitions 0/522 dead transitions. [2024-06-27 20:38:48,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 522 transitions, 7877 flow [2024-06-27 20:38:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:38:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:38:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-27 20:38:48,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-06-27 20:38:48,253 INFO L175 Difference]: Start difference. First operand has 329 places, 498 transitions, 6693 flow. Second operand 9 states and 138 transitions. [2024-06-27 20:38:48,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 522 transitions, 7877 flow [2024-06-27 20:38:49,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 522 transitions, 7831 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 20:38:49,214 INFO L231 Difference]: Finished difference. Result has 331 places, 501 transitions, 6819 flow [2024-06-27 20:38:49,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6647, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6819, PETRI_PLACES=331, PETRI_TRANSITIONS=501} [2024-06-27 20:38:49,215 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 290 predicate places. [2024-06-27 20:38:49,215 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 501 transitions, 6819 flow [2024-06-27 20:38:49,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:49,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:49,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:49,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 20:38:49,215 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:49,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1214428040, now seen corresponding path program 3 times [2024-06-27 20:38:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:49,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358654810] [2024-06-27 20:38:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:49,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:49,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-27 20:38:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358654810] [2024-06-27 20:38:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358654810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:49,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:49,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:49,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944095557] [2024-06-27 20:38:49,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:49,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:49,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:49,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:49,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:38:49,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 501 transitions, 6819 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:49,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:49,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:38:49,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:51,365 INFO L124 PetriNetUnfolderBase]: 4245/6642 cut-off events. [2024-06-27 20:38:51,365 INFO L125 PetriNetUnfolderBase]: For 407395/407438 co-relation queries the response was YES. [2024-06-27 20:38:51,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46782 conditions, 6642 events. 4245/6642 cut-off events. For 407395/407438 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 39639 event pairs, 1461 based on Foata normal form. 3/6587 useless extension candidates. Maximal degree in co-relation 46637. Up to 6427 conditions per place. [2024-06-27 20:38:51,448 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 460 selfloop transitions, 35 changer transitions 0/521 dead transitions. [2024-06-27 20:38:51,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 521 transitions, 7939 flow [2024-06-27 20:38:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:38:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:38:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-27 20:38:51,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-27 20:38:51,449 INFO L175 Difference]: Start difference. First operand has 331 places, 501 transitions, 6819 flow. Second operand 8 states and 127 transitions. [2024-06-27 20:38:51,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 521 transitions, 7939 flow [2024-06-27 20:38:52,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 521 transitions, 7789 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-27 20:38:52,491 INFO L231 Difference]: Finished difference. Result has 332 places, 504 transitions, 6801 flow [2024-06-27 20:38:52,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6669, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6801, PETRI_PLACES=332, PETRI_TRANSITIONS=504} [2024-06-27 20:38:52,492 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 291 predicate places. [2024-06-27 20:38:52,492 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 504 transitions, 6801 flow [2024-06-27 20:38:52,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:52,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:52,493 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-27 20:38:52,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 20:38:52,493 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:52,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1274646184, now seen corresponding path program 3 times [2024-06-27 20:38:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:52,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886609247] [2024-06-27 20:38:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:53,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:53,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886609247] [2024-06-27 20:38:53,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886609247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:53,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:53,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:53,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998092158] [2024-06-27 20:38:53,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:53,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:53,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:53,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:53,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:53,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 504 transitions, 6801 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:53,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:53,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:53,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:54,510 INFO L124 PetriNetUnfolderBase]: 4418/6838 cut-off events. [2024-06-27 20:38:54,514 INFO L125 PetriNetUnfolderBase]: For 474523/474527 co-relation queries the response was YES. [2024-06-27 20:38:54,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49926 conditions, 6838 events. 4418/6838 cut-off events. For 474523/474527 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 40011 event pairs, 1219 based on Foata normal form. 6/6843 useless extension candidates. Maximal degree in co-relation 49780. Up to 6680 conditions per place. [2024-06-27 20:38:54,611 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 465 selfloop transitions, 63 changer transitions 0/531 dead transitions. [2024-06-27 20:38:54,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 531 transitions, 8233 flow [2024-06-27 20:38:54,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:38:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:38:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-27 20:38:54,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-27 20:38:54,612 INFO L175 Difference]: Start difference. First operand has 332 places, 504 transitions, 6801 flow. Second operand 8 states and 127 transitions. [2024-06-27 20:38:54,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 531 transitions, 8233 flow [2024-06-27 20:38:55,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 531 transitions, 8123 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-27 20:38:55,746 INFO L231 Difference]: Finished difference. Result has 334 places, 510 transitions, 6982 flow [2024-06-27 20:38:55,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6691, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6982, PETRI_PLACES=334, PETRI_TRANSITIONS=510} [2024-06-27 20:38:55,747 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 293 predicate places. [2024-06-27 20:38:55,747 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 510 transitions, 6982 flow [2024-06-27 20:38:55,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:55,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:55,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:55,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 20:38:55,751 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:38:55,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1469536012, now seen corresponding path program 4 times [2024-06-27 20:38:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:55,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309832365] [2024-06-27 20:38:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:55,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:56,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:56,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309832365] [2024-06-27 20:38:56,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309832365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:56,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:56,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:56,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637141225] [2024-06-27 20:38:56,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:56,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:56,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:56,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:56,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:38:56,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 510 transitions, 6982 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:56,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:56,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:38:56,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:38:57,786 INFO L124 PetriNetUnfolderBase]: 4271/6680 cut-off events. [2024-06-27 20:38:57,787 INFO L125 PetriNetUnfolderBase]: For 426631/426673 co-relation queries the response was YES. [2024-06-27 20:38:57,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48077 conditions, 6680 events. 4271/6680 cut-off events. For 426631/426673 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 39881 event pairs, 1471 based on Foata normal form. 2/6625 useless extension candidates. Maximal degree in co-relation 47930. Up to 6508 conditions per place. [2024-06-27 20:38:57,878 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 478 selfloop transitions, 22 changer transitions 0/526 dead transitions. [2024-06-27 20:38:57,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 526 transitions, 8098 flow [2024-06-27 20:38:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:38:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:38:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-27 20:38:57,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-27 20:38:57,880 INFO L175 Difference]: Start difference. First operand has 334 places, 510 transitions, 6982 flow. Second operand 8 states and 119 transitions. [2024-06-27 20:38:57,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 526 transitions, 8098 flow [2024-06-27 20:38:59,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 526 transitions, 7952 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-06-27 20:38:59,053 INFO L231 Difference]: Finished difference. Result has 338 places, 513 transitions, 6950 flow [2024-06-27 20:38:59,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6836, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6950, PETRI_PLACES=338, PETRI_TRANSITIONS=513} [2024-06-27 20:38:59,054 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 297 predicate places. [2024-06-27 20:38:59,054 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 513 transitions, 6950 flow [2024-06-27 20:38:59,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:59,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:38:59,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:38:59,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 20:38:59,055 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-27 20:38:59,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:38:59,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1968975050, now seen corresponding path program 1 times [2024-06-27 20:38:59,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:38:59,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781776564] [2024-06-27 20:38:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:38:59,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:38:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:38:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:38:59,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:38:59,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781776564] [2024-06-27 20:38:59,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781776564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:38:59,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:38:59,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:38:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289272453] [2024-06-27 20:38:59,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:38:59,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:38:59,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:38:59,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:38:59,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:38:59,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:38:59,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 513 transitions, 6950 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:38:59,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:38:59,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:38:59,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:01,295 INFO L124 PetriNetUnfolderBase]: 4424/6856 cut-off events. [2024-06-27 20:39:01,295 INFO L125 PetriNetUnfolderBase]: For 489227/489227 co-relation queries the response was YES. [2024-06-27 20:39:01,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50631 conditions, 6856 events. 4424/6856 cut-off events. For 489227/489227 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 40224 event pairs, 1581 based on Foata normal form. 1/6856 useless extension candidates. Maximal degree in co-relation 50482. Up to 6795 conditions per place. [2024-06-27 20:39:01,375 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 506 selfloop transitions, 20 changer transitions 0/529 dead transitions. [2024-06-27 20:39:01,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 529 transitions, 8145 flow [2024-06-27 20:39:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 20:39:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 20:39:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2024-06-27 20:39:01,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-27 20:39:01,377 INFO L175 Difference]: Start difference. First operand has 338 places, 513 transitions, 6950 flow. Second operand 7 states and 100 transitions. [2024-06-27 20:39:01,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 529 transitions, 8145 flow [2024-06-27 20:39:02,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 529 transitions, 8047 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-27 20:39:02,634 INFO L231 Difference]: Finished difference. Result has 339 places, 519 transitions, 7021 flow [2024-06-27 20:39:02,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6858, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7021, PETRI_PLACES=339, PETRI_TRANSITIONS=519} [2024-06-27 20:39:02,635 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 298 predicate places. [2024-06-27 20:39:02,635 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 519 transitions, 7021 flow [2024-06-27 20:39:02,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:02,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:02,635 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-27 20:39:02,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 20:39:02,636 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:02,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1307887182, now seen corresponding path program 1 times [2024-06-27 20:39:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:02,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21051663] [2024-06-27 20:39:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:03,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:03,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21051663] [2024-06-27 20:39:03,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21051663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:03,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:03,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 20:39:03,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039607159] [2024-06-27 20:39:03,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:03,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 20:39:03,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:03,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 20:39:03,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 20:39:03,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:39:03,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 519 transitions, 7021 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:03,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:03,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:39:03,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:04,466 INFO L124 PetriNetUnfolderBase]: 4327/6751 cut-off events. [2024-06-27 20:39:04,466 INFO L125 PetriNetUnfolderBase]: For 501314/501344 co-relation queries the response was YES. [2024-06-27 20:39:04,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50101 conditions, 6751 events. 4327/6751 cut-off events. For 501314/501344 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 39804 event pairs, 723 based on Foata normal form. 32/6755 useless extension candidates. Maximal degree in co-relation 49951. Up to 6215 conditions per place. [2024-06-27 20:39:04,569 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 428 selfloop transitions, 83 changer transitions 0/555 dead transitions. [2024-06-27 20:39:04,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 555 transitions, 8380 flow [2024-06-27 20:39:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:39:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:39:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 20:39:04,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-27 20:39:04,571 INFO L175 Difference]: Start difference. First operand has 339 places, 519 transitions, 7021 flow. Second operand 8 states and 134 transitions. [2024-06-27 20:39:04,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 555 transitions, 8380 flow [2024-06-27 20:39:06,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 555 transitions, 8282 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-27 20:39:06,010 INFO L231 Difference]: Finished difference. Result has 344 places, 528 transitions, 7233 flow [2024-06-27 20:39:06,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6923, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7233, PETRI_PLACES=344, PETRI_TRANSITIONS=528} [2024-06-27 20:39:06,010 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 303 predicate places. [2024-06-27 20:39:06,010 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 528 transitions, 7233 flow [2024-06-27 20:39:06,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:06,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:06,011 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-27 20:39:06,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 20:39:06,011 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:06,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash -997954268, now seen corresponding path program 2 times [2024-06-27 20:39:06,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:06,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629088720] [2024-06-27 20:39:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:06,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:06,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:06,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629088720] [2024-06-27 20:39:06,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629088720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:06,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:06,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752024238] [2024-06-27 20:39:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:06,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:06,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:06,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:06,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:06,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:06,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 528 transitions, 7233 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:06,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:06,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:06,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:08,169 INFO L124 PetriNetUnfolderBase]: 4519/6998 cut-off events. [2024-06-27 20:39:08,170 INFO L125 PetriNetUnfolderBase]: For 523921/523923 co-relation queries the response was YES. [2024-06-27 20:39:08,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52700 conditions, 6998 events. 4519/6998 cut-off events. For 523921/523923 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 41071 event pairs, 883 based on Foata normal form. 4/7001 useless extension candidates. Maximal degree in co-relation 52547. Up to 6640 conditions per place. [2024-06-27 20:39:08,262 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 473 selfloop transitions, 91 changer transitions 0/567 dead transitions. [2024-06-27 20:39:08,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 567 transitions, 8777 flow [2024-06-27 20:39:08,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:39:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:39:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-27 20:39:08,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-27 20:39:08,265 INFO L175 Difference]: Start difference. First operand has 344 places, 528 transitions, 7233 flow. Second operand 8 states and 132 transitions. [2024-06-27 20:39:08,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 567 transitions, 8777 flow [2024-06-27 20:39:09,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 567 transitions, 8590 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-06-27 20:39:09,848 INFO L231 Difference]: Finished difference. Result has 349 places, 538 transitions, 7431 flow [2024-06-27 20:39:09,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7104, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7431, PETRI_PLACES=349, PETRI_TRANSITIONS=538} [2024-06-27 20:39:09,849 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 308 predicate places. [2024-06-27 20:39:09,850 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 538 transitions, 7431 flow [2024-06-27 20:39:09,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:09,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:09,850 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-27 20:39:09,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 20:39:09,851 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:09,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:09,859 INFO L85 PathProgramCache]: Analyzing trace with hash -974622428, now seen corresponding path program 3 times [2024-06-27 20:39:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:09,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775158196] [2024-06-27 20:39:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:09,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:10,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775158196] [2024-06-27 20:39:10,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775158196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:10,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:10,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769423568] [2024-06-27 20:39:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:10,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:10,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:10,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:10,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:10,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 538 transitions, 7431 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:10,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:10,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:10,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:12,118 INFO L124 PetriNetUnfolderBase]: 4514/6991 cut-off events. [2024-06-27 20:39:12,119 INFO L125 PetriNetUnfolderBase]: For 529642/529646 co-relation queries the response was YES. [2024-06-27 20:39:12,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52846 conditions, 6991 events. 4514/6991 cut-off events. For 529642/529646 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 41010 event pairs, 890 based on Foata normal form. 6/6996 useless extension candidates. Maximal degree in co-relation 52691. Up to 6739 conditions per place. [2024-06-27 20:39:12,222 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 464 selfloop transitions, 94 changer transitions 0/561 dead transitions. [2024-06-27 20:39:12,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 561 transitions, 8637 flow [2024-06-27 20:39:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:39:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:39:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-27 20:39:12,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-27 20:39:12,223 INFO L175 Difference]: Start difference. First operand has 349 places, 538 transitions, 7431 flow. Second operand 8 states and 127 transitions. [2024-06-27 20:39:12,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 561 transitions, 8637 flow [2024-06-27 20:39:13,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 561 transitions, 8512 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-27 20:39:13,919 INFO L231 Difference]: Finished difference. Result has 353 places, 538 transitions, 7503 flow [2024-06-27 20:39:13,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7306, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7503, PETRI_PLACES=353, PETRI_TRANSITIONS=538} [2024-06-27 20:39:13,920 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 312 predicate places. [2024-06-27 20:39:13,920 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 538 transitions, 7503 flow [2024-06-27 20:39:13,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:13,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:13,921 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-27 20:39:13,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 20:39:13,921 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-27 20:39:13,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:13,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1751890640, now seen corresponding path program 1 times [2024-06-27 20:39:13,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:13,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189851914] [2024-06-27 20:39:13,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:13,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:14,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:14,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189851914] [2024-06-27 20:39:14,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189851914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:14,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:14,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:14,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496585444] [2024-06-27 20:39:14,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:14,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:14,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:14,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:14,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:14,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:14,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 538 transitions, 7503 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:14,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:14,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:14,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:16,000 INFO L124 PetriNetUnfolderBase]: 4540/7031 cut-off events. [2024-06-27 20:39:16,001 INFO L125 PetriNetUnfolderBase]: For 549506/549520 co-relation queries the response was YES. [2024-06-27 20:39:16,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53580 conditions, 7031 events. 4540/7031 cut-off events. For 549506/549520 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 41340 event pairs, 914 based on Foata normal form. 16/7046 useless extension candidates. Maximal degree in co-relation 53424. Up to 6735 conditions per place. [2024-06-27 20:39:16,104 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 478 selfloop transitions, 105 changer transitions 0/586 dead transitions. [2024-06-27 20:39:16,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 586 transitions, 9195 flow [2024-06-27 20:39:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-27 20:39:16,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2024-06-27 20:39:16,106 INFO L175 Difference]: Start difference. First operand has 353 places, 538 transitions, 7503 flow. Second operand 9 states and 148 transitions. [2024-06-27 20:39:16,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 586 transitions, 9195 flow [2024-06-27 20:39:17,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 586 transitions, 8994 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 20:39:17,677 INFO L231 Difference]: Finished difference. Result has 359 places, 556 transitions, 7841 flow [2024-06-27 20:39:17,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7320, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7841, PETRI_PLACES=359, PETRI_TRANSITIONS=556} [2024-06-27 20:39:17,678 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 318 predicate places. [2024-06-27 20:39:17,678 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 556 transitions, 7841 flow [2024-06-27 20:39:17,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:17,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:17,678 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-27 20:39:17,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 20:39:17,679 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:17,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:17,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1030298990, now seen corresponding path program 2 times [2024-06-27 20:39:17,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:17,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017656729] [2024-06-27 20:39:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:17,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:18,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:18,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017656729] [2024-06-27 20:39:18,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017656729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:18,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:18,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:18,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188498843] [2024-06-27 20:39:18,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:18,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:18,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:18,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:18,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:18,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 556 transitions, 7841 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:18,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:18,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:18,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:19,704 INFO L124 PetriNetUnfolderBase]: 4534/7021 cut-off events. [2024-06-27 20:39:19,705 INFO L125 PetriNetUnfolderBase]: For 559355/559369 co-relation queries the response was YES. [2024-06-27 20:39:19,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54554 conditions, 7021 events. 4534/7021 cut-off events. For 559355/559369 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 41267 event pairs, 942 based on Foata normal form. 16/7036 useless extension candidates. Maximal degree in co-relation 54394. Up to 6773 conditions per place. [2024-06-27 20:39:19,822 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 478 selfloop transitions, 100 changer transitions 0/581 dead transitions. [2024-06-27 20:39:19,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 581 transitions, 9087 flow [2024-06-27 20:39:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-27 20:39:19,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2024-06-27 20:39:19,823 INFO L175 Difference]: Start difference. First operand has 359 places, 556 transitions, 7841 flow. Second operand 9 states and 141 transitions. [2024-06-27 20:39:19,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 581 transitions, 9087 flow [2024-06-27 20:39:21,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 581 transitions, 8988 flow, removed 45 selfloop flow, removed 2 redundant places. [2024-06-27 20:39:21,474 INFO L231 Difference]: Finished difference. Result has 366 places, 556 transitions, 7949 flow [2024-06-27 20:39:21,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7742, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7949, PETRI_PLACES=366, PETRI_TRANSITIONS=556} [2024-06-27 20:39:21,474 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 325 predicate places. [2024-06-27 20:39:21,475 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 556 transitions, 7949 flow [2024-06-27 20:39:21,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:21,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:21,475 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-27 20:39:21,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 20:39:21,475 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:21,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash 657681156, now seen corresponding path program 3 times [2024-06-27 20:39:21,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:21,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924708336] [2024-06-27 20:39:21,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:22,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:22,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924708336] [2024-06-27 20:39:22,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924708336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:22,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:22,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:22,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033883214] [2024-06-27 20:39:22,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:22,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:22,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:22,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:22,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:22,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 556 transitions, 7949 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:22,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:22,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:22,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:23,691 INFO L124 PetriNetUnfolderBase]: 4594/7103 cut-off events. [2024-06-27 20:39:23,691 INFO L125 PetriNetUnfolderBase]: For 580020/580034 co-relation queries the response was YES. [2024-06-27 20:39:23,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55634 conditions, 7103 events. 4594/7103 cut-off events. For 580020/580034 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 41761 event pairs, 885 based on Foata normal form. 16/7118 useless extension candidates. Maximal degree in co-relation 55472. Up to 6790 conditions per place. [2024-06-27 20:39:23,793 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 488 selfloop transitions, 113 changer transitions 0/604 dead transitions. [2024-06-27 20:39:23,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 604 transitions, 9690 flow [2024-06-27 20:39:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:23,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-27 20:39:23,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-27 20:39:23,794 INFO L175 Difference]: Start difference. First operand has 366 places, 556 transitions, 7949 flow. Second operand 9 states and 149 transitions. [2024-06-27 20:39:23,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 604 transitions, 9690 flow [2024-06-27 20:39:25,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 604 transitions, 9474 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 20:39:25,624 INFO L231 Difference]: Finished difference. Result has 371 places, 576 transitions, 8315 flow [2024-06-27 20:39:25,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7752, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8315, PETRI_PLACES=371, PETRI_TRANSITIONS=576} [2024-06-27 20:39:25,625 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 330 predicate places. [2024-06-27 20:39:25,625 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 576 transitions, 8315 flow [2024-06-27 20:39:25,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:25,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:25,626 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-27 20:39:25,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 20:39:25,626 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:25,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash 663395076, now seen corresponding path program 4 times [2024-06-27 20:39:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:25,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882700140] [2024-06-27 20:39:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:25,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882700140] [2024-06-27 20:39:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882700140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:26,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:26,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:26,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583874402] [2024-06-27 20:39:26,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:26,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:26,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:26,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:26,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 576 transitions, 8315 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:26,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:26,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:26,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:27,731 INFO L124 PetriNetUnfolderBase]: 4604/7117 cut-off events. [2024-06-27 20:39:27,732 INFO L125 PetriNetUnfolderBase]: For 597172/597186 co-relation queries the response was YES. [2024-06-27 20:39:27,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56574 conditions, 7117 events. 4604/7117 cut-off events. For 597172/597186 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 41846 event pairs, 900 based on Foata normal form. 16/7132 useless extension candidates. Maximal degree in co-relation 56409. Up to 6867 conditions per place. [2024-06-27 20:39:27,838 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 497 selfloop transitions, 103 changer transitions 0/603 dead transitions. [2024-06-27 20:39:27,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 603 transitions, 9673 flow [2024-06-27 20:39:27,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-27 20:39:27,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-06-27 20:39:27,839 INFO L175 Difference]: Start difference. First operand has 371 places, 576 transitions, 8315 flow. Second operand 9 states and 143 transitions. [2024-06-27 20:39:27,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 603 transitions, 9673 flow [2024-06-27 20:39:29,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 603 transitions, 9525 flow, removed 53 selfloop flow, removed 3 redundant places. [2024-06-27 20:39:29,639 INFO L231 Difference]: Finished difference. Result has 377 places, 580 transitions, 8467 flow [2024-06-27 20:39:29,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8197, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8467, PETRI_PLACES=377, PETRI_TRANSITIONS=580} [2024-06-27 20:39:29,639 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 336 predicate places. [2024-06-27 20:39:29,639 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 580 transitions, 8467 flow [2024-06-27 20:39:29,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:29,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:29,640 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-27 20:39:29,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 20:39:29,640 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:29,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:29,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1628441466, now seen corresponding path program 5 times [2024-06-27 20:39:29,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:29,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420056247] [2024-06-27 20:39:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:30,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-27 20:39:30,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:30,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420056247] [2024-06-27 20:39:30,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420056247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:30,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:30,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:30,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226122379] [2024-06-27 20:39:30,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:30,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:30,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:30,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:30,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:30,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:30,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 580 transitions, 8467 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:30,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:30,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:30,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:31,945 INFO L124 PetriNetUnfolderBase]: 4638/7163 cut-off events. [2024-06-27 20:39:31,945 INFO L125 PetriNetUnfolderBase]: For 621857/621867 co-relation queries the response was YES. [2024-06-27 20:39:32,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57493 conditions, 7163 events. 4638/7163 cut-off events. For 621857/621867 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 42115 event pairs, 885 based on Foata normal form. 12/7174 useless extension candidates. Maximal degree in co-relation 57326. Up to 6684 conditions per place. [2024-06-27 20:39:32,059 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 478 selfloop transitions, 140 changer transitions 0/621 dead transitions. [2024-06-27 20:39:32,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 621 transitions, 10361 flow [2024-06-27 20:39:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 20:39:32,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-27 20:39:32,076 INFO L175 Difference]: Start difference. First operand has 377 places, 580 transitions, 8467 flow. Second operand 9 states and 151 transitions. [2024-06-27 20:39:32,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 621 transitions, 10361 flow [2024-06-27 20:39:34,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 621 transitions, 10206 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 20:39:34,025 INFO L231 Difference]: Finished difference. Result has 381 places, 591 transitions, 8818 flow [2024-06-27 20:39:34,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8312, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8818, PETRI_PLACES=381, PETRI_TRANSITIONS=591} [2024-06-27 20:39:34,026 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 340 predicate places. [2024-06-27 20:39:34,026 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 591 transitions, 8818 flow [2024-06-27 20:39:34,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:34,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:34,027 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-27 20:39:34,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 20:39:34,027 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:34,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1628620212, now seen corresponding path program 1 times [2024-06-27 20:39:34,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:34,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753231677] [2024-06-27 20:39:34,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:34,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:34,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:34,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753231677] [2024-06-27 20:39:34,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753231677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:34,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:34,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:34,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034304042] [2024-06-27 20:39:34,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:34,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:34,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:34,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:34,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:34,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:34,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 591 transitions, 8818 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:34,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:34,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:34,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:36,479 INFO L124 PetriNetUnfolderBase]: 4643/7174 cut-off events. [2024-06-27 20:39:36,480 INFO L125 PetriNetUnfolderBase]: For 637285/637289 co-relation queries the response was YES. [2024-06-27 20:39:36,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58337 conditions, 7174 events. 4643/7174 cut-off events. For 637285/637289 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 42320 event pairs, 1252 based on Foata normal form. 5/7178 useless extension candidates. Maximal degree in co-relation 58169. Up to 7089 conditions per place. [2024-06-27 20:39:36,573 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 590 selfloop transitions, 27 changer transitions 0/620 dead transitions. [2024-06-27 20:39:36,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 620 transitions, 10227 flow [2024-06-27 20:39:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-27 20:39:36,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-06-27 20:39:36,574 INFO L175 Difference]: Start difference. First operand has 381 places, 591 transitions, 8818 flow. Second operand 9 states and 136 transitions. [2024-06-27 20:39:36,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 620 transitions, 10227 flow [2024-06-27 20:39:38,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 620 transitions, 9983 flow, removed 74 selfloop flow, removed 4 redundant places. [2024-06-27 20:39:38,423 INFO L231 Difference]: Finished difference. Result has 387 places, 595 transitions, 8731 flow [2024-06-27 20:39:38,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8578, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8731, PETRI_PLACES=387, PETRI_TRANSITIONS=595} [2024-06-27 20:39:38,424 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 346 predicate places. [2024-06-27 20:39:38,424 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 595 transitions, 8731 flow [2024-06-27 20:39:38,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:38,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:38,424 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-27 20:39:38,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 20:39:38,425 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:38,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1628740182, now seen corresponding path program 2 times [2024-06-27 20:39:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:38,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159508011] [2024-06-27 20:39:38,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:39,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:39,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159508011] [2024-06-27 20:39:39,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159508011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:39,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:39,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:39,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081507921] [2024-06-27 20:39:39,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:39,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:39,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:39,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:39,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:39,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:39,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 595 transitions, 8731 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:39,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:39,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:39,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:40,642 INFO L124 PetriNetUnfolderBase]: 4656/7192 cut-off events. [2024-06-27 20:39:40,642 INFO L125 PetriNetUnfolderBase]: For 646115/646119 co-relation queries the response was YES. [2024-06-27 20:39:40,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58095 conditions, 7192 events. 4656/7192 cut-off events. For 646115/646119 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 42419 event pairs, 1259 based on Foata normal form. 5/7196 useless extension candidates. Maximal degree in co-relation 57924. Up to 7080 conditions per place. [2024-06-27 20:39:40,754 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 576 selfloop transitions, 45 changer transitions 0/624 dead transitions. [2024-06-27 20:39:40,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 624 transitions, 10375 flow [2024-06-27 20:39:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-27 20:39:40,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-27 20:39:40,755 INFO L175 Difference]: Start difference. First operand has 387 places, 595 transitions, 8731 flow. Second operand 9 states and 140 transitions. [2024-06-27 20:39:40,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 624 transitions, 10375 flow [2024-06-27 20:39:42,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 624 transitions, 10255 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 20:39:42,473 INFO L231 Difference]: Finished difference. Result has 390 places, 601 transitions, 8869 flow [2024-06-27 20:39:42,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8611, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8869, PETRI_PLACES=390, PETRI_TRANSITIONS=601} [2024-06-27 20:39:42,474 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 349 predicate places. [2024-06-27 20:39:42,474 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 601 transitions, 8869 flow [2024-06-27 20:39:42,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:42,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:42,474 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-27 20:39:42,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 20:39:42,475 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:42,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash 773270856, now seen corresponding path program 6 times [2024-06-27 20:39:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:42,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211478760] [2024-06-27 20:39:42,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:43,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211478760] [2024-06-27 20:39:43,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211478760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:43,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:43,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:43,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046481509] [2024-06-27 20:39:43,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:43,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:43,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:43,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:43,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:43,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 601 transitions, 8869 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:43,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:43,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:43,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:44,694 INFO L124 PetriNetUnfolderBase]: 4674/7213 cut-off events. [2024-06-27 20:39:44,694 INFO L125 PetriNetUnfolderBase]: For 669109/669119 co-relation queries the response was YES. [2024-06-27 20:39:44,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58723 conditions, 7213 events. 4674/7213 cut-off events. For 669109/669119 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 42429 event pairs, 878 based on Foata normal form. 12/7224 useless extension candidates. Maximal degree in co-relation 58551. Up to 6728 conditions per place. [2024-06-27 20:39:44,805 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 477 selfloop transitions, 154 changer transitions 0/634 dead transitions. [2024-06-27 20:39:44,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 634 transitions, 10645 flow [2024-06-27 20:39:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-27 20:39:44,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2024-06-27 20:39:44,807 INFO L175 Difference]: Start difference. First operand has 390 places, 601 transitions, 8869 flow. Second operand 9 states and 148 transitions. [2024-06-27 20:39:44,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 634 transitions, 10645 flow [2024-06-27 20:39:47,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 634 transitions, 10519 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-27 20:39:47,052 INFO L231 Difference]: Finished difference. Result has 394 places, 607 transitions, 9127 flow [2024-06-27 20:39:47,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8743, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9127, PETRI_PLACES=394, PETRI_TRANSITIONS=607} [2024-06-27 20:39:47,053 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 353 predicate places. [2024-06-27 20:39:47,053 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 607 transitions, 9127 flow [2024-06-27 20:39:47,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:47,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:47,054 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-27 20:39:47,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 20:39:47,054 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:47,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1667775712, now seen corresponding path program 3 times [2024-06-27 20:39:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:47,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705588288] [2024-06-27 20:39:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:47,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705588288] [2024-06-27 20:39:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705588288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:47,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:47,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218862263] [2024-06-27 20:39:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:47,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:47,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:47,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:47,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:47,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 607 transitions, 9127 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:47,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:47,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:47,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:49,310 INFO L124 PetriNetUnfolderBase]: 4671/7213 cut-off events. [2024-06-27 20:39:49,310 INFO L125 PetriNetUnfolderBase]: For 677631/677635 co-relation queries the response was YES. [2024-06-27 20:39:49,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59178 conditions, 7213 events. 4671/7213 cut-off events. For 677631/677635 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 42531 event pairs, 1259 based on Foata normal form. 5/7217 useless extension candidates. Maximal degree in co-relation 59004. Up to 7132 conditions per place. [2024-06-27 20:39:49,411 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 589 selfloop transitions, 34 changer transitions 0/626 dead transitions. [2024-06-27 20:39:49,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 626 transitions, 10435 flow [2024-06-27 20:39:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-27 20:39:49,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-27 20:39:49,412 INFO L175 Difference]: Start difference. First operand has 394 places, 607 transitions, 9127 flow. Second operand 9 states and 132 transitions. [2024-06-27 20:39:49,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 626 transitions, 10435 flow [2024-06-27 20:39:51,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 626 transitions, 10170 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-27 20:39:51,660 INFO L231 Difference]: Finished difference. Result has 398 places, 607 transitions, 8936 flow [2024-06-27 20:39:51,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8862, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8936, PETRI_PLACES=398, PETRI_TRANSITIONS=607} [2024-06-27 20:39:51,661 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 357 predicate places. [2024-06-27 20:39:51,661 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 607 transitions, 8936 flow [2024-06-27 20:39:51,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:51,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:51,661 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-27 20:39:51,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 20:39:51,661 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:51,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash -520239650, now seen corresponding path program 7 times [2024-06-27 20:39:51,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:51,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028555934] [2024-06-27 20:39:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:51,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:52,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:52,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028555934] [2024-06-27 20:39:52,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028555934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:52,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:52,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:52,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693995814] [2024-06-27 20:39:52,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:52,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:52,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:52,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:52,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:52,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 607 transitions, 8936 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:52,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:52,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:52,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:53,938 INFO L124 PetriNetUnfolderBase]: 4665/7201 cut-off events. [2024-06-27 20:39:53,939 INFO L125 PetriNetUnfolderBase]: For 685583/685593 co-relation queries the response was YES. [2024-06-27 20:39:54,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58757 conditions, 7201 events. 4665/7201 cut-off events. For 685583/685593 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 42346 event pairs, 899 based on Foata normal form. 12/7212 useless extension candidates. Maximal degree in co-relation 58582. Up to 6916 conditions per place. [2024-06-27 20:39:54,061 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 504 selfloop transitions, 122 changer transitions 0/629 dead transitions. [2024-06-27 20:39:54,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 629 transitions, 10442 flow [2024-06-27 20:39:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-27 20:39:54,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2024-06-27 20:39:54,063 INFO L175 Difference]: Start difference. First operand has 398 places, 607 transitions, 8936 flow. Second operand 9 states and 142 transitions. [2024-06-27 20:39:54,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 629 transitions, 10442 flow [2024-06-27 20:39:56,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 629 transitions, 10341 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-27 20:39:56,330 INFO L231 Difference]: Finished difference. Result has 399 places, 607 transitions, 9085 flow [2024-06-27 20:39:56,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8835, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9085, PETRI_PLACES=399, PETRI_TRANSITIONS=607} [2024-06-27 20:39:56,331 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 358 predicate places. [2024-06-27 20:39:56,331 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 607 transitions, 9085 flow [2024-06-27 20:39:56,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:56,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:39:56,331 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-27 20:39:56,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 20:39:56,332 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:39:56,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:39:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash -520359620, now seen corresponding path program 8 times [2024-06-27 20:39:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:39:56,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134649974] [2024-06-27 20:39:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:39:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:39:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:39:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:39:56,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:39:56,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134649974] [2024-06-27 20:39:56,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134649974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:39:56,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:39:56,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:39:56,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157007917] [2024-06-27 20:39:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:39:56,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:39:56,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:39:56,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:39:56,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:39:56,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:39:56,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 607 transitions, 9085 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:39:56,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:39:56,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:39:56,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:39:58,490 INFO L124 PetriNetUnfolderBase]: 4659/7193 cut-off events. [2024-06-27 20:39:58,490 INFO L125 PetriNetUnfolderBase]: For 693543/693553 co-relation queries the response was YES. [2024-06-27 20:39:58,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58899 conditions, 7193 events. 4659/7193 cut-off events. For 693543/693553 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 42319 event pairs, 898 based on Foata normal form. 12/7204 useless extension candidates. Maximal degree in co-relation 58723. Up to 6950 conditions per place. [2024-06-27 20:39:58,603 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 518 selfloop transitions, 106 changer transitions 0/627 dead transitions. [2024-06-27 20:39:58,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 627 transitions, 10403 flow [2024-06-27 20:39:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:39:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:39:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2024-06-27 20:39:58,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2024-06-27 20:39:58,605 INFO L175 Difference]: Start difference. First operand has 399 places, 607 transitions, 9085 flow. Second operand 9 states and 139 transitions. [2024-06-27 20:39:58,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 627 transitions, 10403 flow [2024-06-27 20:40:00,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 627 transitions, 10171 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 20:40:00,872 INFO L231 Difference]: Finished difference. Result has 402 places, 607 transitions, 9071 flow [2024-06-27 20:40:00,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8853, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9071, PETRI_PLACES=402, PETRI_TRANSITIONS=607} [2024-06-27 20:40:00,872 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 361 predicate places. [2024-06-27 20:40:00,872 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 607 transitions, 9071 flow [2024-06-27 20:40:00,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:00,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:00,873 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-27 20:40:00,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 20:40:00,873 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:00,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash 947675596, now seen corresponding path program 1 times [2024-06-27 20:40:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:00,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38901999] [2024-06-27 20:40:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:40:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:01,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38901999] [2024-06-27 20:40:01,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38901999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:01,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:01,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:40:01,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437893576] [2024-06-27 20:40:01,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:01,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:40:01,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:01,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:40:01,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:40:01,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:01,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 607 transitions, 9071 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:01,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:01,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:01,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:03,489 INFO L124 PetriNetUnfolderBase]: 4667/7209 cut-off events. [2024-06-27 20:40:03,489 INFO L125 PetriNetUnfolderBase]: For 709219/709223 co-relation queries the response was YES. [2024-06-27 20:40:03,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59151 conditions, 7209 events. 4667/7209 cut-off events. For 709219/709223 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 42583 event pairs, 1259 based on Foata normal form. 6/7214 useless extension candidates. Maximal degree in co-relation 58974. Up to 7096 conditions per place. [2024-06-27 20:40:03,601 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 574 selfloop transitions, 52 changer transitions 0/629 dead transitions. [2024-06-27 20:40:03,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 629 transitions, 10447 flow [2024-06-27 20:40:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:40:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:40:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2024-06-27 20:40:03,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38055555555555554 [2024-06-27 20:40:03,602 INFO L175 Difference]: Start difference. First operand has 402 places, 607 transitions, 9071 flow. Second operand 9 states and 137 transitions. [2024-06-27 20:40:03,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 629 transitions, 10447 flow [2024-06-27 20:40:05,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 629 transitions, 10227 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 20:40:05,684 INFO L231 Difference]: Finished difference. Result has 405 places, 609 transitions, 9024 flow [2024-06-27 20:40:05,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8851, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9024, PETRI_PLACES=405, PETRI_TRANSITIONS=609} [2024-06-27 20:40:05,685 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 364 predicate places. [2024-06-27 20:40:05,685 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 609 transitions, 9024 flow [2024-06-27 20:40:05,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:05,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:05,685 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-27 20:40:05,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 20:40:05,686 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:05,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:05,686 INFO L85 PathProgramCache]: Analyzing trace with hash 380237448, now seen corresponding path program 4 times [2024-06-27 20:40:05,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:05,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615922770] [2024-06-27 20:40:05,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:05,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:40:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615922770] [2024-06-27 20:40:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615922770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:06,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:06,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:40:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923281576] [2024-06-27 20:40:06,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:06,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:40:06,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:06,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:40:06,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:40:06,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:06,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 609 transitions, 9024 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:06,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:06,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:06,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:08,384 INFO L124 PetriNetUnfolderBase]: 4675/7222 cut-off events. [2024-06-27 20:40:08,384 INFO L125 PetriNetUnfolderBase]: For 724838/724846 co-relation queries the response was YES. [2024-06-27 20:40:08,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59352 conditions, 7222 events. 4675/7222 cut-off events. For 724838/724846 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 42462 event pairs, 1081 based on Foata normal form. 10/7231 useless extension candidates. Maximal degree in co-relation 59174. Up to 6788 conditions per place. [2024-06-27 20:40:08,493 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 523 selfloop transitions, 111 changer transitions 0/637 dead transitions. [2024-06-27 20:40:08,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 637 transitions, 10588 flow [2024-06-27 20:40:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-27 20:40:08,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-27 20:40:08,495 INFO L175 Difference]: Start difference. First operand has 405 places, 609 transitions, 9024 flow. Second operand 8 states and 130 transitions. [2024-06-27 20:40:08,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 637 transitions, 10588 flow [2024-06-27 20:40:10,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 637 transitions, 10426 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-27 20:40:10,925 INFO L231 Difference]: Finished difference. Result has 407 places, 611 transitions, 9126 flow [2024-06-27 20:40:10,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8862, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9126, PETRI_PLACES=407, PETRI_TRANSITIONS=611} [2024-06-27 20:40:10,926 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 366 predicate places. [2024-06-27 20:40:10,926 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 611 transitions, 9126 flow [2024-06-27 20:40:10,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:10,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:10,927 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-27 20:40:10,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 20:40:10,927 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:10,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1711513104, now seen corresponding path program 5 times [2024-06-27 20:40:10,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:10,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408345691] [2024-06-27 20:40:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:10,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:40:11,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:11,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408345691] [2024-06-27 20:40:11,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408345691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:11,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:11,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:40:11,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9825255] [2024-06-27 20:40:11,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:11,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:40:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:11,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:40:11,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:40:11,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:11,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 611 transitions, 9126 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:11,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:11,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:11,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:13,693 INFO L124 PetriNetUnfolderBase]: 4691/7248 cut-off events. [2024-06-27 20:40:13,694 INFO L125 PetriNetUnfolderBase]: For 740175/740179 co-relation queries the response was YES. [2024-06-27 20:40:13,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59741 conditions, 7248 events. 4691/7248 cut-off events. For 740175/740179 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 42813 event pairs, 1225 based on Foata normal form. 6/7253 useless extension candidates. Maximal degree in co-relation 59563. Up to 6986 conditions per place. [2024-06-27 20:40:13,794 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 528 selfloop transitions, 106 changer transitions 0/637 dead transitions. [2024-06-27 20:40:13,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 637 transitions, 10532 flow [2024-06-27 20:40:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-27 20:40:13,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-27 20:40:13,797 INFO L175 Difference]: Start difference. First operand has 407 places, 611 transitions, 9126 flow. Second operand 8 states and 126 transitions. [2024-06-27 20:40:13,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 637 transitions, 10532 flow [2024-06-27 20:40:16,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 637 transitions, 10331 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 20:40:16,143 INFO L231 Difference]: Finished difference. Result has 409 places, 615 transitions, 9210 flow [2024-06-27 20:40:16,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8929, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9210, PETRI_PLACES=409, PETRI_TRANSITIONS=615} [2024-06-27 20:40:16,144 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 368 predicate places. [2024-06-27 20:40:16,144 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 615 transitions, 9210 flow [2024-06-27 20:40:16,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:16,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:16,145 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-27 20:40:16,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 20:40:16,145 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:16,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash 97766874, now seen corresponding path program 9 times [2024-06-27 20:40:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:16,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564961083] [2024-06-27 20:40:16,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:16,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:16,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-27 20:40:16,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:16,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564961083] [2024-06-27 20:40:16,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564961083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:16,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:16,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:40:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906958878] [2024-06-27 20:40:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:16,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:40:16,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:16,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:40:16,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:40:16,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:16,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 615 transitions, 9210 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:16,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:16,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:16,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:18,405 INFO L124 PetriNetUnfolderBase]: 4717/7282 cut-off events. [2024-06-27 20:40:18,405 INFO L125 PetriNetUnfolderBase]: For 734834/734848 co-relation queries the response was YES. [2024-06-27 20:40:18,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60063 conditions, 7282 events. 4717/7282 cut-off events. For 734834/734848 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 42996 event pairs, 902 based on Foata normal form. 16/7297 useless extension candidates. Maximal degree in co-relation 59885. Up to 6879 conditions per place. [2024-06-27 20:40:18,519 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 506 selfloop transitions, 139 changer transitions 0/648 dead transitions. [2024-06-27 20:40:18,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 648 transitions, 10913 flow [2024-06-27 20:40:18,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-27 20:40:18,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-27 20:40:18,521 INFO L175 Difference]: Start difference. First operand has 409 places, 615 transitions, 9210 flow. Second operand 8 states and 132 transitions. [2024-06-27 20:40:18,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 648 transitions, 10913 flow [2024-06-27 20:40:20,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 648 transitions, 10698 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 20:40:20,861 INFO L231 Difference]: Finished difference. Result has 412 places, 622 transitions, 9476 flow [2024-06-27 20:40:20,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8995, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9476, PETRI_PLACES=412, PETRI_TRANSITIONS=622} [2024-06-27 20:40:20,862 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 371 predicate places. [2024-06-27 20:40:20,862 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 622 transitions, 9476 flow [2024-06-27 20:40:20,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:20,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:20,863 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-27 20:40:20,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 20:40:20,863 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:20,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash 103480794, now seen corresponding path program 10 times [2024-06-27 20:40:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660623086] [2024-06-27 20:40:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:21,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:40:21,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:21,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660623086] [2024-06-27 20:40:21,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660623086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:21,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:21,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:40:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400684337] [2024-06-27 20:40:21,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:21,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:40:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:21,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:40:21,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:40:21,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:21,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 622 transitions, 9476 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:21,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:21,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:21,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:23,145 INFO L124 PetriNetUnfolderBase]: 4727/7295 cut-off events. [2024-06-27 20:40:23,145 INFO L125 PetriNetUnfolderBase]: For 754422/754436 co-relation queries the response was YES. [2024-06-27 20:40:23,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61119 conditions, 7295 events. 4727/7295 cut-off events. For 754422/754436 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 43059 event pairs, 954 based on Foata normal form. 16/7310 useless extension candidates. Maximal degree in co-relation 60939. Up to 7030 conditions per place. [2024-06-27 20:40:23,265 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 529 selfloop transitions, 115 changer transitions 0/647 dead transitions. [2024-06-27 20:40:23,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 647 transitions, 10925 flow [2024-06-27 20:40:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-27 20:40:23,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-27 20:40:23,267 INFO L175 Difference]: Start difference. First operand has 412 places, 622 transitions, 9476 flow. Second operand 8 states and 126 transitions. [2024-06-27 20:40:23,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 647 transitions, 10925 flow [2024-06-27 20:40:25,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 647 transitions, 10680 flow, removed 59 selfloop flow, removed 5 redundant places. [2024-06-27 20:40:25,787 INFO L231 Difference]: Finished difference. Result has 415 places, 626 transitions, 9568 flow [2024-06-27 20:40:25,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9265, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9568, PETRI_PLACES=415, PETRI_TRANSITIONS=626} [2024-06-27 20:40:25,787 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 374 predicate places. [2024-06-27 20:40:25,787 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 626 transitions, 9568 flow [2024-06-27 20:40:25,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:25,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:25,788 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-27 20:40:25,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 20:40:25,788 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:25,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1274347282, now seen corresponding path program 11 times [2024-06-27 20:40:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709428485] [2024-06-27 20:40:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:25,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:40:26,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:26,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709428485] [2024-06-27 20:40:26,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709428485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:26,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:26,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:40:26,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983115600] [2024-06-27 20:40:26,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:26,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:40:26,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:40:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:40:26,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:26,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 626 transitions, 9568 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:26,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:26,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:26,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:28,031 INFO L124 PetriNetUnfolderBase]: 4761/7338 cut-off events. [2024-06-27 20:40:28,031 INFO L125 PetriNetUnfolderBase]: For 751324/751334 co-relation queries the response was YES. [2024-06-27 20:40:28,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61737 conditions, 7338 events. 4761/7338 cut-off events. For 751324/751334 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 43251 event pairs, 879 based on Foata normal form. 12/7349 useless extension candidates. Maximal degree in co-relation 61556. Up to 6740 conditions per place. [2024-06-27 20:40:28,154 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 483 selfloop transitions, 176 changer transitions 0/662 dead transitions. [2024-06-27 20:40:28,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 662 transitions, 11563 flow [2024-06-27 20:40:28,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-27 20:40:28,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-27 20:40:28,155 INFO L175 Difference]: Start difference. First operand has 415 places, 626 transitions, 9568 flow. Second operand 8 states and 133 transitions. [2024-06-27 20:40:28,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 662 transitions, 11563 flow [2024-06-27 20:40:30,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 662 transitions, 11352 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-27 20:40:30,556 INFO L231 Difference]: Finished difference. Result has 417 places, 636 transitions, 9944 flow [2024-06-27 20:40:30,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9365, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9944, PETRI_PLACES=417, PETRI_TRANSITIONS=636} [2024-06-27 20:40:30,556 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 376 predicate places. [2024-06-27 20:40:30,557 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 636 transitions, 9944 flow [2024-06-27 20:40:30,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:30,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:30,557 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-27 20:40:30,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 20:40:30,557 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:30,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1274526028, now seen corresponding path program 4 times [2024-06-27 20:40:30,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:30,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780953568] [2024-06-27 20:40:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:30,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:40:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780953568] [2024-06-27 20:40:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780953568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:31,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:31,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:40:31,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569959747] [2024-06-27 20:40:31,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:31,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:40:31,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:31,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:40:31,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:40:31,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:31,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 636 transitions, 9944 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:31,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:31,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:31,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:32,916 INFO L124 PetriNetUnfolderBase]: 4766/7349 cut-off events. [2024-06-27 20:40:32,917 INFO L125 PetriNetUnfolderBase]: For 738501/738505 co-relation queries the response was YES. [2024-06-27 20:40:33,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62298 conditions, 7349 events. 4766/7349 cut-off events. For 738501/738505 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 43488 event pairs, 1260 based on Foata normal form. 5/7353 useless extension candidates. Maximal degree in co-relation 62118. Up to 7243 conditions per place. [2024-06-27 20:40:33,028 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 623 selfloop transitions, 34 changer transitions 0/660 dead transitions. [2024-06-27 20:40:33,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 660 transitions, 11426 flow [2024-06-27 20:40:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-27 20:40:33,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-27 20:40:33,029 INFO L175 Difference]: Start difference. First operand has 417 places, 636 transitions, 9944 flow. Second operand 8 states and 121 transitions. [2024-06-27 20:40:33,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 660 transitions, 11426 flow [2024-06-27 20:40:35,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 660 transitions, 11200 flow, removed 69 selfloop flow, removed 4 redundant places. [2024-06-27 20:40:35,411 INFO L231 Difference]: Finished difference. Result has 421 places, 639 transitions, 9892 flow [2024-06-27 20:40:35,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9722, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9892, PETRI_PLACES=421, PETRI_TRANSITIONS=639} [2024-06-27 20:40:35,412 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 380 predicate places. [2024-06-27 20:40:35,412 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 639 transitions, 9892 flow [2024-06-27 20:40:35,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:35,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:35,412 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-27 20:40:35,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 20:40:35,413 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:35,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash 213356574, now seen corresponding path program 12 times [2024-06-27 20:40:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:35,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537252036] [2024-06-27 20:40:35,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:35,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-27 20:40:35,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:35,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537252036] [2024-06-27 20:40:35,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537252036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:35,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:35,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:40:35,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831279728] [2024-06-27 20:40:35,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:35,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:40:35,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:35,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:40:35,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:40:35,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:35,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 639 transitions, 9892 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:35,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:35,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:35,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:37,720 INFO L124 PetriNetUnfolderBase]: 4784/7370 cut-off events. [2024-06-27 20:40:37,720 INFO L125 PetriNetUnfolderBase]: For 736973/736983 co-relation queries the response was YES. [2024-06-27 20:40:37,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61923 conditions, 7370 events. 4784/7370 cut-off events. For 736973/736983 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 43448 event pairs, 871 based on Foata normal form. 12/7381 useless extension candidates. Maximal degree in co-relation 61742. Up to 6766 conditions per place. [2024-06-27 20:40:37,842 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 475 selfloop transitions, 190 changer transitions 0/668 dead transitions. [2024-06-27 20:40:37,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 668 transitions, 11752 flow [2024-06-27 20:40:37,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-27 20:40:37,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-27 20:40:37,844 INFO L175 Difference]: Start difference. First operand has 421 places, 639 transitions, 9892 flow. Second operand 8 states and 130 transitions. [2024-06-27 20:40:37,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 668 transitions, 11752 flow [2024-06-27 20:40:40,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 668 transitions, 11591 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-27 20:40:40,246 INFO L231 Difference]: Finished difference. Result has 422 places, 645 transitions, 10203 flow [2024-06-27 20:40:40,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9731, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10203, PETRI_PLACES=422, PETRI_TRANSITIONS=645} [2024-06-27 20:40:40,247 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 381 predicate places. [2024-06-27 20:40:40,247 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 645 transitions, 10203 flow [2024-06-27 20:40:40,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:40,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:40,247 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-27 20:40:40,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 20:40:40,247 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:40,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 213356760, now seen corresponding path program 5 times [2024-06-27 20:40:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711040471] [2024-06-27 20:40:40,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:40,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:40:40,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:40,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711040471] [2024-06-27 20:40:40,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711040471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:40,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:40,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:40:40,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007878080] [2024-06-27 20:40:40,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:40,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:40:40,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:40,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:40:40,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:40:40,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:40,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 645 transitions, 10203 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:40,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:40,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:40,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:42,611 INFO L124 PetriNetUnfolderBase]: 4797/7392 cut-off events. [2024-06-27 20:40:42,612 INFO L125 PetriNetUnfolderBase]: For 756348/756352 co-relation queries the response was YES. [2024-06-27 20:40:42,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62903 conditions, 7392 events. 4797/7392 cut-off events. For 756348/756352 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 43703 event pairs, 1262 based on Foata normal form. 5/7396 useless extension candidates. Maximal degree in co-relation 62721. Up to 7242 conditions per place. [2024-06-27 20:40:42,730 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 603 selfloop transitions, 64 changer transitions 0/670 dead transitions. [2024-06-27 20:40:42,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 670 transitions, 11967 flow [2024-06-27 20:40:42,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-27 20:40:42,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-27 20:40:42,731 INFO L175 Difference]: Start difference. First operand has 422 places, 645 transitions, 10203 flow. Second operand 8 states and 124 transitions. [2024-06-27 20:40:42,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 670 transitions, 11967 flow [2024-06-27 20:40:45,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 670 transitions, 11722 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-27 20:40:45,190 INFO L231 Difference]: Finished difference. Result has 425 places, 651 transitions, 10288 flow [2024-06-27 20:40:45,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9960, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10288, PETRI_PLACES=425, PETRI_TRANSITIONS=651} [2024-06-27 20:40:45,190 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 384 predicate places. [2024-06-27 20:40:45,190 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 651 transitions, 10288 flow [2024-06-27 20:40:45,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:45,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:45,191 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-27 20:40:45,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 20:40:45,191 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:45,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1451657362, now seen corresponding path program 13 times [2024-06-27 20:40:45,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:45,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057985806] [2024-06-27 20:40:45,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:45,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:40:45,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:45,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057985806] [2024-06-27 20:40:45,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057985806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:45,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:45,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:40:45,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189338926] [2024-06-27 20:40:45,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:45,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:40:45,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:45,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:40:45,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:40:45,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:45,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 651 transitions, 10288 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:45,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:45,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:45,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:47,446 INFO L124 PetriNetUnfolderBase]: 4807/7402 cut-off events. [2024-06-27 20:40:47,446 INFO L125 PetriNetUnfolderBase]: For 760274/760284 co-relation queries the response was YES. [2024-06-27 20:40:47,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62909 conditions, 7402 events. 4807/7402 cut-off events. For 760274/760284 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 43691 event pairs, 907 based on Foata normal form. 12/7413 useless extension candidates. Maximal degree in co-relation 62727. Up to 7153 conditions per place. [2024-06-27 20:40:47,565 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 560 selfloop transitions, 108 changer transitions 0/671 dead transitions. [2024-06-27 20:40:47,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 671 transitions, 11747 flow [2024-06-27 20:40:47,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-27 20:40:47,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-27 20:40:47,567 INFO L175 Difference]: Start difference. First operand has 425 places, 651 transitions, 10288 flow. Second operand 8 states and 122 transitions. [2024-06-27 20:40:47,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 671 transitions, 11747 flow [2024-06-27 20:40:50,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 671 transitions, 11603 flow, removed 48 selfloop flow, removed 5 redundant places. [2024-06-27 20:40:50,531 INFO L231 Difference]: Finished difference. Result has 429 places, 655 transitions, 10451 flow [2024-06-27 20:40:50,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10144, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10451, PETRI_PLACES=429, PETRI_TRANSITIONS=655} [2024-06-27 20:40:50,532 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 388 predicate places. [2024-06-27 20:40:50,532 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 655 transitions, 10451 flow [2024-06-27 20:40:50,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:50,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:50,532 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-27 20:40:50,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-27 20:40:50,533 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:50,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:50,533 INFO L85 PathProgramCache]: Analyzing trace with hash 390488094, now seen corresponding path program 14 times [2024-06-27 20:40:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:50,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041163729] [2024-06-27 20:40:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:40:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041163729] [2024-06-27 20:40:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041163729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:51,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:51,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:40:51,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142952137] [2024-06-27 20:40:51,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:51,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:40:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:51,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:40:51,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:40:51,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:51,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 655 transitions, 10451 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:51,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:51,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:51,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:53,019 INFO L124 PetriNetUnfolderBase]: 4825/7427 cut-off events. [2024-06-27 20:40:53,020 INFO L125 PetriNetUnfolderBase]: For 765255/765265 co-relation queries the response was YES. [2024-06-27 20:40:53,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63374 conditions, 7427 events. 4825/7427 cut-off events. For 765255/765265 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 43782 event pairs, 907 based on Foata normal form. 12/7438 useless extension candidates. Maximal degree in co-relation 63190. Up to 7118 conditions per place. [2024-06-27 20:40:53,130 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 542 selfloop transitions, 134 changer transitions 0/679 dead transitions. [2024-06-27 20:40:53,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 679 transitions, 12139 flow [2024-06-27 20:40:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-27 20:40:53,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-27 20:40:53,132 INFO L175 Difference]: Start difference. First operand has 429 places, 655 transitions, 10451 flow. Second operand 8 states and 125 transitions. [2024-06-27 20:40:53,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 679 transitions, 12139 flow [2024-06-27 20:40:55,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 679 transitions, 11962 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-27 20:40:55,593 INFO L231 Difference]: Finished difference. Result has 433 places, 661 transitions, 10699 flow [2024-06-27 20:40:55,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10276, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10699, PETRI_PLACES=433, PETRI_TRANSITIONS=661} [2024-06-27 20:40:55,594 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 392 predicate places. [2024-06-27 20:40:55,594 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 661 transitions, 10699 flow [2024-06-27 20:40:55,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:55,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:40:55,595 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-27 20:40:55,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-27 20:40:55,595 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:40:55,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:40:55,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1209980168, now seen corresponding path program 4 times [2024-06-27 20:40:55,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:40:55,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427497862] [2024-06-27 20:40:55,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:40:55,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:40:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:40:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:40:56,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:40:56,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427497862] [2024-06-27 20:40:56,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427497862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:40:56,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:40:56,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:40:56,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633608348] [2024-06-27 20:40:56,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:40:56,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:40:56,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:40:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:40:56,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:40:56,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:40:56,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 661 transitions, 10699 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:40:56,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:40:56,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:40:56,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:40:58,155 INFO L124 PetriNetUnfolderBase]: 4835/7445 cut-off events. [2024-06-27 20:40:58,155 INFO L125 PetriNetUnfolderBase]: For 767893/767897 co-relation queries the response was YES. [2024-06-27 20:40:58,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63711 conditions, 7445 events. 4835/7445 cut-off events. For 767893/767897 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 44003 event pairs, 1267 based on Foata normal form. 6/7450 useless extension candidates. Maximal degree in co-relation 63526. Up to 7343 conditions per place. [2024-06-27 20:40:58,258 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 633 selfloop transitions, 45 changer transitions 0/681 dead transitions. [2024-06-27 20:40:58,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 681 transitions, 12172 flow [2024-06-27 20:40:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:40:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:40:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-27 20:40:58,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-27 20:40:58,259 INFO L175 Difference]: Start difference. First operand has 433 places, 661 transitions, 10699 flow. Second operand 8 states and 120 transitions. [2024-06-27 20:40:58,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 681 transitions, 12172 flow [2024-06-27 20:41:00,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 681 transitions, 11931 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 20:41:00,716 INFO L231 Difference]: Finished difference. Result has 435 places, 665 transitions, 10621 flow [2024-06-27 20:41:00,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10458, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10621, PETRI_PLACES=435, PETRI_TRANSITIONS=665} [2024-06-27 20:41:00,717 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 394 predicate places. [2024-06-27 20:41:00,717 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 665 transitions, 10621 flow [2024-06-27 20:41:00,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:00,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:00,717 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-27 20:41:00,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-27 20:41:00,718 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:00,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash 390488280, now seen corresponding path program 6 times [2024-06-27 20:41:00,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:00,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909942379] [2024-06-27 20:41:00,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:00,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:41:01,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:01,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909942379] [2024-06-27 20:41:01,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909942379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:01,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:01,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:41:01,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772304901] [2024-06-27 20:41:01,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:01,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:41:01,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:01,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:41:01,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:41:01,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:01,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 665 transitions, 10621 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:01,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:01,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:01,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:02,984 INFO L124 PetriNetUnfolderBase]: 4840/7452 cut-off events. [2024-06-27 20:41:02,985 INFO L125 PetriNetUnfolderBase]: For 762859/762863 co-relation queries the response was YES. [2024-06-27 20:41:03,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63583 conditions, 7452 events. 4840/7452 cut-off events. For 762859/762863 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 44071 event pairs, 1266 based on Foata normal form. 5/7456 useless extension candidates. Maximal degree in co-relation 63398. Up to 7365 conditions per place. [2024-06-27 20:41:03,106 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 641 selfloop transitions, 39 changer transitions 0/683 dead transitions. [2024-06-27 20:41:03,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 683 transitions, 12115 flow [2024-06-27 20:41:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:41:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:41:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-27 20:41:03,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-27 20:41:03,108 INFO L175 Difference]: Start difference. First operand has 435 places, 665 transitions, 10621 flow. Second operand 8 states and 117 transitions. [2024-06-27 20:41:03,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 683 transitions, 12115 flow [2024-06-27 20:41:05,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 683 transitions, 12037 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-27 20:41:05,743 INFO L231 Difference]: Finished difference. Result has 440 places, 668 transitions, 10721 flow [2024-06-27 20:41:05,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10543, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10721, PETRI_PLACES=440, PETRI_TRANSITIONS=668} [2024-06-27 20:41:05,744 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 399 predicate places. [2024-06-27 20:41:05,744 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 668 transitions, 10721 flow [2024-06-27 20:41:05,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:05,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:05,744 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-27 20:41:05,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-27 20:41:05,744 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:05,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:05,745 INFO L85 PathProgramCache]: Analyzing trace with hash 390488466, now seen corresponding path program 5 times [2024-06-27 20:41:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:05,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632524248] [2024-06-27 20:41:05,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:05,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:41:06,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:06,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632524248] [2024-06-27 20:41:06,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632524248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:06,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:06,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:41:06,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276434037] [2024-06-27 20:41:06,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:06,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:41:06,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:06,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:41:06,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:41:06,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:06,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 668 transitions, 10721 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:06,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:06,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:06,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:08,233 INFO L124 PetriNetUnfolderBase]: 4850/7466 cut-off events. [2024-06-27 20:41:08,234 INFO L125 PetriNetUnfolderBase]: For 782740/782744 co-relation queries the response was YES. [2024-06-27 20:41:08,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63845 conditions, 7466 events. 4850/7466 cut-off events. For 782740/782744 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 44172 event pairs, 1267 based on Foata normal form. 6/7471 useless extension candidates. Maximal degree in co-relation 63659. Up to 7346 conditions per place. [2024-06-27 20:41:08,356 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 630 selfloop transitions, 55 changer transitions 0/688 dead transitions. [2024-06-27 20:41:08,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 688 transitions, 12219 flow [2024-06-27 20:41:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:41:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:41:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-27 20:41:08,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-27 20:41:08,357 INFO L175 Difference]: Start difference. First operand has 440 places, 668 transitions, 10721 flow. Second operand 8 states and 123 transitions. [2024-06-27 20:41:08,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 688 transitions, 12219 flow [2024-06-27 20:41:11,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 688 transitions, 12077 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-27 20:41:11,111 INFO L231 Difference]: Finished difference. Result has 441 places, 671 transitions, 10763 flow [2024-06-27 20:41:11,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10579, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10763, PETRI_PLACES=441, PETRI_TRANSITIONS=671} [2024-06-27 20:41:11,111 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 400 predicate places. [2024-06-27 20:41:11,112 INFO L495 AbstractCegarLoop]: Abstraction has has 441 places, 671 transitions, 10763 flow [2024-06-27 20:41:11,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:11,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:11,112 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-27 20:41:11,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-27 20:41:11,112 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:11,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1607786838, now seen corresponding path program 6 times [2024-06-27 20:41:11,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:11,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765702510] [2024-06-27 20:41:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:41:12,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:12,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765702510] [2024-06-27 20:41:12,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765702510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:12,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:12,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:41:12,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367355717] [2024-06-27 20:41:12,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:12,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:41:12,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:12,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:41:12,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:41:12,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:12,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 671 transitions, 10763 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:12,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:12,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:12,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:14,034 INFO L124 PetriNetUnfolderBase]: 4858/7474 cut-off events. [2024-06-27 20:41:14,034 INFO L125 PetriNetUnfolderBase]: For 781161/781171 co-relation queries the response was YES. [2024-06-27 20:41:14,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63938 conditions, 7474 events. 4858/7474 cut-off events. For 781161/781171 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 44084 event pairs, 907 based on Foata normal form. 12/7485 useless extension candidates. Maximal degree in co-relation 63752. Up to 7225 conditions per place. [2024-06-27 20:41:14,159 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 582 selfloop transitions, 104 changer transitions 0/689 dead transitions. [2024-06-27 20:41:14,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 689 transitions, 12219 flow [2024-06-27 20:41:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:41:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:41:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-27 20:41:14,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-27 20:41:14,160 INFO L175 Difference]: Start difference. First operand has 441 places, 671 transitions, 10763 flow. Second operand 8 states and 122 transitions. [2024-06-27 20:41:14,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 689 transitions, 12219 flow [2024-06-27 20:41:16,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 689 transitions, 12077 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 20:41:16,639 INFO L231 Difference]: Finished difference. Result has 443 places, 673 transitions, 10873 flow [2024-06-27 20:41:16,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10621, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10873, PETRI_PLACES=443, PETRI_TRANSITIONS=673} [2024-06-27 20:41:16,639 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 402 predicate places. [2024-06-27 20:41:16,640 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 673 transitions, 10873 flow [2024-06-27 20:41:16,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:16,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:16,640 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-27 20:41:16,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-27 20:41:16,640 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:16,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash 390734544, now seen corresponding path program 2 times [2024-06-27 20:41:16,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:16,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767089438] [2024-06-27 20:41:16,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:16,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:17,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-27 20:41:17,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:17,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767089438] [2024-06-27 20:41:17,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767089438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:17,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:17,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:41:17,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272788539] [2024-06-27 20:41:17,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:17,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:41:17,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:17,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:41:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:41:17,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:17,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 673 transitions, 10873 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:17,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:17,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:17,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:19,554 INFO L124 PetriNetUnfolderBase]: 4866/7490 cut-off events. [2024-06-27 20:41:19,555 INFO L125 PetriNetUnfolderBase]: For 800278/800282 co-relation queries the response was YES. [2024-06-27 20:41:19,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64356 conditions, 7490 events. 4866/7490 cut-off events. For 800278/800282 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 44368 event pairs, 1268 based on Foata normal form. 6/7495 useless extension candidates. Maximal degree in co-relation 64169. Up to 7371 conditions per place. [2024-06-27 20:41:19,683 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 634 selfloop transitions, 54 changer transitions 0/691 dead transitions. [2024-06-27 20:41:19,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 691 transitions, 12369 flow [2024-06-27 20:41:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:41:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:41:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-27 20:41:19,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-27 20:41:19,685 INFO L175 Difference]: Start difference. First operand has 443 places, 673 transitions, 10873 flow. Second operand 8 states and 122 transitions. [2024-06-27 20:41:19,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 691 transitions, 12369 flow [2024-06-27 20:41:22,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 691 transitions, 12147 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 20:41:22,324 INFO L231 Difference]: Finished difference. Result has 445 places, 675 transitions, 10839 flow [2024-06-27 20:41:22,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10651, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10839, PETRI_PLACES=445, PETRI_TRANSITIONS=675} [2024-06-27 20:41:22,325 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 404 predicate places. [2024-06-27 20:41:22,325 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 675 transitions, 10839 flow [2024-06-27 20:41:22,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:22,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:22,326 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-27 20:41:22,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-27 20:41:22,326 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:22,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1134163180, now seen corresponding path program 7 times [2024-06-27 20:41:22,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:22,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410239826] [2024-06-27 20:41:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:41:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410239826] [2024-06-27 20:41:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410239826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:22,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:22,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:41:22,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693217430] [2024-06-27 20:41:22,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:22,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:41:22,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:22,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:41:22,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:41:22,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:22,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 675 transitions, 10839 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:22,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:22,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:22,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:24,857 INFO L124 PetriNetUnfolderBase]: 4887/7523 cut-off events. [2024-06-27 20:41:24,858 INFO L125 PetriNetUnfolderBase]: For 823704/823712 co-relation queries the response was YES. [2024-06-27 20:41:24,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65110 conditions, 7523 events. 4887/7523 cut-off events. For 823704/823712 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 44563 event pairs, 1268 based on Foata normal form. 9/7530 useless extension candidates. Maximal degree in co-relation 64922. Up to 7354 conditions per place. [2024-06-27 20:41:24,970 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 649 selfloop transitions, 57 changer transitions 0/709 dead transitions. [2024-06-27 20:41:24,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 709 transitions, 13016 flow [2024-06-27 20:41:24,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:41:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:41:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-06-27 20:41:24,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365 [2024-06-27 20:41:24,971 INFO L175 Difference]: Start difference. First operand has 445 places, 675 transitions, 10839 flow. Second operand 10 states and 146 transitions. [2024-06-27 20:41:24,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 709 transitions, 13016 flow [2024-06-27 20:41:27,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 709 transitions, 12854 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-27 20:41:27,522 INFO L231 Difference]: Finished difference. Result has 450 places, 686 transitions, 11135 flow [2024-06-27 20:41:27,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10677, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11135, PETRI_PLACES=450, PETRI_TRANSITIONS=686} [2024-06-27 20:41:27,522 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 409 predicate places. [2024-06-27 20:41:27,522 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 686 transitions, 11135 flow [2024-06-27 20:41:27,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:27,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:27,523 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-27 20:41:27,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-27 20:41:27,523 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:27,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:27,523 INFO L85 PathProgramCache]: Analyzing trace with hash 644354664, now seen corresponding path program 8 times [2024-06-27 20:41:27,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:27,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020500518] [2024-06-27 20:41:27,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:27,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:41:28,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:28,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020500518] [2024-06-27 20:41:28,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020500518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:28,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:28,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:41:28,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664954951] [2024-06-27 20:41:28,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:28,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:41:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:28,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:41:28,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:41:28,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:28,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 686 transitions, 11135 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:28,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:28,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:28,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:30,183 INFO L124 PetriNetUnfolderBase]: 4884/7519 cut-off events. [2024-06-27 20:41:30,184 INFO L125 PetriNetUnfolderBase]: For 836864/836872 co-relation queries the response was YES. [2024-06-27 20:41:30,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65362 conditions, 7519 events. 4884/7519 cut-off events. For 836864/836872 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 44561 event pairs, 1261 based on Foata normal form. 9/7526 useless extension candidates. Maximal degree in co-relation 65172. Up to 7351 conditions per place. [2024-06-27 20:41:30,289 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 644 selfloop transitions, 56 changer transitions 0/703 dead transitions. [2024-06-27 20:41:30,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 703 transitions, 12783 flow [2024-06-27 20:41:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:41:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:41:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-27 20:41:30,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-27 20:41:30,290 INFO L175 Difference]: Start difference. First operand has 450 places, 686 transitions, 11135 flow. Second operand 8 states and 120 transitions. [2024-06-27 20:41:30,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 703 transitions, 12783 flow [2024-06-27 20:41:32,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 703 transitions, 12523 flow, removed 105 selfloop flow, removed 5 redundant places. [2024-06-27 20:41:32,747 INFO L231 Difference]: Finished difference. Result has 453 places, 686 transitions, 10993 flow [2024-06-27 20:41:32,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10875, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10993, PETRI_PLACES=453, PETRI_TRANSITIONS=686} [2024-06-27 20:41:32,748 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 412 predicate places. [2024-06-27 20:41:32,748 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 686 transitions, 10993 flow [2024-06-27 20:41:32,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:32,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:32,748 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-27 20:41:32,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-27 20:41:32,749 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:32,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash 404846928, now seen corresponding path program 15 times [2024-06-27 20:41:32,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:32,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801397536] [2024-06-27 20:41:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:41:33,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:33,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801397536] [2024-06-27 20:41:33,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801397536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:33,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:33,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:41:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818272110] [2024-06-27 20:41:33,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:33,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:41:33,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:33,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:41:33,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:41:33,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:33,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 686 transitions, 10993 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:33,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:33,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:33,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:35,199 INFO L124 PetriNetUnfolderBase]: 4894/7528 cut-off events. [2024-06-27 20:41:35,200 INFO L125 PetriNetUnfolderBase]: For 855335/855347 co-relation queries the response was YES. [2024-06-27 20:41:35,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65584 conditions, 7528 events. 4894/7528 cut-off events. For 855335/855347 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 44439 event pairs, 882 based on Foata normal form. 14/7538 useless extension candidates. Maximal degree in co-relation 65392. Up to 6839 conditions per place. [2024-06-27 20:41:35,325 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 506 selfloop transitions, 207 changer transitions 0/716 dead transitions. [2024-06-27 20:41:35,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 716 transitions, 13031 flow [2024-06-27 20:41:35,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:41:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:41:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-27 20:41:35,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-27 20:41:35,327 INFO L175 Difference]: Start difference. First operand has 453 places, 686 transitions, 10993 flow. Second operand 8 states and 132 transitions. [2024-06-27 20:41:35,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 716 transitions, 13031 flow [2024-06-27 20:41:38,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 716 transitions, 12919 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 20:41:38,747 INFO L231 Difference]: Finished difference. Result has 454 places, 692 transitions, 11439 flow [2024-06-27 20:41:38,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10881, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11439, PETRI_PLACES=454, PETRI_TRANSITIONS=692} [2024-06-27 20:41:38,748 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 413 predicate places. [2024-06-27 20:41:38,748 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 692 transitions, 11439 flow [2024-06-27 20:41:38,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:38,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:38,748 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-27 20:41:38,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-27 20:41:38,749 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:38,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1362064330, now seen corresponding path program 9 times [2024-06-27 20:41:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:38,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087230034] [2024-06-27 20:41:38,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:38,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:41:39,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:39,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087230034] [2024-06-27 20:41:39,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087230034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:39,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:39,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:41:39,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175104332] [2024-06-27 20:41:39,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:39,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:41:39,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:39,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:41:39,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:41:39,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:39,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 692 transitions, 11439 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:39,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:39,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:39,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:41,320 INFO L124 PetriNetUnfolderBase]: 4891/7529 cut-off events. [2024-06-27 20:41:41,321 INFO L125 PetriNetUnfolderBase]: For 869677/869685 co-relation queries the response was YES. [2024-06-27 20:41:41,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66502 conditions, 7529 events. 4891/7529 cut-off events. For 869677/869685 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 44602 event pairs, 1261 based on Foata normal form. 9/7536 useless extension candidates. Maximal degree in co-relation 66309. Up to 7377 conditions per place. [2024-06-27 20:41:41,432 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 668 selfloop transitions, 41 changer transitions 0/712 dead transitions. [2024-06-27 20:41:41,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 712 transitions, 12942 flow [2024-06-27 20:41:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:41:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:41:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-27 20:41:41,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-27 20:41:41,434 INFO L175 Difference]: Start difference. First operand has 454 places, 692 transitions, 11439 flow. Second operand 8 states and 122 transitions. [2024-06-27 20:41:41,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 712 transitions, 12942 flow [2024-06-27 20:41:44,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 712 transitions, 12556 flow, removed 73 selfloop flow, removed 4 redundant places. [2024-06-27 20:41:44,394 INFO L231 Difference]: Finished difference. Result has 458 places, 693 transitions, 11156 flow [2024-06-27 20:41:44,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11053, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11156, PETRI_PLACES=458, PETRI_TRANSITIONS=693} [2024-06-27 20:41:44,394 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 417 predicate places. [2024-06-27 20:41:44,395 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 693 transitions, 11156 flow [2024-06-27 20:41:44,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:44,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:44,395 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-27 20:41:44,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-27 20:41:44,395 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:44,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:44,396 INFO L85 PathProgramCache]: Analyzing trace with hash 405145830, now seen corresponding path program 6 times [2024-06-27 20:41:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:44,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347416549] [2024-06-27 20:41:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:44,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:41:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347416549] [2024-06-27 20:41:44,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347416549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:44,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:44,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:41:44,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952469936] [2024-06-27 20:41:44,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:44,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:41:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:44,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:41:44,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:41:45,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:45,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 693 transitions, 11156 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:45,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:45,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:45,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:46,933 INFO L124 PetriNetUnfolderBase]: 4909/7554 cut-off events. [2024-06-27 20:41:46,933 INFO L125 PetriNetUnfolderBase]: For 893241/893249 co-relation queries the response was YES. [2024-06-27 20:41:47,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66910 conditions, 7554 events. 4909/7554 cut-off events. For 893241/893249 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 44788 event pairs, 1267 based on Foata normal form. 10/7562 useless extension candidates. Maximal degree in co-relation 66715. Up to 7299 conditions per place. [2024-06-27 20:41:47,045 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 624 selfloop transitions, 93 changer transitions 0/720 dead transitions. [2024-06-27 20:41:47,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 720 transitions, 13282 flow [2024-06-27 20:41:47,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:41:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:41:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-27 20:41:47,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-27 20:41:47,047 INFO L175 Difference]: Start difference. First operand has 458 places, 693 transitions, 11156 flow. Second operand 8 states and 128 transitions. [2024-06-27 20:41:47,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 720 transitions, 13282 flow [2024-06-27 20:41:49,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 720 transitions, 13176 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 20:41:49,909 INFO L231 Difference]: Finished difference. Result has 460 places, 699 transitions, 11460 flow [2024-06-27 20:41:49,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11050, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11460, PETRI_PLACES=460, PETRI_TRANSITIONS=699} [2024-06-27 20:41:49,910 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 419 predicate places. [2024-06-27 20:41:49,910 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 699 transitions, 11460 flow [2024-06-27 20:41:49,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:49,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:49,910 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-27 20:41:49,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-27 20:41:49,911 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:49,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1361944546, now seen corresponding path program 16 times [2024-06-27 20:41:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:49,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771160067] [2024-06-27 20:41:49,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:49,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:41:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:50,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771160067] [2024-06-27 20:41:50,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771160067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:50,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:50,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:41:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939985560] [2024-06-27 20:41:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:50,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:41:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:41:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:41:50,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:50,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 699 transitions, 11460 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:50,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:50,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:50,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:52,368 INFO L124 PetriNetUnfolderBase]: 4919/7563 cut-off events. [2024-06-27 20:41:52,368 INFO L125 PetriNetUnfolderBase]: For 912233/912245 co-relation queries the response was YES. [2024-06-27 20:41:52,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67511 conditions, 7563 events. 4919/7563 cut-off events. For 912233/912245 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 44680 event pairs, 881 based on Foata normal form. 14/7573 useless extension candidates. Maximal degree in co-relation 67315. Up to 6870 conditions per place. [2024-06-27 20:41:52,710 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 513 selfloop transitions, 208 changer transitions 0/724 dead transitions. [2024-06-27 20:41:52,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 724 transitions, 13418 flow [2024-06-27 20:41:52,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:41:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:41:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-27 20:41:52,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-27 20:41:52,712 INFO L175 Difference]: Start difference. First operand has 460 places, 699 transitions, 11460 flow. Second operand 8 states and 131 transitions. [2024-06-27 20:41:52,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 724 transitions, 13418 flow [2024-06-27 20:41:55,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 724 transitions, 13181 flow, removed 71 selfloop flow, removed 4 redundant places. [2024-06-27 20:41:55,950 INFO L231 Difference]: Finished difference. Result has 464 places, 702 transitions, 11675 flow [2024-06-27 20:41:55,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11223, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11675, PETRI_PLACES=464, PETRI_TRANSITIONS=702} [2024-06-27 20:41:55,951 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 423 predicate places. [2024-06-27 20:41:55,951 INFO L495 AbstractCegarLoop]: Abstraction has has 464 places, 702 transitions, 11675 flow [2024-06-27 20:41:55,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:55,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:41:55,951 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-27 20:41:55,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-27 20:41:55,951 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:41:55,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:41:55,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1361944360, now seen corresponding path program 10 times [2024-06-27 20:41:55,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:41:55,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324695827] [2024-06-27 20:41:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:41:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:41:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:41:56,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-27 20:41:56,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:41:56,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324695827] [2024-06-27 20:41:56,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324695827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:41:56,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:41:56,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:41:56,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802550426] [2024-06-27 20:41:56,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:41:56,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:41:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:41:56,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:41:56,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:41:56,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:41:56,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 702 transitions, 11675 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:41:56,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:41:56,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:41:56,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:41:58,451 INFO L124 PetriNetUnfolderBase]: 4924/7575 cut-off events. [2024-06-27 20:41:58,451 INFO L125 PetriNetUnfolderBase]: For 926354/926362 co-relation queries the response was YES. [2024-06-27 20:41:58,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68213 conditions, 7575 events. 4924/7575 cut-off events. For 926354/926362 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 44916 event pairs, 1268 based on Foata normal form. 9/7582 useless extension candidates. Maximal degree in co-relation 68015. Up to 7329 conditions per place. [2024-06-27 20:41:58,578 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 625 selfloop transitions, 103 changer transitions 0/731 dead transitions. [2024-06-27 20:41:58,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 731 transitions, 13857 flow [2024-06-27 20:41:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:41:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:41:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-27 20:41:58,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-27 20:41:58,579 INFO L175 Difference]: Start difference. First operand has 464 places, 702 transitions, 11675 flow. Second operand 8 states and 125 transitions. [2024-06-27 20:41:58,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 731 transitions, 13857 flow [2024-06-27 20:42:01,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 731 transitions, 13442 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 20:42:01,726 INFO L231 Difference]: Finished difference. Result has 468 places, 713 transitions, 11814 flow [2024-06-27 20:42:01,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11260, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11814, PETRI_PLACES=468, PETRI_TRANSITIONS=713} [2024-06-27 20:42:01,727 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 427 predicate places. [2024-06-27 20:42:01,727 INFO L495 AbstractCegarLoop]: Abstraction has has 468 places, 713 transitions, 11814 flow [2024-06-27 20:42:01,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:01,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:42:01,727 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-27 20:42:01,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-27 20:42:01,728 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:42:01,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:42:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash 337663066, now seen corresponding path program 7 times [2024-06-27 20:42:01,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:42:01,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226195276] [2024-06-27 20:42:01,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:42:01,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:42:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:42:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:42:02,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:42:02,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226195276] [2024-06-27 20:42:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226195276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:42:02,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:42:02,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:42:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583171796] [2024-06-27 20:42:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:42:02,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:42:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:42:02,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:42:02,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:42:02,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:42:02,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 713 transitions, 11814 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:02,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:42:02,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:42:02,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:42:04,306 INFO L124 PetriNetUnfolderBase]: 4934/7596 cut-off events. [2024-06-27 20:42:04,307 INFO L125 PetriNetUnfolderBase]: For 950812/950812 co-relation queries the response was YES. [2024-06-27 20:42:04,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68465 conditions, 7596 events. 4934/7596 cut-off events. For 950812/950812 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 45115 event pairs, 1635 based on Foata normal form. 2/7597 useless extension candidates. Maximal degree in co-relation 68265. Up to 7499 conditions per place. [2024-06-27 20:42:04,427 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 699 selfloop transitions, 30 changer transitions 0/732 dead transitions. [2024-06-27 20:42:04,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 732 transitions, 13416 flow [2024-06-27 20:42:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:42:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:42:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-27 20:42:04,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-27 20:42:04,429 INFO L175 Difference]: Start difference. First operand has 468 places, 713 transitions, 11814 flow. Second operand 8 states and 119 transitions. [2024-06-27 20:42:04,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 732 transitions, 13416 flow [2024-06-27 20:42:07,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 732 transitions, 13236 flow, removed 73 selfloop flow, removed 3 redundant places. [2024-06-27 20:42:07,951 INFO L231 Difference]: Finished difference. Result has 473 places, 716 transitions, 11776 flow [2024-06-27 20:42:07,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11634, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11776, PETRI_PLACES=473, PETRI_TRANSITIONS=716} [2024-06-27 20:42:07,952 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 432 predicate places. [2024-06-27 20:42:07,952 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 716 transitions, 11776 flow [2024-06-27 20:42:07,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:07,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:42:07,952 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-27 20:42:07,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-27 20:42:07,952 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:42:07,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:42:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash 759408498, now seen corresponding path program 17 times [2024-06-27 20:42:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:42:07,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498763137] [2024-06-27 20:42:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:42:07,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:42:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:42:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:42:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:42:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498763137] [2024-06-27 20:42:08,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498763137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:42:08,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:42:08,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:42:08,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085764962] [2024-06-27 20:42:08,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:42:08,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:42:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:42:08,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:42:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:42:08,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:42:08,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 716 transitions, 11776 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:08,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:42:08,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:42:08,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:42:10,531 INFO L124 PetriNetUnfolderBase]: 4944/7598 cut-off events. [2024-06-27 20:42:10,532 INFO L125 PetriNetUnfolderBase]: For 960499/960511 co-relation queries the response was YES. [2024-06-27 20:42:10,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68413 conditions, 7598 events. 4944/7598 cut-off events. For 960499/960511 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 44861 event pairs, 869 based on Foata normal form. 14/7608 useless extension candidates. Maximal degree in co-relation 68211. Up to 6901 conditions per place. [2024-06-27 20:42:10,652 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 509 selfloop transitions, 225 changer transitions 0/737 dead transitions. [2024-06-27 20:42:10,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 737 transitions, 13753 flow [2024-06-27 20:42:10,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:42:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:42:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-27 20:42:10,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-27 20:42:10,653 INFO L175 Difference]: Start difference. First operand has 473 places, 716 transitions, 11776 flow. Second operand 8 states and 126 transitions. [2024-06-27 20:42:10,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 737 transitions, 13753 flow [2024-06-27 20:42:14,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 737 transitions, 13584 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-27 20:42:14,221 INFO L231 Difference]: Finished difference. Result has 474 places, 719 transitions, 12096 flow [2024-06-27 20:42:14,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11607, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12096, PETRI_PLACES=474, PETRI_TRANSITIONS=719} [2024-06-27 20:42:14,221 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 433 predicate places. [2024-06-27 20:42:14,222 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 719 transitions, 12096 flow [2024-06-27 20:42:14,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:14,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:42:14,222 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-27 20:42:14,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-27 20:42:14,222 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:42:14,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:42:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1007444170, now seen corresponding path program 11 times [2024-06-27 20:42:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:42:14,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903429972] [2024-06-27 20:42:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:42:14,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:42:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:42:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:42:14,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:42:14,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903429972] [2024-06-27 20:42:14,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903429972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:42:14,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:42:14,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:42:14,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586380503] [2024-06-27 20:42:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:42:14,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:42:14,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:42:14,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:42:14,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:42:14,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:42:14,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 719 transitions, 12096 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:14,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:42:14,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:42:14,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:42:17,019 INFO L124 PetriNetUnfolderBase]: 4957/7621 cut-off events. [2024-06-27 20:42:17,019 INFO L125 PetriNetUnfolderBase]: For 983673/983681 co-relation queries the response was YES. [2024-06-27 20:42:17,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69480 conditions, 7621 events. 4957/7621 cut-off events. For 983673/983681 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 45215 event pairs, 1265 based on Foata normal form. 9/7628 useless extension candidates. Maximal degree in co-relation 69277. Up to 7372 conditions per place. [2024-06-27 20:42:17,134 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 624 selfloop transitions, 114 changer transitions 0/741 dead transitions. [2024-06-27 20:42:17,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 741 transitions, 14221 flow [2024-06-27 20:42:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:42:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:42:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-27 20:42:17,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-27 20:42:17,135 INFO L175 Difference]: Start difference. First operand has 474 places, 719 transitions, 12096 flow. Second operand 8 states and 122 transitions. [2024-06-27 20:42:17,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 741 transitions, 14221 flow [2024-06-27 20:42:20,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 741 transitions, 13892 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 20:42:20,862 INFO L231 Difference]: Finished difference. Result has 477 places, 726 transitions, 12194 flow [2024-06-27 20:42:20,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11767, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12194, PETRI_PLACES=477, PETRI_TRANSITIONS=726} [2024-06-27 20:42:20,862 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 436 predicate places. [2024-06-27 20:42:20,863 INFO L495 AbstractCegarLoop]: Abstraction has has 477 places, 726 transitions, 12194 flow [2024-06-27 20:42:20,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:20,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:42:20,863 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-27 20:42:20,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-27 20:42:20,863 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:42:20,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:42:20,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1007681134, now seen corresponding path program 8 times [2024-06-27 20:42:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:42:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691412590] [2024-06-27 20:42:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:42:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:42:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:42:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:42:21,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:42:21,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691412590] [2024-06-27 20:42:21,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691412590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:42:21,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:42:21,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:42:21,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039044902] [2024-06-27 20:42:21,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:42:21,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:42:21,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:42:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:42:21,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:42:21,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:42:21,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 726 transitions, 12194 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:21,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:42:21,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:42:21,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:42:23,735 INFO L124 PetriNetUnfolderBase]: 4967/7635 cut-off events. [2024-06-27 20:42:23,735 INFO L125 PetriNetUnfolderBase]: For 1006238/1006246 co-relation queries the response was YES. [2024-06-27 20:42:23,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69425 conditions, 7635 events. 4967/7635 cut-off events. For 1006238/1006246 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 45322 event pairs, 1258 based on Foata normal form. 10/7643 useless extension candidates. Maximal degree in co-relation 69221. Up to 7372 conditions per place. [2024-06-27 20:42:23,845 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 646 selfloop transitions, 98 changer transitions 0/747 dead transitions. [2024-06-27 20:42:23,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 747 transitions, 14050 flow [2024-06-27 20:42:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:42:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:42:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-27 20:42:23,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-27 20:42:23,847 INFO L175 Difference]: Start difference. First operand has 477 places, 726 transitions, 12194 flow. Second operand 8 states and 126 transitions. [2024-06-27 20:42:23,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 747 transitions, 14050 flow [2024-06-27 20:42:27,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 747 transitions, 13800 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-27 20:42:27,562 INFO L231 Difference]: Finished difference. Result has 481 places, 729 transitions, 12222 flow [2024-06-27 20:42:27,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11944, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12222, PETRI_PLACES=481, PETRI_TRANSITIONS=729} [2024-06-27 20:42:27,562 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 440 predicate places. [2024-06-27 20:42:27,562 INFO L495 AbstractCegarLoop]: Abstraction has has 481 places, 729 transitions, 12222 flow [2024-06-27 20:42:27,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:27,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:42:27,563 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-27 20:42:27,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-27 20:42:27,563 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:42:27,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:42:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1007681320, now seen corresponding path program 12 times [2024-06-27 20:42:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:42:27,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607755316] [2024-06-27 20:42:27,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:42:27,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:42:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:42:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:42:28,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:42:28,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607755316] [2024-06-27 20:42:28,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607755316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:42:28,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:42:28,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:42:28,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887893882] [2024-06-27 20:42:28,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:42:28,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:42:28,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:42:28,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:42:28,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:42:28,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:42:28,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 729 transitions, 12222 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:28,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:42:28,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:42:28,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:42:30,181 INFO L124 PetriNetUnfolderBase]: 4964/7631 cut-off events. [2024-06-27 20:42:30,181 INFO L125 PetriNetUnfolderBase]: For 1013005/1013013 co-relation queries the response was YES. [2024-06-27 20:42:30,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69400 conditions, 7631 events. 4964/7631 cut-off events. For 1013005/1013013 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 45273 event pairs, 1265 based on Foata normal form. 9/7638 useless extension candidates. Maximal degree in co-relation 69195. Up to 7383 conditions per place. [2024-06-27 20:42:30,310 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 628 selfloop transitions, 112 changer transitions 0/743 dead transitions. [2024-06-27 20:42:30,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 743 transitions, 13956 flow [2024-06-27 20:42:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:42:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:42:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-27 20:42:30,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-27 20:42:30,311 INFO L175 Difference]: Start difference. First operand has 481 places, 729 transitions, 12222 flow. Second operand 8 states and 121 transitions. [2024-06-27 20:42:30,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 743 transitions, 13956 flow [2024-06-27 20:42:33,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 743 transitions, 13693 flow, removed 63 selfloop flow, removed 5 redundant places. [2024-06-27 20:42:33,753 INFO L231 Difference]: Finished difference. Result has 484 places, 729 transitions, 12189 flow [2024-06-27 20:42:33,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11959, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12189, PETRI_PLACES=484, PETRI_TRANSITIONS=729} [2024-06-27 20:42:33,754 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 443 predicate places. [2024-06-27 20:42:33,754 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 729 transitions, 12189 flow [2024-06-27 20:42:33,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:33,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:42:33,754 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-27 20:42:33,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-27 20:42:33,754 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:42:33,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:42:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1243405764, now seen corresponding path program 13 times [2024-06-27 20:42:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:42:33,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844106328] [2024-06-27 20:42:33,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:42:33,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:42:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:42:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:42:34,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:42:34,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844106328] [2024-06-27 20:42:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844106328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:42:34,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:42:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:42:34,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895292101] [2024-06-27 20:42:34,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:42:34,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:42:34,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:42:34,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:42:34,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:42:34,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:42:34,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 729 transitions, 12189 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:34,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:42:34,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:42:34,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:42:36,428 INFO L124 PetriNetUnfolderBase]: 4969/7635 cut-off events. [2024-06-27 20:42:36,429 INFO L125 PetriNetUnfolderBase]: For 1029583/1029591 co-relation queries the response was YES. [2024-06-27 20:42:36,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69528 conditions, 7635 events. 4969/7635 cut-off events. For 1029583/1029591 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 45194 event pairs, 1259 based on Foata normal form. 9/7642 useless extension candidates. Maximal degree in co-relation 69322. Up to 7524 conditions per place. [2024-06-27 20:42:36,547 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 687 selfloop transitions, 54 changer transitions 0/744 dead transitions. [2024-06-27 20:42:36,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 744 transitions, 14220 flow [2024-06-27 20:42:36,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:42:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:42:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-27 20:42:36,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-27 20:42:36,549 INFO L175 Difference]: Start difference. First operand has 484 places, 729 transitions, 12189 flow. Second operand 8 states and 116 transitions. [2024-06-27 20:42:36,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 744 transitions, 14220 flow [2024-06-27 20:42:40,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 744 transitions, 14038 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 20:42:40,302 INFO L231 Difference]: Finished difference. Result has 487 places, 732 transitions, 12216 flow [2024-06-27 20:42:40,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12013, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12216, PETRI_PLACES=487, PETRI_TRANSITIONS=732} [2024-06-27 20:42:40,302 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 446 predicate places. [2024-06-27 20:42:40,302 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 732 transitions, 12216 flow [2024-06-27 20:42:40,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:40,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:42:40,303 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-27 20:42:40,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-27 20:42:40,303 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:42:40,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:42:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1940301902, now seen corresponding path program 9 times [2024-06-27 20:42:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:42:40,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517748586] [2024-06-27 20:42:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:42:40,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:42:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:42:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:42:40,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:42:40,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517748586] [2024-06-27 20:42:40,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517748586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:42:40,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:42:40,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:42:40,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585054180] [2024-06-27 20:42:40,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:42:40,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:42:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:42:40,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:42:40,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:42:40,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:42:40,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 732 transitions, 12216 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:40,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:42:40,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:42:40,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:42:43,106 INFO L124 PetriNetUnfolderBase]: 4995/7682 cut-off events. [2024-06-27 20:42:43,107 INFO L125 PetriNetUnfolderBase]: For 1068060/1068060 co-relation queries the response was YES. [2024-06-27 20:42:43,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70170 conditions, 7682 events. 4995/7682 cut-off events. For 1068060/1068060 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 45684 event pairs, 1630 based on Foata normal form. 2/7683 useless extension candidates. Maximal degree in co-relation 69963. Up to 7599 conditions per place. [2024-06-27 20:42:43,227 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 726 selfloop transitions, 24 changer transitions 0/753 dead transitions. [2024-06-27 20:42:43,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 753 transitions, 14138 flow [2024-06-27 20:42:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:42:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:42:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-27 20:42:43,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2024-06-27 20:42:43,228 INFO L175 Difference]: Start difference. First operand has 487 places, 732 transitions, 12216 flow. Second operand 9 states and 124 transitions. [2024-06-27 20:42:43,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 753 transitions, 14138 flow [2024-06-27 20:42:46,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 753 transitions, 13891 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-27 20:42:46,625 INFO L231 Difference]: Finished difference. Result has 492 places, 739 transitions, 12205 flow [2024-06-27 20:42:46,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11969, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12205, PETRI_PLACES=492, PETRI_TRANSITIONS=739} [2024-06-27 20:42:46,626 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 451 predicate places. [2024-06-27 20:42:46,627 INFO L495 AbstractCegarLoop]: Abstraction has has 492 places, 739 transitions, 12205 flow [2024-06-27 20:42:46,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:46,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:42:46,628 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-27 20:42:46,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-27 20:42:46,629 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:42:46,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:42:46,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1322540850, now seen corresponding path program 18 times [2024-06-27 20:42:46,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:42:46,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963086744] [2024-06-27 20:42:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:42:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:42:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:42:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:42:47,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:42:47,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963086744] [2024-06-27 20:42:47,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963086744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:42:47,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:42:47,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:42:47,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808515145] [2024-06-27 20:42:47,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:42:47,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:42:47,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:42:47,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:42:47,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:42:47,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:42:47,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 739 transitions, 12205 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:47,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:42:47,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:42:47,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:42:49,434 INFO L124 PetriNetUnfolderBase]: 4989/7662 cut-off events. [2024-06-27 20:42:49,434 INFO L125 PetriNetUnfolderBase]: For 1068942/1068954 co-relation queries the response was YES. [2024-06-27 20:42:49,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69942 conditions, 7662 events. 4989/7662 cut-off events. For 1068942/1068954 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 45219 event pairs, 912 based on Foata normal form. 14/7671 useless extension candidates. Maximal degree in co-relation 69732. Up to 7415 conditions per place. [2024-06-27 20:42:49,559 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 645 selfloop transitions, 102 changer transitions 0/750 dead transitions. [2024-06-27 20:42:49,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 750 transitions, 13737 flow [2024-06-27 20:42:49,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:42:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:42:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-27 20:42:49,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-27 20:42:49,560 INFO L175 Difference]: Start difference. First operand has 492 places, 739 transitions, 12205 flow. Second operand 8 states and 117 transitions. [2024-06-27 20:42:49,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 750 transitions, 13737 flow [2024-06-27 20:42:53,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 750 transitions, 13621 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-27 20:42:53,246 INFO L231 Difference]: Finished difference. Result has 495 places, 739 transitions, 12299 flow [2024-06-27 20:42:53,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12089, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12299, PETRI_PLACES=495, PETRI_TRANSITIONS=739} [2024-06-27 20:42:53,247 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 454 predicate places. [2024-06-27 20:42:53,247 INFO L495 AbstractCegarLoop]: Abstraction has has 495 places, 739 transitions, 12299 flow [2024-06-27 20:42:53,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:53,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:42:53,247 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-27 20:42:53,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-27 20:42:53,248 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:42:53,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:42:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1322183358, now seen corresponding path program 10 times [2024-06-27 20:42:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:42:53,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727981173] [2024-06-27 20:42:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:42:53,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:42:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:42:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:42:53,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:42:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727981173] [2024-06-27 20:42:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727981173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:42:53,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:42:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:42:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313950440] [2024-06-27 20:42:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:42:53,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:42:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:42:53,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:42:53,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:42:53,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:42:53,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 739 transitions, 12299 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:42:53,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:42:53,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:42:53,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:42:56,054 INFO L124 PetriNetUnfolderBase]: 4999/7677 cut-off events. [2024-06-27 20:42:56,054 INFO L125 PetriNetUnfolderBase]: For 1090663/1090671 co-relation queries the response was YES. [2024-06-27 20:42:56,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70333 conditions, 7677 events. 4999/7677 cut-off events. For 1090663/1090671 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 45491 event pairs, 1261 based on Foata normal form. 10/7685 useless extension candidates. Maximal degree in co-relation 70122. Up to 7580 conditions per place. [2024-06-27 20:42:56,169 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 709 selfloop transitions, 41 changer transitions 0/753 dead transitions. [2024-06-27 20:42:56,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 753 transitions, 13915 flow [2024-06-27 20:42:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:42:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:42:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2024-06-27 20:42:56,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-27 20:42:56,170 INFO L175 Difference]: Start difference. First operand has 495 places, 739 transitions, 12299 flow. Second operand 8 states and 114 transitions. [2024-06-27 20:42:56,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 753 transitions, 13915 flow [2024-06-27 20:43:00,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 753 transitions, 13657 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-27 20:43:00,224 INFO L231 Difference]: Finished difference. Result has 497 places, 742 transitions, 12211 flow [2024-06-27 20:43:00,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12041, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12211, PETRI_PLACES=497, PETRI_TRANSITIONS=742} [2024-06-27 20:43:00,224 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 456 predicate places. [2024-06-27 20:43:00,224 INFO L495 AbstractCegarLoop]: Abstraction has has 497 places, 742 transitions, 12211 flow [2024-06-27 20:43:00,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:00,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:43:00,225 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-27 20:43:00,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-27 20:43:00,225 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:43:00,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:43:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -922686048, now seen corresponding path program 11 times [2024-06-27 20:43:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:43:00,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209844581] [2024-06-27 20:43:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:43:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:43:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:43:00,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-27 20:43:00,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:43:00,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209844581] [2024-06-27 20:43:00,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209844581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:43:00,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:43:00,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:43:00,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242980783] [2024-06-27 20:43:00,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:43:00,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:43:00,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:43:00,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:43:00,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:43:00,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:43:00,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 742 transitions, 12211 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:00,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:43:00,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:43:00,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:43:02,759 INFO L124 PetriNetUnfolderBase]: 4993/7679 cut-off events. [2024-06-27 20:43:02,759 INFO L125 PetriNetUnfolderBase]: For 1098092/1098092 co-relation queries the response was YES. [2024-06-27 20:43:02,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70015 conditions, 7679 events. 4993/7679 cut-off events. For 1098092/1098092 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 45680 event pairs, 1632 based on Foata normal form. 2/7680 useless extension candidates. Maximal degree in co-relation 69804. Up to 7614 conditions per place. [2024-06-27 20:43:02,893 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 732 selfloop transitions, 18 changer transitions 0/753 dead transitions. [2024-06-27 20:43:02,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 753 transitions, 13751 flow [2024-06-27 20:43:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:43:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:43:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-27 20:43:02,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-27 20:43:02,895 INFO L175 Difference]: Start difference. First operand has 497 places, 742 transitions, 12211 flow. Second operand 8 states and 110 transitions. [2024-06-27 20:43:02,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 753 transitions, 13751 flow [2024-06-27 20:43:06,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 753 transitions, 13547 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-06-27 20:43:06,674 INFO L231 Difference]: Finished difference. Result has 498 places, 742 transitions, 12049 flow [2024-06-27 20:43:06,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12007, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12049, PETRI_PLACES=498, PETRI_TRANSITIONS=742} [2024-06-27 20:43:06,675 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 457 predicate places. [2024-06-27 20:43:06,675 INFO L495 AbstractCegarLoop]: Abstraction has has 498 places, 742 transitions, 12049 flow [2024-06-27 20:43:06,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:06,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:43:06,675 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-27 20:43:06,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-27 20:43:06,676 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:43:06,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:43:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1144873278, now seen corresponding path program 12 times [2024-06-27 20:43:06,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:43:06,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987370601] [2024-06-27 20:43:06,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:43:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:43:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:43:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:43:07,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:43:07,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987370601] [2024-06-27 20:43:07,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987370601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:43:07,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:43:07,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:43:07,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745089740] [2024-06-27 20:43:07,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:43:07,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:43:07,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:43:07,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:43:07,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:43:07,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:43:07,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 742 transitions, 12049 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:07,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:43:07,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:43:07,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:43:09,439 INFO L124 PetriNetUnfolderBase]: 5003/7693 cut-off events. [2024-06-27 20:43:09,439 INFO L125 PetriNetUnfolderBase]: For 1115710/1115710 co-relation queries the response was YES. [2024-06-27 20:43:09,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70114 conditions, 7693 events. 5003/7693 cut-off events. For 1115710/1115710 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 45766 event pairs, 1626 based on Foata normal form. 2/7694 useless extension candidates. Maximal degree in co-relation 69903. Up to 7614 conditions per place. [2024-06-27 20:43:09,568 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 732 selfloop transitions, 23 changer transitions 0/758 dead transitions. [2024-06-27 20:43:09,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 758 transitions, 13704 flow [2024-06-27 20:43:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:43:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:43:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2024-06-27 20:43:09,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-27 20:43:09,569 INFO L175 Difference]: Start difference. First operand has 498 places, 742 transitions, 12049 flow. Second operand 8 states and 114 transitions. [2024-06-27 20:43:09,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 758 transitions, 13704 flow [2024-06-27 20:43:13,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 758 transitions, 13672 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 20:43:13,778 INFO L231 Difference]: Finished difference. Result has 500 places, 745 transitions, 12160 flow [2024-06-27 20:43:13,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12017, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12160, PETRI_PLACES=500, PETRI_TRANSITIONS=745} [2024-06-27 20:43:13,779 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 459 predicate places. [2024-06-27 20:43:13,779 INFO L495 AbstractCegarLoop]: Abstraction has has 500 places, 745 transitions, 12160 flow [2024-06-27 20:43:13,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:13,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:43:13,779 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-27 20:43:13,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-27 20:43:13,780 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:43:13,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:43:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1145289360, now seen corresponding path program 19 times [2024-06-27 20:43:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:43:13,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112538202] [2024-06-27 20:43:13,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:43:13,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:43:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:43:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:43:14,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:43:14,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112538202] [2024-06-27 20:43:14,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112538202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:43:14,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:43:14,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:43:14,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718843216] [2024-06-27 20:43:14,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:43:14,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:43:14,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:43:14,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:43:14,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:43:14,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:43:14,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 745 transitions, 12160 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:14,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:43:14,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:43:14,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:43:16,408 INFO L124 PetriNetUnfolderBase]: 4997/7673 cut-off events. [2024-06-27 20:43:16,408 INFO L125 PetriNetUnfolderBase]: For 1117669/1117681 co-relation queries the response was YES. [2024-06-27 20:43:16,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70056 conditions, 7673 events. 4997/7673 cut-off events. For 1117669/1117681 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 45260 event pairs, 908 based on Foata normal form. 14/7683 useless extension candidates. Maximal degree in co-relation 69844. Up to 7327 conditions per place. [2024-06-27 20:43:16,536 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 605 selfloop transitions, 150 changer transitions 0/758 dead transitions. [2024-06-27 20:43:16,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 758 transitions, 13940 flow [2024-06-27 20:43:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:43:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:43:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-27 20:43:16,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-27 20:43:16,537 INFO L175 Difference]: Start difference. First operand has 500 places, 745 transitions, 12160 flow. Second operand 8 states and 120 transitions. [2024-06-27 20:43:16,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 758 transitions, 13940 flow [2024-06-27 20:43:20,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 758 transitions, 13736 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-27 20:43:20,981 INFO L231 Difference]: Finished difference. Result has 501 places, 745 transitions, 12262 flow [2024-06-27 20:43:20,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11956, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12262, PETRI_PLACES=501, PETRI_TRANSITIONS=745} [2024-06-27 20:43:20,981 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 460 predicate places. [2024-06-27 20:43:20,981 INFO L495 AbstractCegarLoop]: Abstraction has has 501 places, 745 transitions, 12262 flow [2024-06-27 20:43:20,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:20,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:43:20,982 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-27 20:43:20,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-27 20:43:20,982 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:43:20,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:43:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1145052024, now seen corresponding path program 14 times [2024-06-27 20:43:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:43:20,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709533361] [2024-06-27 20:43:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:43:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:43:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:43:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:43:21,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:43:21,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709533361] [2024-06-27 20:43:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709533361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:43:21,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:43:21,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:43:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517683786] [2024-06-27 20:43:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:43:21,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:43:21,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:43:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:43:21,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:43:21,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:43:21,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 745 transitions, 12262 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:21,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:43:21,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:43:21,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:43:23,746 INFO L124 PetriNetUnfolderBase]: 4994/7671 cut-off events. [2024-06-27 20:43:23,746 INFO L125 PetriNetUnfolderBase]: For 1127033/1127041 co-relation queries the response was YES. [2024-06-27 20:43:23,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70111 conditions, 7671 events. 4994/7671 cut-off events. For 1127033/1127041 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 45410 event pairs, 1257 based on Foata normal form. 9/7678 useless extension candidates. Maximal degree in co-relation 69900. Up to 7561 conditions per place. [2024-06-27 20:43:23,869 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 696 selfloop transitions, 57 changer transitions 0/756 dead transitions. [2024-06-27 20:43:23,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 756 transitions, 14024 flow [2024-06-27 20:43:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:43:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:43:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2024-06-27 20:43:23,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-27 20:43:23,871 INFO L175 Difference]: Start difference. First operand has 501 places, 745 transitions, 12262 flow. Second operand 8 states and 114 transitions. [2024-06-27 20:43:23,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 756 transitions, 14024 flow [2024-06-27 20:43:28,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 756 transitions, 13590 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-27 20:43:28,230 INFO L231 Difference]: Finished difference. Result has 503 places, 745 transitions, 11948 flow [2024-06-27 20:43:28,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11828, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11948, PETRI_PLACES=503, PETRI_TRANSITIONS=745} [2024-06-27 20:43:28,231 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 462 predicate places. [2024-06-27 20:43:28,231 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 745 transitions, 11948 flow [2024-06-27 20:43:28,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:28,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:43:28,231 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-27 20:43:28,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-27 20:43:28,232 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:43:28,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:43:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1322420694, now seen corresponding path program 15 times [2024-06-27 20:43:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:43:28,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985131904] [2024-06-27 20:43:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:43:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:43:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:43:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:43:28,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:43:28,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985131904] [2024-06-27 20:43:28,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985131904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:43:28,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:43:28,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:43:28,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588656424] [2024-06-27 20:43:28,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:43:28,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:43:28,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:43:28,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:43:28,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:43:28,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:43:28,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 745 transitions, 11948 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:28,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:43:28,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:43:28,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:43:30,900 INFO L124 PetriNetUnfolderBase]: 4991/7667 cut-off events. [2024-06-27 20:43:30,900 INFO L125 PetriNetUnfolderBase]: For 1134994/1135002 co-relation queries the response was YES. [2024-06-27 20:43:30,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69677 conditions, 7667 events. 4991/7667 cut-off events. For 1134994/1135002 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 45430 event pairs, 1262 based on Foata normal form. 9/7674 useless extension candidates. Maximal degree in co-relation 69465. Up to 7585 conditions per place. [2024-06-27 20:43:31,020 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 720 selfloop transitions, 32 changer transitions 0/755 dead transitions. [2024-06-27 20:43:31,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 755 transitions, 13482 flow [2024-06-27 20:43:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:43:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:43:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-27 20:43:31,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-27 20:43:31,022 INFO L175 Difference]: Start difference. First operand has 503 places, 745 transitions, 11948 flow. Second operand 8 states and 111 transitions. [2024-06-27 20:43:31,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 755 transitions, 13482 flow [2024-06-27 20:43:35,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 755 transitions, 13300 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-27 20:43:35,461 INFO L231 Difference]: Finished difference. Result has 505 places, 745 transitions, 11836 flow [2024-06-27 20:43:35,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11766, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11836, PETRI_PLACES=505, PETRI_TRANSITIONS=745} [2024-06-27 20:43:35,462 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 464 predicate places. [2024-06-27 20:43:35,462 INFO L495 AbstractCegarLoop]: Abstraction has has 505 places, 745 transitions, 11836 flow [2024-06-27 20:43:35,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:35,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:43:35,462 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-27 20:43:35,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-27 20:43:35,462 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:43:35,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:43:35,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1145288988, now seen corresponding path program 13 times [2024-06-27 20:43:35,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:43:35,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796057208] [2024-06-27 20:43:35,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:43:35,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:43:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:43:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:43:35,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:43:35,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796057208] [2024-06-27 20:43:35,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796057208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:43:35,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:43:35,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:43:35,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326439438] [2024-06-27 20:43:35,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:43:35,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:43:35,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:43:35,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:43:35,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:43:36,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:43:36,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 745 transitions, 11836 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:36,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:43:36,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:43:36,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:43:38,263 INFO L124 PetriNetUnfolderBase]: 4985/7659 cut-off events. [2024-06-27 20:43:38,263 INFO L125 PetriNetUnfolderBase]: For 1146374/1146382 co-relation queries the response was YES. [2024-06-27 20:43:38,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69404 conditions, 7659 events. 4985/7659 cut-off events. For 1146374/1146382 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 45405 event pairs, 1257 based on Foata normal form. 10/7667 useless extension candidates. Maximal degree in co-relation 69191. Up to 7474 conditions per place. [2024-06-27 20:43:38,382 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 674 selfloop transitions, 82 changer transitions 0/759 dead transitions. [2024-06-27 20:43:38,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 759 transitions, 13638 flow [2024-06-27 20:43:38,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:43:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:43:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-27 20:43:38,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-27 20:43:38,384 INFO L175 Difference]: Start difference. First operand has 505 places, 745 transitions, 11836 flow. Second operand 8 states and 119 transitions. [2024-06-27 20:43:38,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 759 transitions, 13638 flow [2024-06-27 20:43:43,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 759 transitions, 13335 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-27 20:43:43,013 INFO L231 Difference]: Finished difference. Result has 505 places, 745 transitions, 11705 flow [2024-06-27 20:43:43,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11535, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11705, PETRI_PLACES=505, PETRI_TRANSITIONS=745} [2024-06-27 20:43:43,014 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 464 predicate places. [2024-06-27 20:43:43,014 INFO L495 AbstractCegarLoop]: Abstraction has has 505 places, 745 transitions, 11705 flow [2024-06-27 20:43:43,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:43,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:43:43,015 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-27 20:43:43,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-27 20:43:43,015 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:43:43,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:43:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1745207296, now seen corresponding path program 20 times [2024-06-27 20:43:43,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:43:43,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428067034] [2024-06-27 20:43:43,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:43:43,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:43:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:43:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:43:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:43:43,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428067034] [2024-06-27 20:43:43,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428067034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:43:43,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:43:43,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:43:43,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271916907] [2024-06-27 20:43:43,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:43:43,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:43:43,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:43:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:43:43,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:43:43,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:43:43,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 745 transitions, 11705 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:43,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:43:43,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:43:43,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:43:45,882 INFO L124 PetriNetUnfolderBase]: 4979/7649 cut-off events. [2024-06-27 20:43:45,882 INFO L125 PetriNetUnfolderBase]: For 1126687/1126699 co-relation queries the response was YES. [2024-06-27 20:43:45,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68236 conditions, 7649 events. 4979/7649 cut-off events. For 1126687/1126699 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 45192 event pairs, 916 based on Foata normal form. 14/7659 useless extension candidates. Maximal degree in co-relation 68023. Up to 7390 conditions per place. [2024-06-27 20:43:45,997 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 646 selfloop transitions, 109 changer transitions 0/758 dead transitions. [2024-06-27 20:43:45,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 758 transitions, 13491 flow [2024-06-27 20:43:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:43:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:43:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-27 20:43:45,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-27 20:43:45,999 INFO L175 Difference]: Start difference. First operand has 505 places, 745 transitions, 11705 flow. Second operand 8 states and 121 transitions. [2024-06-27 20:43:45,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 758 transitions, 13491 flow [2024-06-27 20:43:50,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 758 transitions, 13232 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-27 20:43:50,927 INFO L231 Difference]: Finished difference. Result has 506 places, 745 transitions, 11670 flow [2024-06-27 20:43:50,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11446, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11670, PETRI_PLACES=506, PETRI_TRANSITIONS=745} [2024-06-27 20:43:50,927 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 465 predicate places. [2024-06-27 20:43:50,927 INFO L495 AbstractCegarLoop]: Abstraction has has 506 places, 745 transitions, 11670 flow [2024-06-27 20:43:50,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:50,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:43:50,928 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-27 20:43:50,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-27 20:43:50,928 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:43:50,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:43:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1322420508, now seen corresponding path program 14 times [2024-06-27 20:43:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:43:50,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805652995] [2024-06-27 20:43:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:43:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:43:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:43:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:43:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:43:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805652995] [2024-06-27 20:43:51,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805652995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:43:51,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:43:51,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:43:51,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829452581] [2024-06-27 20:43:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:43:51,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:43:51,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:43:51,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:43:51,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:43:51,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:43:51,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 745 transitions, 11670 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:51,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:43:51,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:43:51,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:43:53,530 INFO L124 PetriNetUnfolderBase]: 4973/7643 cut-off events. [2024-06-27 20:43:53,530 INFO L125 PetriNetUnfolderBase]: For 1134197/1134205 co-relation queries the response was YES. [2024-06-27 20:43:53,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68025 conditions, 7643 events. 4973/7643 cut-off events. For 1134197/1134205 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 45324 event pairs, 1259 based on Foata normal form. 10/7651 useless extension candidates. Maximal degree in co-relation 67811. Up to 7531 conditions per place. [2024-06-27 20:43:53,670 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 705 selfloop transitions, 49 changer transitions 0/757 dead transitions. [2024-06-27 20:43:53,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 757 transitions, 13228 flow [2024-06-27 20:43:53,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:43:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:43:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-27 20:43:53,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-27 20:43:53,672 INFO L175 Difference]: Start difference. First operand has 506 places, 745 transitions, 11670 flow. Second operand 8 states and 116 transitions. [2024-06-27 20:43:53,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 757 transitions, 13228 flow [2024-06-27 20:43:58,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 757 transitions, 12643 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-06-27 20:43:58,389 INFO L231 Difference]: Finished difference. Result has 504 places, 745 transitions, 11189 flow [2024-06-27 20:43:58,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11085, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11189, PETRI_PLACES=504, PETRI_TRANSITIONS=745} [2024-06-27 20:43:58,390 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 463 predicate places. [2024-06-27 20:43:58,390 INFO L495 AbstractCegarLoop]: Abstraction has has 504 places, 745 transitions, 11189 flow [2024-06-27 20:43:58,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:58,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:43:58,390 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-27 20:43:58,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-27 20:43:58,390 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:43:58,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:43:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash -908867550, now seen corresponding path program 3 times [2024-06-27 20:43:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:43:58,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020405977] [2024-06-27 20:43:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:43:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:43:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:43:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:43:59,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:43:59,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020405977] [2024-06-27 20:43:59,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020405977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:43:59,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:43:59,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:43:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464954004] [2024-06-27 20:43:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:43:59,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:43:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:43:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:43:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:43:59,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:43:59,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 745 transitions, 11189 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:43:59,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:43:59,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:43:59,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:44:01,533 INFO L124 PetriNetUnfolderBase]: 4981/7665 cut-off events. [2024-06-27 20:44:01,534 INFO L125 PetriNetUnfolderBase]: For 1147071/1147071 co-relation queries the response was YES. [2024-06-27 20:44:01,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67269 conditions, 7665 events. 4981/7665 cut-off events. For 1147071/1147071 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 45591 event pairs, 1628 based on Foata normal form. 2/7666 useless extension candidates. Maximal degree in co-relation 67057. Up to 7592 conditions per place. [2024-06-27 20:44:01,670 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 734 selfloop transitions, 21 changer transitions 0/758 dead transitions. [2024-06-27 20:44:01,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 758 transitions, 12801 flow [2024-06-27 20:44:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:44:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:44:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-27 20:44:01,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-27 20:44:01,672 INFO L175 Difference]: Start difference. First operand has 504 places, 745 transitions, 11189 flow. Second operand 8 states and 111 transitions. [2024-06-27 20:44:01,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 758 transitions, 12801 flow [2024-06-27 20:44:06,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 758 transitions, 12572 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-27 20:44:06,662 INFO L231 Difference]: Finished difference. Result has 503 places, 747 transitions, 11081 flow [2024-06-27 20:44:06,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10960, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11081, PETRI_PLACES=503, PETRI_TRANSITIONS=747} [2024-06-27 20:44:06,663 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 462 predicate places. [2024-06-27 20:44:06,663 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 747 transitions, 11081 flow [2024-06-27 20:44:06,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:06,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:44:06,663 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-27 20:44:06,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-27 20:44:06,663 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:44:06,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:44:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash -908392320, now seen corresponding path program 4 times [2024-06-27 20:44:06,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:44:06,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843734169] [2024-06-27 20:44:06,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:44:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:44:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:44:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:44:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:44:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843734169] [2024-06-27 20:44:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843734169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:44:07,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:44:07,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:44:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79993819] [2024-06-27 20:44:07,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:44:07,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:44:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:44:07,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:44:07,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:44:07,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:44:07,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 747 transitions, 11081 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:07,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:44:07,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:44:07,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:44:09,840 INFO L124 PetriNetUnfolderBase]: 4989/7677 cut-off events. [2024-06-27 20:44:09,841 INFO L125 PetriNetUnfolderBase]: For 1166869/1166869 co-relation queries the response was YES. [2024-06-27 20:44:09,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67507 conditions, 7677 events. 4989/7677 cut-off events. For 1166869/1166869 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 45634 event pairs, 1638 based on Foata normal form. 2/7678 useless extension candidates. Maximal degree in co-relation 67295. Up to 7590 conditions per place. [2024-06-27 20:44:09,972 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 734 selfloop transitions, 25 changer transitions 0/762 dead transitions. [2024-06-27 20:44:09,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 762 transitions, 12709 flow [2024-06-27 20:44:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:44:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:44:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-27 20:44:09,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2024-06-27 20:44:09,973 INFO L175 Difference]: Start difference. First operand has 503 places, 747 transitions, 11081 flow. Second operand 9 states and 123 transitions. [2024-06-27 20:44:09,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 762 transitions, 12709 flow [2024-06-27 20:44:14,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 762 transitions, 12604 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 20:44:14,888 INFO L231 Difference]: Finished difference. Result has 506 places, 749 transitions, 11109 flow [2024-06-27 20:44:14,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10976, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11109, PETRI_PLACES=506, PETRI_TRANSITIONS=749} [2024-06-27 20:44:14,889 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 465 predicate places. [2024-06-27 20:44:14,889 INFO L495 AbstractCegarLoop]: Abstraction has has 506 places, 749 transitions, 11109 flow [2024-06-27 20:44:14,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:14,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:44:14,889 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-27 20:44:14,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-27 20:44:14,889 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:44:14,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:44:14,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1322543826, now seen corresponding path program 7 times [2024-06-27 20:44:14,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:44:14,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823701614] [2024-06-27 20:44:14,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:44:14,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:44:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:44:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:44:15,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:44:15,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823701614] [2024-06-27 20:44:15,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823701614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:44:15,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:44:15,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:44:15,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157971889] [2024-06-27 20:44:15,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:44:15,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:44:15,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:44:15,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:44:15,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:44:15,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:44:15,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 749 transitions, 11109 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:15,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:44:15,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:44:15,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:44:17,897 INFO L124 PetriNetUnfolderBase]: 4984/7658 cut-off events. [2024-06-27 20:44:17,898 INFO L125 PetriNetUnfolderBase]: For 1168165/1168177 co-relation queries the response was YES. [2024-06-27 20:44:18,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67381 conditions, 7658 events. 4984/7658 cut-off events. For 1168165/1168177 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 45238 event pairs, 918 based on Foata normal form. 14/7668 useless extension candidates. Maximal degree in co-relation 67168. Up to 7412 conditions per place. [2024-06-27 20:44:18,043 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 657 selfloop transitions, 100 changer transitions 0/760 dead transitions. [2024-06-27 20:44:18,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 760 transitions, 12655 flow [2024-06-27 20:44:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:44:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:44:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-27 20:44:18,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-27 20:44:18,044 INFO L175 Difference]: Start difference. First operand has 506 places, 749 transitions, 11109 flow. Second operand 8 states and 116 transitions. [2024-06-27 20:44:18,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 760 transitions, 12655 flow [2024-06-27 20:44:22,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 760 transitions, 12528 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-27 20:44:22,861 INFO L231 Difference]: Finished difference. Result has 507 places, 749 transitions, 11187 flow [2024-06-27 20:44:22,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10982, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=749, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11187, PETRI_PLACES=507, PETRI_TRANSITIONS=749} [2024-06-27 20:44:22,861 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 466 predicate places. [2024-06-27 20:44:22,862 INFO L495 AbstractCegarLoop]: Abstraction has has 507 places, 749 transitions, 11187 flow [2024-06-27 20:44:22,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:22,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:44:22,862 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-27 20:44:22,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-27 20:44:22,862 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:44:22,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:44:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1322174430, now seen corresponding path program 5 times [2024-06-27 20:44:22,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:44:22,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951717127] [2024-06-27 20:44:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:44:22,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:44:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:44:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:44:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:44:23,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951717127] [2024-06-27 20:44:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951717127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:44:23,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:44:23,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:44:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206603523] [2024-06-27 20:44:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:44:23,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:44:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:44:23,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:44:23,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:44:23,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:44:23,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 749 transitions, 11187 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:23,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:44:23,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:44:23,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:44:25,937 INFO L124 PetriNetUnfolderBase]: 4979/7653 cut-off events. [2024-06-27 20:44:25,938 INFO L125 PetriNetUnfolderBase]: For 1174515/1174523 co-relation queries the response was YES. [2024-06-27 20:44:26,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67262 conditions, 7653 events. 4979/7653 cut-off events. For 1174515/1174523 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 45354 event pairs, 1266 based on Foata normal form. 10/7661 useless extension candidates. Maximal degree in co-relation 67048. Up to 7539 conditions per place. [2024-06-27 20:44:26,074 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 709 selfloop transitions, 50 changer transitions 0/762 dead transitions. [2024-06-27 20:44:26,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 762 transitions, 12815 flow [2024-06-27 20:44:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:44:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:44:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-27 20:44:26,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-27 20:44:26,076 INFO L175 Difference]: Start difference. First operand has 507 places, 749 transitions, 11187 flow. Second operand 8 states and 116 transitions. [2024-06-27 20:44:26,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 762 transitions, 12815 flow [2024-06-27 20:44:30,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 762 transitions, 12564 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 20:44:30,875 INFO L231 Difference]: Finished difference. Result has 508 places, 751 transitions, 11123 flow [2024-06-27 20:44:30,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10936, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=749, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11123, PETRI_PLACES=508, PETRI_TRANSITIONS=751} [2024-06-27 20:44:30,876 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 467 predicate places. [2024-06-27 20:44:30,876 INFO L495 AbstractCegarLoop]: Abstraction has has 508 places, 751 transitions, 11123 flow [2024-06-27 20:44:30,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:30,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:44:30,876 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-27 20:44:30,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-27 20:44:30,876 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:44:30,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:44:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash 641506632, now seen corresponding path program 1 times [2024-06-27 20:44:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:44:30,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5497908] [2024-06-27 20:44:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:44:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:44:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:44:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:44:31,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:44:31,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5497908] [2024-06-27 20:44:31,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5497908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:44:31,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:44:31,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:44:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554382303] [2024-06-27 20:44:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:44:31,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:44:31,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:44:31,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:44:31,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:44:31,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:44:31,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 751 transitions, 11123 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:31,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:44:31,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:44:31,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:44:33,964 INFO L124 PetriNetUnfolderBase]: 4964/7706 cut-off events. [2024-06-27 20:44:33,964 INFO L125 PetriNetUnfolderBase]: For 1434232/1434273 co-relation queries the response was YES. [2024-06-27 20:44:34,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70982 conditions, 7706 events. 4964/7706 cut-off events. For 1434232/1434273 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 46792 event pairs, 1561 based on Foata normal form. 20/7679 useless extension candidates. Maximal degree in co-relation 70767. Up to 7212 conditions per place. [2024-06-27 20:44:34,112 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 674 selfloop transitions, 29 changer transitions 0/790 dead transitions. [2024-06-27 20:44:34,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 790 transitions, 13073 flow [2024-06-27 20:44:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:44:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:44:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 20:44:34,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4075 [2024-06-27 20:44:34,113 INFO L175 Difference]: Start difference. First operand has 508 places, 751 transitions, 11123 flow. Second operand 10 states and 163 transitions. [2024-06-27 20:44:34,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 790 transitions, 13073 flow [2024-06-27 20:44:39,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 790 transitions, 12902 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-27 20:44:39,375 INFO L231 Difference]: Finished difference. Result has 512 places, 753 transitions, 11072 flow [2024-06-27 20:44:39,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10952, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11072, PETRI_PLACES=512, PETRI_TRANSITIONS=753} [2024-06-27 20:44:39,376 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 471 predicate places. [2024-06-27 20:44:39,376 INFO L495 AbstractCegarLoop]: Abstraction has has 512 places, 753 transitions, 11072 flow [2024-06-27 20:44:39,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:39,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:44:39,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:44:39,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-06-27 20:44:39,377 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:44:39,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:44:39,377 INFO L85 PathProgramCache]: Analyzing trace with hash -148513590, now seen corresponding path program 1 times [2024-06-27 20:44:39,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:44:39,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394670282] [2024-06-27 20:44:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:44:39,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:44:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:44:40,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-27 20:44:40,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:44:40,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394670282] [2024-06-27 20:44:40,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394670282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:44:40,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:44:40,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:44:40,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041812237] [2024-06-27 20:44:40,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:44:40,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:44:40,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:44:40,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:44:40,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:44:40,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:44:40,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 753 transitions, 11072 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:40,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:44:40,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:44:40,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:44:42,435 INFO L124 PetriNetUnfolderBase]: 5144/7899 cut-off events. [2024-06-27 20:44:42,436 INFO L125 PetriNetUnfolderBase]: For 1392158/1392168 co-relation queries the response was YES. [2024-06-27 20:44:42,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71303 conditions, 7899 events. 5144/7899 cut-off events. For 1392158/1392168 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 46901 event pairs, 946 based on Foata normal form. 22/7920 useless extension candidates. Maximal degree in co-relation 71087. Up to 7334 conditions per place. [2024-06-27 20:44:42,581 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 622 selfloop transitions, 160 changer transitions 0/785 dead transitions. [2024-06-27 20:44:42,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 785 transitions, 12846 flow [2024-06-27 20:44:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:44:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:44:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 20:44:42,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-27 20:44:42,582 INFO L175 Difference]: Start difference. First operand has 512 places, 753 transitions, 11072 flow. Second operand 9 states and 150 transitions. [2024-06-27 20:44:42,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 785 transitions, 12846 flow [2024-06-27 20:44:47,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 785 transitions, 12804 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 20:44:47,606 INFO L231 Difference]: Finished difference. Result has 515 places, 754 transitions, 11402 flow [2024-06-27 20:44:47,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11030, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11402, PETRI_PLACES=515, PETRI_TRANSITIONS=754} [2024-06-27 20:44:47,610 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 474 predicate places. [2024-06-27 20:44:47,610 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 754 transitions, 11402 flow [2024-06-27 20:44:47,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:47,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:44:47,610 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-27 20:44:47,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-06-27 20:44:47,611 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:44:47,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:44:47,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1125522922, now seen corresponding path program 2 times [2024-06-27 20:44:47,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:44:47,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378225405] [2024-06-27 20:44:47,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:44:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:44:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:44:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:44:48,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:44:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378225405] [2024-06-27 20:44:48,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378225405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:44:48,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:44:48,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:44:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430464115] [2024-06-27 20:44:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:44:48,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:44:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:44:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:44:48,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:44:48,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:44:48,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 754 transitions, 11402 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:48,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:44:48,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:44:48,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:44:50,707 INFO L124 PetriNetUnfolderBase]: 4978/7729 cut-off events. [2024-06-27 20:44:50,707 INFO L125 PetriNetUnfolderBase]: For 1417549/1417590 co-relation queries the response was YES. [2024-06-27 20:44:50,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70208 conditions, 7729 events. 4978/7729 cut-off events. For 1417549/1417590 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 46958 event pairs, 1598 based on Foata normal form. 24/7705 useless extension candidates. Maximal degree in co-relation 69990. Up to 7320 conditions per place. [2024-06-27 20:44:50,853 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 669 selfloop transitions, 27 changer transitions 0/783 dead transitions. [2024-06-27 20:44:50,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 783 transitions, 12982 flow [2024-06-27 20:44:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:44:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:44:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-06-27 20:44:50,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-27 20:44:50,855 INFO L175 Difference]: Start difference. First operand has 515 places, 754 transitions, 11402 flow. Second operand 10 states and 155 transitions. [2024-06-27 20:44:50,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 783 transitions, 12982 flow [2024-06-27 20:44:55,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 783 transitions, 12656 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 20:44:55,819 INFO L231 Difference]: Finished difference. Result has 518 places, 754 transitions, 11138 flow [2024-06-27 20:44:55,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11076, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11138, PETRI_PLACES=518, PETRI_TRANSITIONS=754} [2024-06-27 20:44:55,820 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 477 predicate places. [2024-06-27 20:44:55,820 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 754 transitions, 11138 flow [2024-06-27 20:44:55,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:55,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:44:55,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:44:55,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2024-06-27 20:44:55,821 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:44:55,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:44:55,821 INFO L85 PathProgramCache]: Analyzing trace with hash -309249637, now seen corresponding path program 1 times [2024-06-27 20:44:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:44:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452308541] [2024-06-27 20:44:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:44:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:44:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:44:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:44:56,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:44:56,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452308541] [2024-06-27 20:44:56,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452308541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:44:56,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:44:56,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:44:56,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811863124] [2024-06-27 20:44:56,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:44:56,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:44:56,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:44:56,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:44:56,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:44:56,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:44:56,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 754 transitions, 11138 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:44:56,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:44:56,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:44:56,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:44:58,814 INFO L124 PetriNetUnfolderBase]: 5139/7896 cut-off events. [2024-06-27 20:44:58,815 INFO L125 PetriNetUnfolderBase]: For 1299054/1299064 co-relation queries the response was YES. [2024-06-27 20:44:58,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69818 conditions, 7896 events. 5139/7896 cut-off events. For 1299054/1299064 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 46966 event pairs, 929 based on Foata normal form. 18/7913 useless extension candidates. Maximal degree in co-relation 69599. Up to 7277 conditions per place. [2024-06-27 20:44:58,953 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 632 selfloop transitions, 155 changer transitions 0/790 dead transitions. [2024-06-27 20:44:58,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 790 transitions, 12968 flow [2024-06-27 20:44:58,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:44:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:44:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-27 20:44:58,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-27 20:44:58,954 INFO L175 Difference]: Start difference. First operand has 518 places, 754 transitions, 11138 flow. Second operand 9 states and 152 transitions. [2024-06-27 20:44:58,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 790 transitions, 12968 flow [2024-06-27 20:45:04,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 790 transitions, 12909 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-27 20:45:04,805 INFO L231 Difference]: Finished difference. Result has 518 places, 755 transitions, 11430 flow [2024-06-27 20:45:04,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11079, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11430, PETRI_PLACES=518, PETRI_TRANSITIONS=755} [2024-06-27 20:45:04,806 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 477 predicate places. [2024-06-27 20:45:04,806 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 755 transitions, 11430 flow [2024-06-27 20:45:04,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:04,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:45:04,807 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-27 20:45:04,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2024-06-27 20:45:04,807 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:45:04,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:45:04,807 INFO L85 PathProgramCache]: Analyzing trace with hash 759654762, now seen corresponding path program 3 times [2024-06-27 20:45:04,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:45:04,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060887979] [2024-06-27 20:45:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:45:04,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:45:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:45:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:45:05,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:45:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060887979] [2024-06-27 20:45:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060887979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:45:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:45:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:45:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746696127] [2024-06-27 20:45:05,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:45:05,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:45:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:45:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:45:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:45:05,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:45:05,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 755 transitions, 11430 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:05,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:45:05,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:45:05,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:45:07,944 INFO L124 PetriNetUnfolderBase]: 5044/7832 cut-off events. [2024-06-27 20:45:07,944 INFO L125 PetriNetUnfolderBase]: For 1419550/1419602 co-relation queries the response was YES. [2024-06-27 20:45:08,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70919 conditions, 7832 events. 5044/7832 cut-off events. For 1419550/1419602 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 47685 event pairs, 1613 based on Foata normal form. 27/7807 useless extension candidates. Maximal degree in co-relation 70699. Up to 7410 conditions per place. [2024-06-27 20:45:08,102 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 649 selfloop transitions, 44 changer transitions 0/780 dead transitions. [2024-06-27 20:45:08,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 780 transitions, 13024 flow [2024-06-27 20:45:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:45:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:45:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-27 20:45:08,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-06-27 20:45:08,104 INFO L175 Difference]: Start difference. First operand has 518 places, 755 transitions, 11430 flow. Second operand 9 states and 143 transitions. [2024-06-27 20:45:08,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 780 transitions, 13024 flow [2024-06-27 20:45:13,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 780 transitions, 12691 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 20:45:13,066 INFO L231 Difference]: Finished difference. Result has 520 places, 756 transitions, 11223 flow [2024-06-27 20:45:13,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11097, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11223, PETRI_PLACES=520, PETRI_TRANSITIONS=756} [2024-06-27 20:45:13,066 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 479 predicate places. [2024-06-27 20:45:13,067 INFO L495 AbstractCegarLoop]: Abstraction has has 520 places, 756 transitions, 11223 flow [2024-06-27 20:45:13,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:13,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:45:13,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:45:13,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2024-06-27 20:45:13,067 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:45:13,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:45:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1850128452, now seen corresponding path program 1 times [2024-06-27 20:45:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:45:13,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794108474] [2024-06-27 20:45:13,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:45:13,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:45:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:45:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:45:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:45:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794108474] [2024-06-27 20:45:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794108474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:45:13,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:45:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:45:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415028731] [2024-06-27 20:45:13,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:45:13,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:45:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:45:13,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:45:13,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:45:13,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:45:13,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 756 transitions, 11223 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:13,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:45:13,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:45:13,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:45:15,910 INFO L124 PetriNetUnfolderBase]: 5211/8008 cut-off events. [2024-06-27 20:45:15,910 INFO L125 PetriNetUnfolderBase]: For 1311420/1311434 co-relation queries the response was YES. [2024-06-27 20:45:16,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71092 conditions, 8008 events. 5211/8008 cut-off events. For 1311420/1311434 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 47714 event pairs, 1020 based on Foata normal form. 18/8025 useless extension candidates. Maximal degree in co-relation 70871. Up to 7525 conditions per place. [2024-06-27 20:45:16,052 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 619 selfloop transitions, 170 changer transitions 0/792 dead transitions. [2024-06-27 20:45:16,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 792 transitions, 13031 flow [2024-06-27 20:45:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:45:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:45:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-06-27 20:45:16,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-27 20:45:16,053 INFO L175 Difference]: Start difference. First operand has 520 places, 756 transitions, 11223 flow. Second operand 10 states and 160 transitions. [2024-06-27 20:45:16,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 792 transitions, 13031 flow [2024-06-27 20:45:21,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 792 transitions, 12939 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 20:45:21,193 INFO L231 Difference]: Finished difference. Result has 524 places, 763 transitions, 11604 flow [2024-06-27 20:45:21,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11131, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11604, PETRI_PLACES=524, PETRI_TRANSITIONS=763} [2024-06-27 20:45:21,194 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 483 predicate places. [2024-06-27 20:45:21,194 INFO L495 AbstractCegarLoop]: Abstraction has has 524 places, 763 transitions, 11604 flow [2024-06-27 20:45:21,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:21,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:45:21,195 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-27 20:45:21,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-06-27 20:45:21,195 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:45:21,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:45:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1007250544, now seen corresponding path program 1 times [2024-06-27 20:45:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:45:21,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054088485] [2024-06-27 20:45:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:45:21,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:45:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:45:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:45:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:45:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054088485] [2024-06-27 20:45:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054088485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:45:22,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:45:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:45:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113851803] [2024-06-27 20:45:22,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:45:22,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:45:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:45:22,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:45:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:45:22,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:45:22,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 763 transitions, 11604 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:22,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:45:22,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:45:22,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:45:24,406 INFO L124 PetriNetUnfolderBase]: 5219/8031 cut-off events. [2024-06-27 20:45:24,406 INFO L125 PetriNetUnfolderBase]: For 1321340/1321340 co-relation queries the response was YES. [2024-06-27 20:45:24,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72693 conditions, 8031 events. 5219/8031 cut-off events. For 1321340/1321340 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 48090 event pairs, 1694 based on Foata normal form. 2/8032 useless extension candidates. Maximal degree in co-relation 72470. Up to 7936 conditions per place. [2024-06-27 20:45:24,570 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 749 selfloop transitions, 29 changer transitions 0/781 dead transitions. [2024-06-27 20:45:24,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 781 transitions, 13294 flow [2024-06-27 20:45:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:45:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:45:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-27 20:45:24,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-27 20:45:24,571 INFO L175 Difference]: Start difference. First operand has 524 places, 763 transitions, 11604 flow. Second operand 8 states and 118 transitions. [2024-06-27 20:45:24,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 781 transitions, 13294 flow [2024-06-27 20:45:30,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 781 transitions, 13016 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-27 20:45:30,299 INFO L231 Difference]: Finished difference. Result has 527 places, 765 transitions, 11457 flow [2024-06-27 20:45:30,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11326, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11457, PETRI_PLACES=527, PETRI_TRANSITIONS=765} [2024-06-27 20:45:30,299 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 486 predicate places. [2024-06-27 20:45:30,300 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 765 transitions, 11457 flow [2024-06-27 20:45:30,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:30,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:45:30,300 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-27 20:45:30,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2024-06-27 20:45:30,300 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:45:30,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:45:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash -153820724, now seen corresponding path program 2 times [2024-06-27 20:45:30,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:45:30,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404264822] [2024-06-27 20:45:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:45:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:45:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:45:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:45:30,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:45:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404264822] [2024-06-27 20:45:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404264822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:45:30,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:45:30,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:45:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742738426] [2024-06-27 20:45:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:45:30,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:45:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:45:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:45:30,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:45:31,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:45:31,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 765 transitions, 11457 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:31,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:45:31,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:45:31,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:45:33,194 INFO L124 PetriNetUnfolderBase]: 5227/8043 cut-off events. [2024-06-27 20:45:33,194 INFO L125 PetriNetUnfolderBase]: For 1340382/1340382 co-relation queries the response was YES. [2024-06-27 20:45:33,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72537 conditions, 8043 events. 5227/8043 cut-off events. For 1340382/1340382 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 48237 event pairs, 1706 based on Foata normal form. 2/8044 useless extension candidates. Maximal degree in co-relation 72313. Up to 7975 conditions per place. [2024-06-27 20:45:33,351 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 759 selfloop transitions, 17 changer transitions 0/779 dead transitions. [2024-06-27 20:45:33,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 779 transitions, 13121 flow [2024-06-27 20:45:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:45:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:45:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-27 20:45:33,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-27 20:45:33,353 INFO L175 Difference]: Start difference. First operand has 527 places, 765 transitions, 11457 flow. Second operand 8 states and 110 transitions. [2024-06-27 20:45:33,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 779 transitions, 13121 flow [2024-06-27 20:45:39,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 779 transitions, 13006 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-27 20:45:39,042 INFO L231 Difference]: Finished difference. Result has 529 places, 767 transitions, 11453 flow [2024-06-27 20:45:39,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11342, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11453, PETRI_PLACES=529, PETRI_TRANSITIONS=767} [2024-06-27 20:45:39,043 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 488 predicate places. [2024-06-27 20:45:39,043 INFO L495 AbstractCegarLoop]: Abstraction has has 529 places, 767 transitions, 11453 flow [2024-06-27 20:45:39,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:39,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:45:39,044 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-27 20:45:39,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2024-06-27 20:45:39,044 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:45:39,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:45:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash 839795214, now seen corresponding path program 3 times [2024-06-27 20:45:39,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:45:39,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917734588] [2024-06-27 20:45:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:45:39,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:45:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:45:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:45:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:45:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917734588] [2024-06-27 20:45:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917734588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:45:39,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:45:39,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:45:39,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725568448] [2024-06-27 20:45:39,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:45:39,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:45:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:45:39,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:45:39,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:45:39,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:45:39,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 767 transitions, 11453 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:39,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:45:39,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:45:39,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:45:42,155 INFO L124 PetriNetUnfolderBase]: 5235/8055 cut-off events. [2024-06-27 20:45:42,155 INFO L125 PetriNetUnfolderBase]: For 1362293/1362293 co-relation queries the response was YES. [2024-06-27 20:45:42,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72828 conditions, 8055 events. 5235/8055 cut-off events. For 1362293/1362293 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 48265 event pairs, 1703 based on Foata normal form. 2/8056 useless extension candidates. Maximal degree in co-relation 72603. Up to 7975 conditions per place. [2024-06-27 20:45:42,312 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 754 selfloop transitions, 24 changer transitions 0/781 dead transitions. [2024-06-27 20:45:42,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 781 transitions, 13125 flow [2024-06-27 20:45:42,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:45:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:45:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-27 20:45:42,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-27 20:45:42,314 INFO L175 Difference]: Start difference. First operand has 529 places, 767 transitions, 11453 flow. Second operand 8 states and 111 transitions. [2024-06-27 20:45:42,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 781 transitions, 13125 flow [2024-06-27 20:45:48,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 781 transitions, 13026 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 20:45:48,025 INFO L231 Difference]: Finished difference. Result has 531 places, 769 transitions, 11486 flow [2024-06-27 20:45:48,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11354, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11486, PETRI_PLACES=531, PETRI_TRANSITIONS=769} [2024-06-27 20:45:48,026 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 490 predicate places. [2024-06-27 20:45:48,026 INFO L495 AbstractCegarLoop]: Abstraction has has 531 places, 769 transitions, 11486 flow [2024-06-27 20:45:48,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:48,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:45:48,026 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-27 20:45:48,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2024-06-27 20:45:48,026 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:45:48,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:45:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash 839794966, now seen corresponding path program 1 times [2024-06-27 20:45:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:45:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409421724] [2024-06-27 20:45:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:45:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:45:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:45:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:45:48,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:45:48,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409421724] [2024-06-27 20:45:48,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409421724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:45:48,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:45:48,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:45:48,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891416971] [2024-06-27 20:45:48,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:45:48,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:45:48,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:45:48,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:45:48,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:45:48,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:45:48,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 769 transitions, 11486 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:48,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:45:48,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:45:48,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:45:50,946 INFO L124 PetriNetUnfolderBase]: 5242/8065 cut-off events. [2024-06-27 20:45:50,947 INFO L125 PetriNetUnfolderBase]: For 1366524/1366524 co-relation queries the response was YES. [2024-06-27 20:45:51,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72896 conditions, 8065 events. 5242/8065 cut-off events. For 1366524/1366524 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 48337 event pairs, 1707 based on Foata normal form. 1/8065 useless extension candidates. Maximal degree in co-relation 72670. Up to 7986 conditions per place. [2024-06-27 20:45:51,117 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 758 selfloop transitions, 26 changer transitions 0/787 dead transitions. [2024-06-27 20:45:51,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 787 transitions, 13235 flow [2024-06-27 20:45:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:45:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:45:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-27 20:45:51,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-27 20:45:51,119 INFO L175 Difference]: Start difference. First operand has 531 places, 769 transitions, 11486 flow. Second operand 8 states and 112 transitions. [2024-06-27 20:45:51,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 787 transitions, 13235 flow [2024-06-27 20:45:57,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 787 transitions, 13121 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-27 20:45:57,169 INFO L231 Difference]: Finished difference. Result has 533 places, 775 transitions, 11573 flow [2024-06-27 20:45:57,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11374, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11573, PETRI_PLACES=533, PETRI_TRANSITIONS=775} [2024-06-27 20:45:57,170 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 492 predicate places. [2024-06-27 20:45:57,170 INFO L495 AbstractCegarLoop]: Abstraction has has 533 places, 775 transitions, 11573 flow [2024-06-27 20:45:57,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:57,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:45:57,170 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-27 20:45:57,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2024-06-27 20:45:57,170 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:45:57,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:45:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1144858398, now seen corresponding path program 4 times [2024-06-27 20:45:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:45:57,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827181635] [2024-06-27 20:45:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:45:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:45:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:45:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:45:58,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:45:58,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827181635] [2024-06-27 20:45:58,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827181635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:45:58,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:45:58,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:45:58,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779375816] [2024-06-27 20:45:58,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:45:58,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:45:58,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:45:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:45:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:45:58,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:45:58,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 775 transitions, 11573 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:45:58,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:45:58,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:45:58,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:46:00,216 INFO L124 PetriNetUnfolderBase]: 5250/8077 cut-off events. [2024-06-27 20:46:00,216 INFO L125 PetriNetUnfolderBase]: For 1372058/1372058 co-relation queries the response was YES. [2024-06-27 20:46:00,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73088 conditions, 8077 events. 5250/8077 cut-off events. For 1372058/1372058 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 48412 event pairs, 1700 based on Foata normal form. 2/8078 useless extension candidates. Maximal degree in co-relation 72861. Up to 8000 conditions per place. [2024-06-27 20:46:00,369 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 765 selfloop transitions, 22 changer transitions 0/790 dead transitions. [2024-06-27 20:46:00,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 790 transitions, 13277 flow [2024-06-27 20:46:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:46:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:46:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-27 20:46:00,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-27 20:46:00,371 INFO L175 Difference]: Start difference. First operand has 533 places, 775 transitions, 11573 flow. Second operand 8 states and 113 transitions. [2024-06-27 20:46:00,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 790 transitions, 13277 flow [2024-06-27 20:46:06,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 790 transitions, 13137 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-06-27 20:46:06,795 INFO L231 Difference]: Finished difference. Result has 535 places, 777 transitions, 11560 flow [2024-06-27 20:46:06,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11433, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11560, PETRI_PLACES=535, PETRI_TRANSITIONS=777} [2024-06-27 20:46:06,796 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 494 predicate places. [2024-06-27 20:46:06,796 INFO L495 AbstractCegarLoop]: Abstraction has has 535 places, 777 transitions, 11560 flow [2024-06-27 20:46:06,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:06,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:46:06,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-27 20:46:06,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2024-06-27 20:46:06,796 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:46:06,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:46:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1948887662, now seen corresponding path program 5 times [2024-06-27 20:46:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:46:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047537204] [2024-06-27 20:46:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:46:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:46:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:46:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:46:07,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:46:07,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047537204] [2024-06-27 20:46:07,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047537204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:46:07,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:46:07,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:46:07,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617685699] [2024-06-27 20:46:07,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:46:07,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:46:07,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:46:07,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:46:07,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:46:07,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:46:07,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 777 transitions, 11560 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:07,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:46:07,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:46:07,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:46:09,925 INFO L124 PetriNetUnfolderBase]: 5245/8070 cut-off events. [2024-06-27 20:46:09,925 INFO L125 PetriNetUnfolderBase]: For 1377987/1377987 co-relation queries the response was YES. [2024-06-27 20:46:10,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72925 conditions, 8070 events. 5245/8070 cut-off events. For 1377987/1377987 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 48369 event pairs, 1706 based on Foata normal form. 2/8071 useless extension candidates. Maximal degree in co-relation 72697. Up to 7997 conditions per place. [2024-06-27 20:46:10,093 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 770 selfloop transitions, 18 changer transitions 0/791 dead transitions. [2024-06-27 20:46:10,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 791 transitions, 13248 flow [2024-06-27 20:46:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 20:46:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 20:46:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-27 20:46:10,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-27 20:46:10,095 INFO L175 Difference]: Start difference. First operand has 535 places, 777 transitions, 11560 flow. Second operand 8 states and 110 transitions. [2024-06-27 20:46:10,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 791 transitions, 13248 flow [2024-06-27 20:46:16,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 791 transitions, 13137 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-27 20:46:16,206 INFO L231 Difference]: Finished difference. Result has 537 places, 779 transitions, 11572 flow [2024-06-27 20:46:16,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11449, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=759, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11572, PETRI_PLACES=537, PETRI_TRANSITIONS=779} [2024-06-27 20:46:16,207 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 496 predicate places. [2024-06-27 20:46:16,207 INFO L495 AbstractCegarLoop]: Abstraction has has 537 places, 779 transitions, 11572 flow [2024-06-27 20:46:16,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:16,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:46:16,208 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-27 20:46:16,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2024-06-27 20:46:16,208 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:46:16,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:46:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1145043096, now seen corresponding path program 4 times [2024-06-27 20:46:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:46:16,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389509600] [2024-06-27 20:46:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:46:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:46:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:46:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:46:17,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:46:17,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389509600] [2024-06-27 20:46:17,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389509600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:46:17,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:46:17,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:46:17,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007449887] [2024-06-27 20:46:17,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:46:17,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:46:17,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:46:17,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:46:17,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:46:17,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:46:17,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 779 transitions, 11572 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:17,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:46:17,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:46:17,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:46:18,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([366] L754-->L757: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][309], [Black: 511#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 2043#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1029#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1542#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 523#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1541#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 2171#true, Black: 2059#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1042#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 538#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2073#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1559#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 326#true, Black: 1060#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 551#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1577#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork1InUse, Black: 2089#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 1075#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 565#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 563#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1591#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2106#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 44#L773true, Black: 579#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1092#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1090#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1607#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2125#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 593#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1107#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1621#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 1808#true, Black: 612#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1119#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 2142#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1635#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 775#true, Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 629#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1145#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 2161#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1654#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 638#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 479#true, Black: 2180#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1165#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 653#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2195#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1175#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 666#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1689#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 677#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2212#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 169#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1189#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1185#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 1195#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1705#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 25#L796true, Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 2229#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 691#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1207#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1722#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 2244#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 708#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 1221#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 706#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1235#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1741#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 2263#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 723#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 2257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 724#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 423#true, 446#true, Black: 221#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1247#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2275#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1759#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1757#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 149#true, Black: 744#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 741#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 17#L757true, Black: 746#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 236#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1261#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 740#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 1283#true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 742#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 200#true, Black: 1776#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2288#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1790#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 253#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 1275#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (<= 0 (div ~x$r_buff1_thd3~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (<= 0 (div ~x$r_buff0_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 766#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 764#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 248#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 765#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 252#(and (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 767#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 761#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2305#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1292#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1802#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1288#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1354#true, 794#true, Black: 271#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 787#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 780#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0)), Black: 785#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 2322#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1816#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1305#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1306#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1534#true, Black: 288#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 801#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 1828#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2339#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 804#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 802#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 803#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 215#true, Black: 1319#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1613#true, Black: 1837#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1840#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 817#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 305#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 2345#true, Black: 1332#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2354#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (<= 0 (div ~x$r_buff1_thd3~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (<= 0 (div ~x$r_buff0_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1330#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1335#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1853#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 320#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1867#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1167#true, Black: 850#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1362#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1366#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1361#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1879#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 350#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1891#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 363#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 731#true, Black: 1903#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 376#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1915#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1410#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 999#true, 1782#true, Black: 900#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 390#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 391#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1929#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 405#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 913#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 756#true, Black: 1947#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 421#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 932#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 930#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 1298#true, Black: 431#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 429#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 811#true, 1239#true, Black: 1965#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 440#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 957#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 20#L826true, Black: 1983#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 461#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1386#true, Black: 977#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1999#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 659#true, Black: 1490#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 472#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 471#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2015#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 997#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1507#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 494#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1006#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2029#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 2362#true, 1832#true, 1413#true, 1325#true, Black: 1524#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1018#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-27 20:46:18,759 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,759 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,760 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,760 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L773-->L776: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][698], [Black: 511#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 2043#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1029#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1542#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 523#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1541#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 2171#true, Black: 2059#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1042#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 538#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2073#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1559#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 326#true, Black: 1060#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 551#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1577#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork1InUse, Black: 2089#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 1075#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 565#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 563#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1591#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2106#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 579#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1092#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1090#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1607#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2125#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 593#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1107#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1621#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 1808#true, Black: 612#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1119#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 2142#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1635#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 775#true, Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 629#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1145#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 2161#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1654#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 638#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 479#true, Black: 2180#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1165#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 653#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2195#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1175#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 666#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1689#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 677#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2212#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 169#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1189#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1185#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 1195#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1705#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 25#L796true, Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 2229#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 691#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1207#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1722#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 2244#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 708#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 706#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 1221#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1235#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1741#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 2263#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 723#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 2257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 724#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 423#true, 446#true, Black: 221#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1247#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1759#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2275#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1757#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 149#true, Black: 744#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 741#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 746#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 236#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1261#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 740#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 1283#true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 742#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 200#true, Black: 1776#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2288#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1790#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 253#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 766#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 1275#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (<= 0 (div ~x$r_buff1_thd3~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (<= 0 (div ~x$r_buff0_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 764#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 248#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 765#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 252#(and (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 767#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 32#L776true, Black: 761#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2305#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1292#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1802#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1288#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1354#true, 794#true, Black: 271#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 787#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 780#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0)), Black: 785#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 2322#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1816#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1305#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1306#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1534#true, Black: 288#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 801#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 1828#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 804#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 2339#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 802#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 803#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 215#true, Black: 1319#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1613#true, Black: 1837#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1840#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 817#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 305#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 2345#true, Black: 1332#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2354#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (<= 0 (div ~x$r_buff1_thd3~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (<= 0 (div ~x$r_buff0_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1330#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1335#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1853#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 320#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1867#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1167#true, Black: 850#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1362#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1366#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1361#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1879#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 350#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1891#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 363#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 731#true, Black: 1903#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 376#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1915#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1410#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 999#true, 1782#true, Black: 900#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 390#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 391#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1929#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 405#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 913#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 756#true, Black: 1947#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 421#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 932#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 930#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 1298#true, Black: 431#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 429#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 811#true, 1239#true, Black: 1965#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 12#L754true, Black: 440#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 957#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 20#L826true, Black: 1983#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 461#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1386#true, Black: 977#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1999#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 659#true, Black: 1490#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 472#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 471#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2015#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 997#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1507#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 494#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1006#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2029#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 2362#true, 1832#true, 1413#true, 1325#true, Black: 1524#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1018#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-27 20:46:18,761 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,761 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,762 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,762 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L796-->L803: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_34 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_92 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_92) v_~x$w_buff0_used~0_91) (= v_~x~0_39 (ite .cse0 v_~x$w_buff0~0_37 (ite .cse1 v_~x$w_buff1~0_30 v_~x~0_40))) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_34) v_~x$r_buff0_thd3~0_33) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd3~0_33 256) 0)))) 0 v_~x$r_buff1_thd3~0_26) v_~x$r_buff1_thd3~0_25)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$w_buff1~0=v_~x$w_buff1~0_30, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_34, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_92} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$w_buff1~0=v_~x$w_buff1~0_30, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_33, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][292], [Black: 511#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 30#L803true, Black: 2043#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1029#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1542#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 523#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1541#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 2171#true, Black: 2059#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1042#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 538#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2073#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1559#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 326#true, Black: 1060#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 551#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1577#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork1InUse, Black: 2089#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 1075#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 565#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 55#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 563#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 60#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1591#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2106#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 44#L773true, Black: 579#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1092#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1090#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 74#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~x$flush_delayed~0 0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= ~x$read_delayed~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1607#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 81#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2125#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 593#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1107#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1621#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 91#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 1808#true, Black: 612#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1119#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 2142#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1635#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 775#true, Black: 114#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 629#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1145#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 2161#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1654#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 638#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 479#true, Black: 2180#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1165#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1671#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 653#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 141#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 142#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2195#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1175#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 666#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 156#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1689#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 677#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2212#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 169#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1189#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1185#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$mem_tmp~0 0)), Black: 1195#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1705#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 2229#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 691#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1207#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1722#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 192#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 2244#(and (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 708#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 1221#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 706#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 208#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1235#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1741#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 2263#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 2257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 723#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 724#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 423#true, 446#true, Black: 221#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 223#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1247#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2275#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1759#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1757#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 149#true, Black: 744#(and (= ~__unbuffered_cnt~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 739#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 741#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 235#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 746#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= ~x$w_buff1_used~0 0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 236#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1261#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 740#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 1283#true, Black: 233#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 742#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 200#true, Black: 1776#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2288#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1790#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 253#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 1275#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (<= 0 (div ~x$r_buff1_thd3~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (<= 0 (div ~x$r_buff0_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 766#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 764#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 248#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$w_buff1_used~0 0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 765#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 252#(and (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (<= 1 ~__unbuffered_cnt~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 767#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 761#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2305#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1292#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1802#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1288#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1354#true, 794#true, Black: 271#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 787#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 780#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$mem_tmp~0 0)), Black: 785#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 2322#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1816#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1305#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1306#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1534#true, Black: 288#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 801#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 1828#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2339#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 804#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 802#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), Black: 803#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 (div ~x$r_buff0_thd1~0 256)) (<= 0 ~x$r_buff1_thd1~0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= 1 ~x$r_buff0_thd2~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~x$mem_tmp~0 0)), 215#true, Black: 1319#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1613#true, Black: 1837#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1840#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 817#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 305#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 2 ~x~0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 2345#true, Black: 1332#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2354#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (<= 0 (div ~x$r_buff1_thd3~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~z~0 0) (<= 0 (div ~x$r_buff0_thd3~0 256)) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1330#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1335#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1853#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 320#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1867#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 338#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1167#true, Black: 850#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1362#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1366#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 1361#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1879#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 350#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1891#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 363#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 731#true, Black: 1903#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 376#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1915#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1410#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 999#true, 1782#true, Black: 900#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 390#(and (= 0 ~x$w_buff1~0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 391#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (or (= ~x~0 0) (= 2 ~x~0)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1929#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 405#(and (or (= ~x~0 0) (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 913#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 756#true, Black: 1947#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 421#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 932#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (or (= 2 ~x~0) (= ~x~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 930#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$r_buff1_thd2~0 0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 1298#true, Black: 431#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= 0 ~x$r_buff0_thd1~0) (= |#ghost~multithreaded| 1) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$read_delayed_var~0.base 0) (= 0 ~x$r_buff0_thd3~0) (= ~z~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 429#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 811#true, 1239#true, Black: 1965#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~__unbuffered_p2_EAX~0 1) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 12#L754true, Black: 440#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 957#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), 20#L826true, Black: 1983#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 461#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 1386#true, Black: 977#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1999#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 659#true, Black: 1490#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 472#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 471#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~y~0 0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2015#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 997#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1507#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 494#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= |#ghost~multithreaded| 1) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p2_EAX~0 1) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256))) (= ~y~0 1) (= ~x$mem_tmp~0 0)), Black: 1006#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 2029#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 2362#true, 1832#true, 1413#true, 1325#true, Black: 1524#(and (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd3~0 256)) ~x$r_buff1_thd3~0) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x~0 1) (= ~x$read_delayed_var~0.base 0) (<= 1 ~__unbuffered_cnt~0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 1018#(and (= ~__unbuffered_cnt~0 0) (= 0 ~x$w_buff1~0) (= ~z~0 1) (= ~x~0 0) (= ~x$read_delayed~0 (* (div ~x$read_delayed~0 256) 256)) (= (* (div ~x$flush_delayed~0 256) 256) ~x$flush_delayed~0) (= ~x$read_delayed_var~0.offset 0) (= (* (div ~x$r_buff0_thd1~0 256) 256) ~x$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= (* 256 (div ~x$r_buff0_thd3~0 256)) ~x$r_buff0_thd3~0) (= ~x$read_delayed_var~0.base 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0))]) [2024-06-27 20:46:18,763 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,764 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,764 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 20:46:18,764 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 20:46:19,410 INFO L124 PetriNetUnfolderBase]: 5136/7970 cut-off events. [2024-06-27 20:46:19,410 INFO L125 PetriNetUnfolderBase]: For 1541001/1541057 co-relation queries the response was YES. [2024-06-27 20:46:19,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73182 conditions, 7970 events. 5136/7970 cut-off events. For 1541001/1541057 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 48610 event pairs, 1626 based on Foata normal form. 29/7947 useless extension candidates. Maximal degree in co-relation 72953. Up to 7572 conditions per place. [2024-06-27 20:46:19,565 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 682 selfloop transitions, 31 changer transitions 0/800 dead transitions. [2024-06-27 20:46:19,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 800 transitions, 13208 flow [2024-06-27 20:46:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:46:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:46:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-27 20:46:19,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-27 20:46:19,567 INFO L175 Difference]: Start difference. First operand has 537 places, 779 transitions, 11572 flow. Second operand 9 states and 135 transitions. [2024-06-27 20:46:19,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 800 transitions, 13208 flow [2024-06-27 20:46:25,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 800 transitions, 13101 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-27 20:46:25,074 INFO L231 Difference]: Finished difference. Result has 540 places, 780 transitions, 11578 flow [2024-06-27 20:46:25,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11465, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=779, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11578, PETRI_PLACES=540, PETRI_TRANSITIONS=780} [2024-06-27 20:46:25,075 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 499 predicate places. [2024-06-27 20:46:25,075 INFO L495 AbstractCegarLoop]: Abstraction has has 540 places, 780 transitions, 11578 flow [2024-06-27 20:46:25,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:25,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:46:25,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:46:25,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2024-06-27 20:46:25,075 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:46:25,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:46:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1874496312, now seen corresponding path program 2 times [2024-06-27 20:46:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:46:25,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606217971] [2024-06-27 20:46:25,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:46:25,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:46:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:46:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:46:25,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:46:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606217971] [2024-06-27 20:46:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606217971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:46:25,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:46:25,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:46:25,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240185114] [2024-06-27 20:46:25,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:46:25,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:46:25,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:46:25,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:46:25,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:46:25,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:46:25,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 780 transitions, 11578 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:25,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:46:25,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:46:25,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:46:27,901 INFO L124 PetriNetUnfolderBase]: 5291/8129 cut-off events. [2024-06-27 20:46:27,902 INFO L125 PetriNetUnfolderBase]: For 1403938/1403952 co-relation queries the response was YES. [2024-06-27 20:46:28,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73511 conditions, 8129 events. 5291/8129 cut-off events. For 1403938/1403952 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 48539 event pairs, 1026 based on Foata normal form. 18/8146 useless extension candidates. Maximal degree in co-relation 73281. Up to 7614 conditions per place. [2024-06-27 20:46:28,060 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 634 selfloop transitions, 177 changer transitions 0/814 dead transitions. [2024-06-27 20:46:28,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 814 transitions, 13440 flow [2024-06-27 20:46:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:46:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:46:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 20:46:28,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2024-06-27 20:46:28,061 INFO L175 Difference]: Start difference. First operand has 540 places, 780 transitions, 11578 flow. Second operand 10 states and 164 transitions. [2024-06-27 20:46:28,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 814 transitions, 13440 flow [2024-06-27 20:46:34,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 814 transitions, 13365 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-27 20:46:35,001 INFO L231 Difference]: Finished difference. Result has 543 places, 783 transitions, 11960 flow [2024-06-27 20:46:35,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11503, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11960, PETRI_PLACES=543, PETRI_TRANSITIONS=783} [2024-06-27 20:46:35,002 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 502 predicate places. [2024-06-27 20:46:35,002 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 783 transitions, 11960 flow [2024-06-27 20:46:35,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:35,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:46:35,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:46:35,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2024-06-27 20:46:35,003 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:46:35,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:46:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash 542956265, now seen corresponding path program 1 times [2024-06-27 20:46:35,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:46:35,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553729350] [2024-06-27 20:46:35,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:46:35,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:46:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:46:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:46:35,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:46:35,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553729350] [2024-06-27 20:46:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553729350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:46:35,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:46:35,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:46:35,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477110971] [2024-06-27 20:46:35,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:46:35,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:46:35,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:46:35,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:46:35,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:46:35,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:46:35,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 783 transitions, 11960 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:35,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:46:35,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:46:35,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:46:38,015 INFO L124 PetriNetUnfolderBase]: 5309/8162 cut-off events. [2024-06-27 20:46:38,015 INFO L125 PetriNetUnfolderBase]: For 1404248/1404252 co-relation queries the response was YES. [2024-06-27 20:46:38,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74680 conditions, 8162 events. 5309/8162 cut-off events. For 1404248/1404252 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 49020 event pairs, 1259 based on Foata normal form. 5/8166 useless extension candidates. Maximal degree in co-relation 74449. Up to 7799 conditions per place. [2024-06-27 20:46:38,182 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 693 selfloop transitions, 127 changer transitions 0/823 dead transitions. [2024-06-27 20:46:38,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 823 transitions, 14192 flow [2024-06-27 20:46:38,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:46:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:46:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-27 20:46:38,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-27 20:46:38,184 INFO L175 Difference]: Start difference. First operand has 543 places, 783 transitions, 11960 flow. Second operand 9 states and 149 transitions. [2024-06-27 20:46:38,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 823 transitions, 14192 flow [2024-06-27 20:46:44,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 823 transitions, 13755 flow, removed 42 selfloop flow, removed 8 redundant places. [2024-06-27 20:46:44,574 INFO L231 Difference]: Finished difference. Result has 545 places, 793 transitions, 12052 flow [2024-06-27 20:46:44,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11527, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12052, PETRI_PLACES=545, PETRI_TRANSITIONS=793} [2024-06-27 20:46:44,575 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 504 predicate places. [2024-06-27 20:46:44,575 INFO L495 AbstractCegarLoop]: Abstraction has has 545 places, 793 transitions, 12052 flow [2024-06-27 20:46:44,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:44,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:46:44,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:46:44,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2024-06-27 20:46:44,576 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:46:44,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:46:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -148521185, now seen corresponding path program 2 times [2024-06-27 20:46:44,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:46:44,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610862248] [2024-06-27 20:46:44,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:46:44,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:46:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:46:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:46:45,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:46:45,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610862248] [2024-06-27 20:46:45,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610862248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:46:45,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:46:45,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:46:45,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137064906] [2024-06-27 20:46:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:46:45,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:46:45,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:46:45,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:46:45,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:46:45,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:46:45,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 793 transitions, 12052 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:45,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:46:45,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:46:45,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:46:47,580 INFO L124 PetriNetUnfolderBase]: 5306/8153 cut-off events. [2024-06-27 20:46:47,580 INFO L125 PetriNetUnfolderBase]: For 1414081/1414085 co-relation queries the response was YES. [2024-06-27 20:46:47,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74326 conditions, 8153 events. 5306/8153 cut-off events. For 1414081/1414085 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 48859 event pairs, 1307 based on Foata normal form. 5/8157 useless extension candidates. Maximal degree in co-relation 74093. Up to 7887 conditions per place. [2024-06-27 20:46:47,742 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 701 selfloop transitions, 114 changer transitions 0/818 dead transitions. [2024-06-27 20:46:47,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 818 transitions, 13774 flow [2024-06-27 20:46:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:46:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:46:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-27 20:46:47,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-06-27 20:46:47,743 INFO L175 Difference]: Start difference. First operand has 545 places, 793 transitions, 12052 flow. Second operand 9 states and 143 transitions. [2024-06-27 20:46:47,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 818 transitions, 13774 flow [2024-06-27 20:46:54,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 818 transitions, 13622 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-27 20:46:54,321 INFO L231 Difference]: Finished difference. Result has 550 places, 793 transitions, 12145 flow [2024-06-27 20:46:54,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11900, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12145, PETRI_PLACES=550, PETRI_TRANSITIONS=793} [2024-06-27 20:46:54,322 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 509 predicate places. [2024-06-27 20:46:54,322 INFO L495 AbstractCegarLoop]: Abstraction has has 550 places, 793 transitions, 12145 flow [2024-06-27 20:46:54,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:54,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:46:54,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:46:54,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2024-06-27 20:46:54,322 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:46:54,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:46:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1889795672, now seen corresponding path program 2 times [2024-06-27 20:46:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:46:54,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628143631] [2024-06-27 20:46:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:46:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:46:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:46:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:46:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:46:54,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628143631] [2024-06-27 20:46:54,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628143631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:46:54,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:46:54,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 20:46:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520272614] [2024-06-27 20:46:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:46:54,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 20:46:54,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:46:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 20:46:54,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 20:46:54,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-27 20:46:54,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 793 transitions, 12145 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:46:54,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:46:54,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-27 20:46:54,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:46:57,651 INFO L124 PetriNetUnfolderBase]: 5212/8071 cut-off events. [2024-06-27 20:46:57,651 INFO L125 PetriNetUnfolderBase]: For 1579849/1579883 co-relation queries the response was YES. [2024-06-27 20:46:57,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75204 conditions, 8071 events. 5212/8071 cut-off events. For 1579849/1579883 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 48700 event pairs, 852 based on Foata normal form. 42/8085 useless extension candidates. Maximal degree in co-relation 74970. Up to 6883 conditions per place. [2024-06-27 20:46:57,792 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 596 selfloop transitions, 161 changer transitions 0/832 dead transitions. [2024-06-27 20:46:57,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 832 transitions, 14237 flow [2024-06-27 20:46:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:46:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:46:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-27 20:46:57,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4361111111111111 [2024-06-27 20:46:57,793 INFO L175 Difference]: Start difference. First operand has 550 places, 793 transitions, 12145 flow. Second operand 9 states and 157 transitions. [2024-06-27 20:46:57,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 832 transitions, 14237 flow [2024-06-27 20:47:03,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 832 transitions, 14088 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 20:47:03,975 INFO L231 Difference]: Finished difference. Result has 554 places, 795 transitions, 12397 flow [2024-06-27 20:47:03,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11996, PETRI_DIFFERENCE_MINUEND_PLACES=545, 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=12397, PETRI_PLACES=554, PETRI_TRANSITIONS=795} [2024-06-27 20:47:03,976 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 513 predicate places. [2024-06-27 20:47:03,976 INFO L495 AbstractCegarLoop]: Abstraction has has 554 places, 795 transitions, 12397 flow [2024-06-27 20:47:03,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:47:03,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:47:03,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:47:03,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2024-06-27 20:47:03,977 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:47:03,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:47:03,977 INFO L85 PathProgramCache]: Analyzing trace with hash -871809930, now seen corresponding path program 3 times [2024-06-27 20:47:03,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:47:03,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794361634] [2024-06-27 20:47:03,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:47:03,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:47:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:47:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:47:04,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:47:04,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794361634] [2024-06-27 20:47:04,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794361634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:47:04,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:47:04,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:47:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000587659] [2024-06-27 20:47:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:47:04,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:47:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:47:04,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:47:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:47:04,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:47:04,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 795 transitions, 12397 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:47:04,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:47:04,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:47:04,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:47:07,601 INFO L124 PetriNetUnfolderBase]: 5436/8348 cut-off events. [2024-06-27 20:47:07,601 INFO L125 PetriNetUnfolderBase]: For 1604201/1604211 co-relation queries the response was YES. [2024-06-27 20:47:07,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78158 conditions, 8348 events. 5436/8348 cut-off events. For 1604201/1604211 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 50019 event pairs, 1013 based on Foata normal form. 18/8365 useless extension candidates. Maximal degree in co-relation 77923. Up to 7557 conditions per place. [2024-06-27 20:47:07,762 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 678 selfloop transitions, 156 changer transitions 0/837 dead transitions. [2024-06-27 20:47:07,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 837 transitions, 14416 flow [2024-06-27 20:47:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:47:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:47:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-27 20:47:07,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-27 20:47:07,764 INFO L175 Difference]: Start difference. First operand has 554 places, 795 transitions, 12397 flow. Second operand 9 states and 156 transitions. [2024-06-27 20:47:07,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 837 transitions, 14416 flow [2024-06-27 20:47:15,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 837 transitions, 14203 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-27 20:47:15,397 INFO L231 Difference]: Finished difference. Result has 558 places, 797 transitions, 12584 flow [2024-06-27 20:47:15,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12215, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12584, PETRI_PLACES=558, PETRI_TRANSITIONS=797} [2024-06-27 20:47:15,398 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 517 predicate places. [2024-06-27 20:47:15,398 INFO L495 AbstractCegarLoop]: Abstraction has has 558 places, 797 transitions, 12584 flow [2024-06-27 20:47:15,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:47:15,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:47:15,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:47:15,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2024-06-27 20:47:15,399 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:47:15,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:47:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1525846158, now seen corresponding path program 1 times [2024-06-27 20:47:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:47:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812698863] [2024-06-27 20:47:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:47:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:47:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:47:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:47:16,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:47:16,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812698863] [2024-06-27 20:47:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812698863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:47:16,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:47:16,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:47:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102099160] [2024-06-27 20:47:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:47:16,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:47:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:47:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:47:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:47:16,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:47:16,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 797 transitions, 12584 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:47:16,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:47:16,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:47:16,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:47:18,957 INFO L124 PetriNetUnfolderBase]: 5446/8364 cut-off events. [2024-06-27 20:47:18,958 INFO L125 PetriNetUnfolderBase]: For 1568037/1568051 co-relation queries the response was YES. [2024-06-27 20:47:19,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78604 conditions, 8364 events. 5446/8364 cut-off events. For 1568037/1568051 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 50206 event pairs, 1039 based on Foata normal form. 16/8379 useless extension candidates. Maximal degree in co-relation 78367. Up to 8112 conditions per place. [2024-06-27 20:47:19,120 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 751 selfloop transitions, 80 changer transitions 0/834 dead transitions. [2024-06-27 20:47:19,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 834 transitions, 14464 flow [2024-06-27 20:47:19,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:47:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:47:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-27 20:47:19,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925 [2024-06-27 20:47:19,121 INFO L175 Difference]: Start difference. First operand has 558 places, 797 transitions, 12584 flow. Second operand 10 states and 157 transitions. [2024-06-27 20:47:19,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 834 transitions, 14464 flow [2024-06-27 20:47:26,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 834 transitions, 14130 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 20:47:26,711 INFO L231 Difference]: Finished difference. Result has 561 places, 800 transitions, 12499 flow [2024-06-27 20:47:26,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12250, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12499, PETRI_PLACES=561, PETRI_TRANSITIONS=800} [2024-06-27 20:47:26,712 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 520 predicate places. [2024-06-27 20:47:26,712 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 800 transitions, 12499 flow [2024-06-27 20:47:26,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:47:26,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:47:26,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:47:26,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2024-06-27 20:47:26,713 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:47:26,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:47:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1336326598, now seen corresponding path program 2 times [2024-06-27 20:47:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:47:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922897538] [2024-06-27 20:47:26,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:47:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:47:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:47:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:47:27,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:47:27,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922897538] [2024-06-27 20:47:27,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922897538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:47:27,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:47:27,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:47:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144424493] [2024-06-27 20:47:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:47:27,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:47:27,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:47:27,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:47:27,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:47:27,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:47:27,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 800 transitions, 12499 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:47:27,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:47:27,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:47:27,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:47:30,239 INFO L124 PetriNetUnfolderBase]: 5472/8400 cut-off events. [2024-06-27 20:47:30,239 INFO L125 PetriNetUnfolderBase]: For 1606871/1606885 co-relation queries the response was YES. [2024-06-27 20:47:30,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79373 conditions, 8400 events. 5472/8400 cut-off events. For 1606871/1606885 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 50433 event pairs, 1046 based on Foata normal form. 16/8415 useless extension candidates. Maximal degree in co-relation 79135. Up to 8009 conditions per place. [2024-06-27 20:47:30,387 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 700 selfloop transitions, 135 changer transitions 0/838 dead transitions. [2024-06-27 20:47:30,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 838 transitions, 14739 flow [2024-06-27 20:47:30,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:47:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:47:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-06-27 20:47:30,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.405 [2024-06-27 20:47:30,388 INFO L175 Difference]: Start difference. First operand has 561 places, 800 transitions, 12499 flow. Second operand 10 states and 162 transitions. [2024-06-27 20:47:30,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 838 transitions, 14739 flow [2024-06-27 20:47:37,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 838 transitions, 14509 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-06-27 20:47:37,649 INFO L231 Difference]: Finished difference. Result has 564 places, 806 transitions, 12716 flow [2024-06-27 20:47:37,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12269, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12716, PETRI_PLACES=564, PETRI_TRANSITIONS=806} [2024-06-27 20:47:37,650 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 523 predicate places. [2024-06-27 20:47:37,650 INFO L495 AbstractCegarLoop]: Abstraction has has 564 places, 806 transitions, 12716 flow [2024-06-27 20:47:37,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:47:37,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:47:37,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:47:37,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2024-06-27 20:47:37,651 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:47:37,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:47:37,651 INFO L85 PathProgramCache]: Analyzing trace with hash 318436148, now seen corresponding path program 3 times [2024-06-27 20:47:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:47:37,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087627470] [2024-06-27 20:47:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:47:37,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:47:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:47:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:47:38,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:47:38,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087627470] [2024-06-27 20:47:38,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087627470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:47:38,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:47:38,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:47:38,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609572395] [2024-06-27 20:47:38,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:47:38,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:47:38,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:47:38,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:47:38,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:47:38,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:47:38,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 806 transitions, 12716 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:47:38,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:47:38,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:47:38,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:47:40,952 INFO L124 PetriNetUnfolderBase]: 5492/8431 cut-off events. [2024-06-27 20:47:40,953 INFO L125 PetriNetUnfolderBase]: For 1656178/1656192 co-relation queries the response was YES. [2024-06-27 20:47:41,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80299 conditions, 8431 events. 5492/8431 cut-off events. For 1656178/1656192 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 50558 event pairs, 1051 based on Foata normal form. 18/8448 useless extension candidates. Maximal degree in co-relation 80060. Up to 7834 conditions per place. [2024-06-27 20:47:41,251 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 650 selfloop transitions, 191 changer transitions 0/844 dead transitions. [2024-06-27 20:47:41,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 844 transitions, 14672 flow [2024-06-27 20:47:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:47:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:47:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 20:47:41,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-27 20:47:41,253 INFO L175 Difference]: Start difference. First operand has 564 places, 806 transitions, 12716 flow. Second operand 10 states and 170 transitions. [2024-06-27 20:47:41,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 844 transitions, 14672 flow [2024-06-27 20:47:48,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 844 transitions, 14431 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-27 20:47:48,670 INFO L231 Difference]: Finished difference. Result has 568 places, 809 transitions, 12970 flow [2024-06-27 20:47:48,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12475, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12970, PETRI_PLACES=568, PETRI_TRANSITIONS=809} [2024-06-27 20:47:48,671 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 527 predicate places. [2024-06-27 20:47:48,671 INFO L495 AbstractCegarLoop]: Abstraction has has 568 places, 809 transitions, 12970 flow [2024-06-27 20:47:48,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:47:48,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:47:48,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:47:48,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2024-06-27 20:47:48,672 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:47:48,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:47:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash -202182048, now seen corresponding path program 3 times [2024-06-27 20:47:48,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:47:48,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657652276] [2024-06-27 20:47:48,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:47:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:47:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:47:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:47:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:47:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657652276] [2024-06-27 20:47:49,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657652276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:47:49,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:47:49,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:47:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376880263] [2024-06-27 20:47:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:47:49,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:47:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:47:49,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:47:49,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:47:49,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:47:49,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 809 transitions, 12970 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:47:49,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:47:49,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:47:49,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:47:52,313 INFO L124 PetriNetUnfolderBase]: 5486/8422 cut-off events. [2024-06-27 20:47:52,313 INFO L125 PetriNetUnfolderBase]: For 1639459/1639473 co-relation queries the response was YES. [2024-06-27 20:47:52,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80900 conditions, 8422 events. 5486/8422 cut-off events. For 1639459/1639473 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 50554 event pairs, 1091 based on Foata normal form. 16/8437 useless extension candidates. Maximal degree in co-relation 80659. Up to 8156 conditions per place. [2024-06-27 20:47:52,473 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 717 selfloop transitions, 116 changer transitions 0/836 dead transitions. [2024-06-27 20:47:52,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 836 transitions, 14740 flow [2024-06-27 20:47:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:47:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:47:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2024-06-27 20:47:52,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3825 [2024-06-27 20:47:52,474 INFO L175 Difference]: Start difference. First operand has 568 places, 809 transitions, 12970 flow. Second operand 10 states and 153 transitions. [2024-06-27 20:47:52,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 836 transitions, 14740 flow [2024-06-27 20:48:00,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 836 transitions, 14227 flow, removed 68 selfloop flow, removed 8 redundant places. [2024-06-27 20:48:00,695 INFO L231 Difference]: Finished difference. Result has 570 places, 809 transitions, 12696 flow [2024-06-27 20:48:00,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12457, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12696, PETRI_PLACES=570, PETRI_TRANSITIONS=809} [2024-06-27 20:48:00,696 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 529 predicate places. [2024-06-27 20:48:00,696 INFO L495 AbstractCegarLoop]: Abstraction has has 570 places, 809 transitions, 12696 flow [2024-06-27 20:48:00,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:48:00,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:48:00,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:48:00,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2024-06-27 20:48:00,696 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:48:00,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:48:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1242961085, now seen corresponding path program 3 times [2024-06-27 20:48:00,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:48:00,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591674111] [2024-06-27 20:48:00,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:48:00,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:48:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:48:01,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-27 20:48:01,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:48:01,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591674111] [2024-06-27 20:48:01,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591674111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:48:01,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:48:01,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:48:01,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523401902] [2024-06-27 20:48:01,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:48:01,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:48:01,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:48:01,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:48:01,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:48:01,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:48:01,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 809 transitions, 12696 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:48:01,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:48:01,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:48:01,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:48:04,402 INFO L124 PetriNetUnfolderBase]: 5500/8436 cut-off events. [2024-06-27 20:48:04,403 INFO L125 PetriNetUnfolderBase]: For 1635849/1635857 co-relation queries the response was YES. [2024-06-27 20:48:04,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80412 conditions, 8436 events. 5500/8436 cut-off events. For 1635849/1635857 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 50579 event pairs, 1011 based on Foata normal form. 9/8444 useless extension candidates. Maximal degree in co-relation 80170. Up to 8083 conditions per place. [2024-06-27 20:48:04,551 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 708 selfloop transitions, 135 changer transitions 0/846 dead transitions. [2024-06-27 20:48:04,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 846 transitions, 14940 flow [2024-06-27 20:48:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:48:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:48:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 20:48:04,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-27 20:48:04,552 INFO L175 Difference]: Start difference. First operand has 570 places, 809 transitions, 12696 flow. Second operand 9 states and 150 transitions. [2024-06-27 20:48:04,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 846 transitions, 14940 flow [2024-06-27 20:48:12,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 846 transitions, 14697 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-27 20:48:12,126 INFO L231 Difference]: Finished difference. Result has 572 places, 818 transitions, 12974 flow [2024-06-27 20:48:12,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12453, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12974, PETRI_PLACES=572, PETRI_TRANSITIONS=818} [2024-06-27 20:48:12,127 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 531 predicate places. [2024-06-27 20:48:12,127 INFO L495 AbstractCegarLoop]: Abstraction has has 572 places, 818 transitions, 12974 flow [2024-06-27 20:48:12,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:48:12,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:48:12,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:48:12,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2024-06-27 20:48:12,128 INFO L420 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:48:12,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:48:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -918615669, now seen corresponding path program 4 times [2024-06-27 20:48:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:48:12,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419886849] [2024-06-27 20:48:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:48:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:48:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:48:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:48:12,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:48:12,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419886849] [2024-06-27 20:48:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419886849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:48:12,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:48:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:48:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726397043] [2024-06-27 20:48:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:48:12,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:48:12,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:48:12,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:48:12,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:48:12,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:48:12,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 818 transitions, 12974 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:48:12,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:48:12,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:48:12,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:48:15,763 INFO L124 PetriNetUnfolderBase]: 5505/8445 cut-off events. [2024-06-27 20:48:15,763 INFO L125 PetriNetUnfolderBase]: For 1658926/1658934 co-relation queries the response was YES. [2024-06-27 20:48:15,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80870 conditions, 8445 events. 5505/8445 cut-off events. For 1658926/1658934 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 50668 event pairs, 1025 based on Foata normal form. 9/8453 useless extension candidates. Maximal degree in co-relation 80626. Up to 8187 conditions per place. [2024-06-27 20:48:15,912 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 730 selfloop transitions, 111 changer transitions 0/844 dead transitions. [2024-06-27 20:48:15,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 844 transitions, 14808 flow [2024-06-27 20:48:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 20:48:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 20:48:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-27 20:48:15,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-27 20:48:15,913 INFO L175 Difference]: Start difference. First operand has 572 places, 818 transitions, 12974 flow. Second operand 9 states and 145 transitions. [2024-06-27 20:48:15,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 844 transitions, 14808 flow [2024-06-27 20:48:24,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 844 transitions, 14520 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-27 20:48:24,205 INFO L231 Difference]: Finished difference. Result has 575 places, 821 transitions, 13003 flow [2024-06-27 20:48:24,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12698, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13003, PETRI_PLACES=575, PETRI_TRANSITIONS=821} [2024-06-27 20:48:24,206 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 534 predicate places. [2024-06-27 20:48:24,206 INFO L495 AbstractCegarLoop]: Abstraction has has 575 places, 821 transitions, 13003 flow [2024-06-27 20:48:24,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:48:24,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:48:24,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:48:24,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2024-06-27 20:48:24,207 INFO L420 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:48:24,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:48:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1086839494, now seen corresponding path program 4 times [2024-06-27 20:48:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:48:24,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093274143] [2024-06-27 20:48:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:48:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:48:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:48:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:48:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:48:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093274143] [2024-06-27 20:48:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093274143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:48:24,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:48:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:48:24,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268172802] [2024-06-27 20:48:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:48:24,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:48:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:48:24,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:48:24,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:48:24,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:48:24,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 821 transitions, 13003 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:48:24,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:48:24,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:48:24,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:48:27,722 INFO L124 PetriNetUnfolderBase]: 5539/8493 cut-off events. [2024-06-27 20:48:27,722 INFO L125 PetriNetUnfolderBase]: For 1693247/1693261 co-relation queries the response was YES. [2024-06-27 20:48:27,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81311 conditions, 8493 events. 5539/8493 cut-off events. For 1693247/1693261 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 50974 event pairs, 1005 based on Foata normal form. 16/8508 useless extension candidates. Maximal degree in co-relation 81067. Up to 8228 conditions per place. [2024-06-27 20:48:27,871 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 774 selfloop transitions, 85 changer transitions 0/862 dead transitions. [2024-06-27 20:48:27,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 862 transitions, 15032 flow [2024-06-27 20:48:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:48:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:48:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 20:48:27,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.395 [2024-06-27 20:48:27,872 INFO L175 Difference]: Start difference. First operand has 575 places, 821 transitions, 13003 flow. Second operand 10 states and 158 transitions. [2024-06-27 20:48:27,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 862 transitions, 15032 flow [2024-06-27 20:48:36,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 862 transitions, 14755 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-27 20:48:36,885 INFO L231 Difference]: Finished difference. Result has 578 places, 830 transitions, 13115 flow [2024-06-27 20:48:36,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12726, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13115, PETRI_PLACES=578, PETRI_TRANSITIONS=830} [2024-06-27 20:48:36,886 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 537 predicate places. [2024-06-27 20:48:36,886 INFO L495 AbstractCegarLoop]: Abstraction has has 578 places, 830 transitions, 13115 flow [2024-06-27 20:48:36,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:48:36,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:48:36,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:48:36,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2024-06-27 20:48:36,887 INFO L420 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:48:36,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:48:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1086719338, now seen corresponding path program 4 times [2024-06-27 20:48:36,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:48:36,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353414576] [2024-06-27 20:48:36,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:48:36,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:48:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:48:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:48:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:48:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353414576] [2024-06-27 20:48:37,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353414576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:48:37,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:48:37,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:48:37,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93058112] [2024-06-27 20:48:37,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:48:37,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:48:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:48:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:48:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:48:37,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:48:37,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 830 transitions, 13115 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:48:37,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:48:37,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:48:37,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:48:40,576 INFO L124 PetriNetUnfolderBase]: 5651/8651 cut-off events. [2024-06-27 20:48:40,577 INFO L125 PetriNetUnfolderBase]: For 1784848/1784862 co-relation queries the response was YES. [2024-06-27 20:48:40,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83781 conditions, 8651 events. 5651/8651 cut-off events. For 1784848/1784862 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 51954 event pairs, 1050 based on Foata normal form. 18/8668 useless extension candidates. Maximal degree in co-relation 83535. Up to 8009 conditions per place. [2024-06-27 20:48:40,734 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 696 selfloop transitions, 186 changer transitions 0/885 dead transitions. [2024-06-27 20:48:40,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 885 transitions, 15633 flow [2024-06-27 20:48:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:48:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:48:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 20:48:40,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-06-27 20:48:40,735 INFO L175 Difference]: Start difference. First operand has 578 places, 830 transitions, 13115 flow. Second operand 10 states and 172 transitions. [2024-06-27 20:48:40,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 885 transitions, 15633 flow [2024-06-27 20:48:49,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 885 transitions, 15453 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-27 20:48:49,357 INFO L231 Difference]: Finished difference. Result has 585 places, 849 transitions, 13685 flow [2024-06-27 20:48:49,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12935, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13685, PETRI_PLACES=585, PETRI_TRANSITIONS=849} [2024-06-27 20:48:49,357 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 544 predicate places. [2024-06-27 20:48:49,357 INFO L495 AbstractCegarLoop]: Abstraction has has 585 places, 849 transitions, 13685 flow [2024-06-27 20:48:49,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:48:49,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:48:49,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:48:49,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2024-06-27 20:48:49,358 INFO L420 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:48:49,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:48:49,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1086719524, now seen corresponding path program 5 times [2024-06-27 20:48:49,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:48:49,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288580680] [2024-06-27 20:48:49,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:48:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:48:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:48:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 20:48:49,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:48:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288580680] [2024-06-27 20:48:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288580680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:48:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:48:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:48:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732222312] [2024-06-27 20:48:49,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:48:49,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:48:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:48:49,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:48:49,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:48:50,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:48:50,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 849 transitions, 13685 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:48:50,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:48:50,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:48:50,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:48:52,865 INFO L124 PetriNetUnfolderBase]: 5697/8713 cut-off events. [2024-06-27 20:48:52,865 INFO L125 PetriNetUnfolderBase]: For 1817678/1817692 co-relation queries the response was YES. [2024-06-27 20:48:53,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85790 conditions, 8713 events. 5697/8713 cut-off events. For 1817678/1817692 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 52293 event pairs, 1051 based on Foata normal form. 16/8728 useless extension candidates. Maximal degree in co-relation 85541. Up to 8291 conditions per place. [2024-06-27 20:48:53,210 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 746 selfloop transitions, 142 changer transitions 0/891 dead transitions. [2024-06-27 20:48:53,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 891 transitions, 16097 flow [2024-06-27 20:48:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:48:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:48:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 20:48:53,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4075 [2024-06-27 20:48:53,211 INFO L175 Difference]: Start difference. First operand has 585 places, 849 transitions, 13685 flow. Second operand 10 states and 163 transitions. [2024-06-27 20:48:53,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 891 transitions, 16097 flow [2024-06-27 20:49:02,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 891 transitions, 15878 flow, removed 67 selfloop flow, removed 4 redundant places. [2024-06-27 20:49:02,440 INFO L231 Difference]: Finished difference. Result has 592 places, 861 transitions, 14037 flow [2024-06-27 20:49:02,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13466, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14037, PETRI_PLACES=592, PETRI_TRANSITIONS=861} [2024-06-27 20:49:02,441 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 551 predicate places. [2024-06-27 20:49:02,441 INFO L495 AbstractCegarLoop]: Abstraction has has 592 places, 861 transitions, 14037 flow [2024-06-27 20:49:02,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:49:02,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 20:49:02,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 20:49:02,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2024-06-27 20:49:02,442 INFO L420 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 20:49:02,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 20:49:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -909350668, now seen corresponding path program 5 times [2024-06-27 20:49:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 20:49:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870463835] [2024-06-27 20:49:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 20:49:02,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 20:49:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 20:49:02,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-27 20:49:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 20:49:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870463835] [2024-06-27 20:49:02,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870463835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 20:49:02,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 20:49:02,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 20:49:02,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608129766] [2024-06-27 20:49:02,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 20:49:02,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 20:49:02,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 20:49:02,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 20:49:02,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 20:49:03,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-06-27 20:49:03,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 861 transitions, 14037 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 20:49:03,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 20:49:03,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-06-27 20:49:03,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 20:49:05,991 INFO L124 PetriNetUnfolderBase]: 5717/8742 cut-off events. [2024-06-27 20:49:05,992 INFO L125 PetriNetUnfolderBase]: For 1865927/1865941 co-relation queries the response was YES. [2024-06-27 20:49:06,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86737 conditions, 8742 events. 5717/8742 cut-off events. For 1865927/1865941 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 52472 event pairs, 1103 based on Foata normal form. 18/8759 useless extension candidates. Maximal degree in co-relation 86485. Up to 8247 conditions per place. [2024-06-27 20:49:06,343 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 728 selfloop transitions, 164 changer transitions 0/895 dead transitions. [2024-06-27 20:49:06,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 895 transitions, 16062 flow [2024-06-27 20:49:06,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 20:49:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 20:49:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 20:49:06,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4075 [2024-06-27 20:49:06,344 INFO L175 Difference]: Start difference. First operand has 592 places, 861 transitions, 14037 flow. Second operand 10 states and 163 transitions. [2024-06-27 20:49:06,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 895 transitions, 16062 flow