./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix003.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/mutex-meet-nonrel/mix003.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/mix003.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix003.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-28 02:49:48,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:49:48,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:49:48,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:49:48,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:49:48,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:49:48,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:49:48,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:49:48,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:49:48,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:49:48,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:49:48,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:49:48,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:49:48,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:49:48,756 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:49:48,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:49:48,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:49:48,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:49:48,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:49:48,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:49:48,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:49:48,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:49:48,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:49:48,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:49:48,759 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:49:48,759 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:49:48,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:49:48,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:49:48,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:49:48,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:49:48,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:49:48,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:49:48,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:49:48,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:49:48,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:49:48,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:49:48,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:49:48,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:49:48,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:49:48,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:49:48,762 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:49:48,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:49:48,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:49:48,763 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-28 02:49:49,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:49:49,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:49:49,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:49:49,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:49:49,035 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:49:49,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-06-28 02:49:50,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:49:50,219 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:49:50,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-06-28 02:49:50,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f763fd06/594bce48263b4f26ad05f560e459cae5/FLAG84604180b [2024-06-28 02:49:50,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f763fd06/594bce48263b4f26ad05f560e459cae5 [2024-06-28 02:49:50,245 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:49:50,245 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:49:50,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix003.oepc.yml/witness.yml [2024-06-28 02:49:50,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:49:50,385 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:49:50,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:49:50,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:49:50,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:49:50,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:49:50" (1/2) ... [2024-06-28 02:49:50,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42bc34dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:49:50, skipping insertion in model container [2024-06-28 02:49:50,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:49:50" (1/2) ... [2024-06-28 02:49:50,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1345c440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:49:50, skipping insertion in model container [2024-06-28 02:49:50,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:49:50" (2/2) ... [2024-06-28 02:49:50,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42bc34dd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:50, skipping insertion in model container [2024-06-28 02:49:50,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:49:50" (2/2) ... [2024-06-28 02:49:50,393 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:49:50,470 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:49:50,471 INFO L97 edCorrectnessWitness]: Location invariant before [L850-L850] ((((((((((((((((((((! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0) [2024-06-28 02:49:50,471 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ((((((((((((((((((((! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0) [2024-06-28 02:49:50,471 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ((((((((((((((((((((! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0) [2024-06-28 02:49:50,471 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:49:50,472 INFO L106 edCorrectnessWitness]: ghost_update [L846-L846] multithreaded = 1; [2024-06-28 02:49:50,508 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:49:50,843 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:49:50,853 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:49:50,953 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:49:51,002 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:49:51,003 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51 WrapperNode [2024-06-28 02:49:51,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:49:51,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:49:51,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:49:51,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:49:51,009 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 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,056 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 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,083 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2024-06-28 02:49:51,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:49:51,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:49:51,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:49:51,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:49:51,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,108 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-28 02:49:51,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:49:51,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:49:51,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:49:51,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:49:51,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (1/1) ... [2024-06-28 02:49:51,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:49:51,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:49:51,158 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-28 02:49:51,176 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-28 02:49:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:49:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:49:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:49:51,201 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:49:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:49:51,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:49:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 02:49:51,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 02:49:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:49:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:49:51,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:49:51,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:49:51,204 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:49:51,342 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:49:51,344 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:49:51,679 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:49:51,681 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:49:51,812 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:49:51,812 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:49:51,813 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:49:51 BoogieIcfgContainer [2024-06-28 02:49:51,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:49:51,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:49:51,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:49:51,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:49:51,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:49:50" (1/4) ... [2024-06-28 02:49:51,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5db29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:49:51, skipping insertion in model container [2024-06-28 02:49:51,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:49:50" (2/4) ... [2024-06-28 02:49:51,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5db29 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:49:51, skipping insertion in model container [2024-06-28 02:49:51,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:49:51" (3/4) ... [2024-06-28 02:49:51,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5db29 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:49:51, skipping insertion in model container [2024-06-28 02:49:51,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:49:51" (4/4) ... [2024-06-28 02:49:51,820 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2024-06-28 02:49:51,833 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:49:51,833 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 02:49:51,833 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:49:51,891 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:49:51,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-28 02:49:51,945 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-28 02:49:51,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:49:51,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-28 02:49:51,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-28 02:49:51,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-28 02:49:51,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:49:51,967 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;@7fa2a3df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:49:51,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-28 02:49:51,971 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:49:51,972 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:49:51,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:49:51,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:49:51,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:49:51,973 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-28 02:49:51,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:49:51,976 INFO L85 PathProgramCache]: Analyzing trace with hash 380730443, now seen corresponding path program 1 times [2024-06-28 02:49:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:49:51,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394444259] [2024-06-28 02:49:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:49:51,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:49:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:49:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:49:53,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:49:53,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394444259] [2024-06-28 02:49:53,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394444259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:49:53,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:49:53,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:49:53,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86592799] [2024-06-28 02:49:53,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:49:53,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:49:53,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:49:53,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:49:53,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:49:53,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-06-28 02:49:53,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:49:53,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:49:53,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-06-28 02:49:53,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:49:53,396 INFO L124 PetriNetUnfolderBase]: 1116/1766 cut-off events. [2024-06-28 02:49:53,396 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-28 02:49:53,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 1766 events. 1116/1766 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8814 event pairs, 765 based on Foata normal form. 1/1713 useless extension candidates. Maximal degree in co-relation 3505. Up to 1676 conditions per place. [2024-06-28 02:49:53,409 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 31 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-28 02:49:53,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 171 flow [2024-06-28 02:49:53,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:49:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:49:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-28 02:49:53,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2024-06-28 02:49:53,419 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 80 transitions. [2024-06-28 02:49:53,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 171 flow [2024-06-28 02:49:53,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 02:49:53,423 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-28 02:49:53,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-28 02:49:53,427 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-28 02:49:53,427 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-28 02:49:53,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:49:53,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:49:53,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:49:53,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:49:53,428 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-28 02:49:53,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:49:53,429 INFO L85 PathProgramCache]: Analyzing trace with hash 810521078, now seen corresponding path program 1 times [2024-06-28 02:49:53,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:49:53,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836471696] [2024-06-28 02:49:53,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:49:53,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:49:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:49:54,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-28 02:49:54,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:49:54,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836471696] [2024-06-28 02:49:54,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836471696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:49:54,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:49:54,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:49:54,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346981731] [2024-06-28 02:49:54,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:49:54,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:49:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:49:54,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:49:54,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:49:54,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-06-28 02:49:54,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:49:54,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:49:54,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-06-28 02:49:54,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:49:54,338 INFO L124 PetriNetUnfolderBase]: 1110/1773 cut-off events. [2024-06-28 02:49:54,339 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2024-06-28 02:49:54,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 1773 events. 1110/1773 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8861 event pairs, 641 based on Foata normal form. 3/1758 useless extension candidates. Maximal degree in co-relation 3982. Up to 1652 conditions per place. [2024-06-28 02:49:54,348 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 38 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-28 02:49:54,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 238 flow [2024-06-28 02:49:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:49:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:49:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-06-28 02:49:54,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-06-28 02:49:54,352 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 104 transitions. [2024-06-28 02:49:54,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 238 flow [2024-06-28 02:49:54,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:49:54,355 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-28 02:49:54,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-28 02:49:54,356 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-28 02:49:54,356 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-28 02:49:54,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:49:54,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:49:54,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:49:54,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:49:54,359 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-28 02:49:54,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:49:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1521713301, now seen corresponding path program 1 times [2024-06-28 02:49:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:49:54,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970396444] [2024-06-28 02:49:54,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:49:54,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:49:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:49:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:49:55,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:49:55,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970396444] [2024-06-28 02:49:55,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970396444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:49:55,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:49:55,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:49:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572335370] [2024-06-28 02:49:55,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:49:55,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:49:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:49:55,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:49:55,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:49:55,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-28 02:49:55,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-28 02:49:55,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:49:55,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-28 02:49:55,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:49:55,866 INFO L124 PetriNetUnfolderBase]: 1345/2122 cut-off events. [2024-06-28 02:49:55,866 INFO L125 PetriNetUnfolderBase]: For 1153/1153 co-relation queries the response was YES. [2024-06-28 02:49:55,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5301 conditions, 2122 events. 1345/2122 cut-off events. For 1153/1153 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10709 event pairs, 592 based on Foata normal form. 3/2102 useless extension candidates. Maximal degree in co-relation 5287. Up to 1965 conditions per place. [2024-06-28 02:49:55,876 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 53 selfloop transitions, 13 changer transitions 0/73 dead transitions. [2024-06-28 02:49:55,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 372 flow [2024-06-28 02:49:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:49:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:49:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-28 02:49:55,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-28 02:49:55,881 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 6 states and 147 transitions. [2024-06-28 02:49:55,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 372 flow [2024-06-28 02:49:55,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 352 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 02:49:55,885 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 196 flow [2024-06-28 02:49:55,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-28 02:49:55,886 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-28 02:49:55,886 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 196 flow [2024-06-28 02:49:55,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-28 02:49:55,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:49:55,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:49:55,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:49:55,887 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-28 02:49:55,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:49:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash -927427979, now seen corresponding path program 1 times [2024-06-28 02:49:55,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:49:55,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089825561] [2024-06-28 02:49:55,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:49:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:49:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:49:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:49:57,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:49:57,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089825561] [2024-06-28 02:49:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089825561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:49:57,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:49:57,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:49:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076635709] [2024-06-28 02:49:57,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:49:57,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:49:57,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:49:57,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:49:57,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:49:57,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-28 02:49:57,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 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-28 02:49:57,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:49:57,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-28 02:49:57,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:49:57,594 INFO L124 PetriNetUnfolderBase]: 1336/2103 cut-off events. [2024-06-28 02:49:57,594 INFO L125 PetriNetUnfolderBase]: For 2265/2265 co-relation queries the response was YES. [2024-06-28 02:49:57,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 2103 events. 1336/2103 cut-off events. For 2265/2265 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10534 event pairs, 450 based on Foata normal form. 6/2084 useless extension candidates. Maximal degree in co-relation 5856. Up to 1920 conditions per place. [2024-06-28 02:49:57,606 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 57 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2024-06-28 02:49:57,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 432 flow [2024-06-28 02:49:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:49:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:49:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-28 02:49:57,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2024-06-28 02:49:57,607 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 196 flow. Second operand 7 states and 166 transitions. [2024-06-28 02:49:57,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 432 flow [2024-06-28 02:49:57,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 404 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 02:49:57,611 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 217 flow [2024-06-28 02:49:57,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-28 02:49:57,611 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2024-06-28 02:49:57,611 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 217 flow [2024-06-28 02:49:57,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 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-28 02:49:57,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:49:57,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:49:57,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:49:57,612 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-28 02:49:57,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:49:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1592598440, now seen corresponding path program 1 times [2024-06-28 02:49:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:49:57,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018820815] [2024-06-28 02:49:57,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:49:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:49:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:49:58,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-28 02:49:58,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:49:58,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018820815] [2024-06-28 02:49:58,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018820815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:49:58,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:49:58,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:49:58,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455870252] [2024-06-28 02:49:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:49:58,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:49:58,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:49:58,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:49:58,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:49:58,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:49:58,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-28 02:49:58,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:49:58,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:49:58,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:49:58,661 INFO L124 PetriNetUnfolderBase]: 1627/2518 cut-off events. [2024-06-28 02:49:58,662 INFO L125 PetriNetUnfolderBase]: For 3868/3868 co-relation queries the response was YES. [2024-06-28 02:49:58,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 2518 events. 1627/2518 cut-off events. For 3868/3868 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12327 event pairs, 689 based on Foata normal form. 2/2519 useless extension candidates. Maximal degree in co-relation 7408. Up to 2407 conditions per place. [2024-06-28 02:49:58,675 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 47 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-06-28 02:49:58,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 371 flow [2024-06-28 02:49:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:49:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:49:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-28 02:49:58,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-28 02:49:58,677 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 217 flow. Second operand 5 states and 96 transitions. [2024-06-28 02:49:58,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 371 flow [2024-06-28 02:49:58,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 332 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 02:49:58,686 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 224 flow [2024-06-28 02:49:58,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2024-06-28 02:49:58,688 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2024-06-28 02:49:58,688 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 224 flow [2024-06-28 02:49:58,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-28 02:49:58,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:49:58,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:49:58,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:49:58,689 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-28 02:49:58,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:49:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2125910344, now seen corresponding path program 1 times [2024-06-28 02:49:58,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:49:58,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820594173] [2024-06-28 02:49:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:49:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:49:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:49:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:49:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:49:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820594173] [2024-06-28 02:49:59,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820594173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:49:59,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:49:59,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:49:59,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79442683] [2024-06-28 02:49:59,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:49:59,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:49:59,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:49:59,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:49:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:49:59,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:49:59,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:49:59,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:49:59,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:49:59,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:49:59,873 INFO L124 PetriNetUnfolderBase]: 1617/2513 cut-off events. [2024-06-28 02:49:59,874 INFO L125 PetriNetUnfolderBase]: For 5557/5557 co-relation queries the response was YES. [2024-06-28 02:49:59,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7870 conditions, 2513 events. 1617/2513 cut-off events. For 5557/5557 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12353 event pairs, 653 based on Foata normal form. 4/2516 useless extension candidates. Maximal degree in co-relation 7850. Up to 2375 conditions per place. [2024-06-28 02:49:59,884 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2024-06-28 02:49:59,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 410 flow [2024-06-28 02:49:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:49:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:49:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-28 02:49:59,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 02:49:59,886 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 224 flow. Second operand 6 states and 114 transitions. [2024-06-28 02:49:59,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 410 flow [2024-06-28 02:49:59,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 388 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 02:49:59,890 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 258 flow [2024-06-28 02:49:59,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-06-28 02:49:59,892 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-06-28 02:49:59,892 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 258 flow [2024-06-28 02:49:59,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:49:59,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:49:59,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:49:59,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:49:59,893 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-28 02:49:59,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:49:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash -80306019, now seen corresponding path program 1 times [2024-06-28 02:49:59,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:49:59,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334752487] [2024-06-28 02:49:59,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:49:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:49:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:00,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-28 02:50:00,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:00,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334752487] [2024-06-28 02:50:00,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334752487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:00,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:00,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:50:00,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343196530] [2024-06-28 02:50:00,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:00,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:50:00,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:00,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:50:00,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:50:00,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:00,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:00,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:00,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:00,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:01,100 INFO L124 PetriNetUnfolderBase]: 1628/2559 cut-off events. [2024-06-28 02:50:01,100 INFO L125 PetriNetUnfolderBase]: For 7200/7206 co-relation queries the response was YES. [2024-06-28 02:50:01,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8531 conditions, 2559 events. 1628/2559 cut-off events. For 7200/7206 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12695 event pairs, 654 based on Foata normal form. 6/2563 useless extension candidates. Maximal degree in co-relation 8510. Up to 2374 conditions per place. [2024-06-28 02:50:01,111 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 57 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2024-06-28 02:50:01,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 522 flow [2024-06-28 02:50:01,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:50:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:50:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-28 02:50:01,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 02:50:01,113 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 258 flow. Second operand 6 states and 120 transitions. [2024-06-28 02:50:01,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 522 flow [2024-06-28 02:50:01,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 490 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 02:50:01,116 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 316 flow [2024-06-28 02:50:01,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2024-06-28 02:50:01,116 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2024-06-28 02:50:01,117 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 316 flow [2024-06-28 02:50:01,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:01,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:01,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:01,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:50:01,117 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-28 02:50:01,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -69056739, now seen corresponding path program 2 times [2024-06-28 02:50:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:01,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077215059] [2024-06-28 02:50:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:01,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-28 02:50:01,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:01,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077215059] [2024-06-28 02:50:01,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077215059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:01,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:01,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:50:01,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543570383] [2024-06-28 02:50:01,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:01,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:50:01,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:01,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:50:01,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:50:01,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:01,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 316 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:01,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:01,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:01,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:02,210 INFO L124 PetriNetUnfolderBase]: 1623/2551 cut-off events. [2024-06-28 02:50:02,210 INFO L125 PetriNetUnfolderBase]: For 9190/9190 co-relation queries the response was YES. [2024-06-28 02:50:02,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9033 conditions, 2551 events. 1623/2551 cut-off events. For 9190/9190 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12639 event pairs, 650 based on Foata normal form. 2/2552 useless extension candidates. Maximal degree in co-relation 9011. Up to 2393 conditions per place. [2024-06-28 02:50:02,223 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 57 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-06-28 02:50:02,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 490 flow [2024-06-28 02:50:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:50:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:50:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-28 02:50:02,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-06-28 02:50:02,225 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 316 flow. Second operand 6 states and 113 transitions. [2024-06-28 02:50:02,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 490 flow [2024-06-28 02:50:02,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 452 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-28 02:50:02,232 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 308 flow [2024-06-28 02:50:02,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2024-06-28 02:50:02,232 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2024-06-28 02:50:02,232 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 308 flow [2024-06-28 02:50:02,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:02,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:02,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:02,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:50:02,233 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-28 02:50:02,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1227128861, now seen corresponding path program 1 times [2024-06-28 02:50:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841846624] [2024-06-28 02:50:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:03,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-28 02:50:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:03,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841846624] [2024-06-28 02:50:03,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841846624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:03,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:03,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:50:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121883077] [2024-06-28 02:50:03,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:03,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:50:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:03,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:50:03,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:50:03,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:03,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 308 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:03,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:03,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:03,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:03,665 INFO L124 PetriNetUnfolderBase]: 1634/2566 cut-off events. [2024-06-28 02:50:03,665 INFO L125 PetriNetUnfolderBase]: For 10693/10693 co-relation queries the response was YES. [2024-06-28 02:50:03,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9225 conditions, 2566 events. 1634/2566 cut-off events. For 10693/10693 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12672 event pairs, 632 based on Foata normal form. 2/2567 useless extension candidates. Maximal degree in co-relation 9201. Up to 2388 conditions per place. [2024-06-28 02:50:03,699 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 67 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2024-06-28 02:50:03,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 560 flow [2024-06-28 02:50:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:50:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:50:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-28 02:50:03,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-28 02:50:03,700 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 308 flow. Second operand 7 states and 136 transitions. [2024-06-28 02:50:03,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 560 flow [2024-06-28 02:50:03,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 526 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 02:50:03,706 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 342 flow [2024-06-28 02:50:03,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-06-28 02:50:03,707 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-06-28 02:50:03,708 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 342 flow [2024-06-28 02:50:03,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:03,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:03,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:03,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:50:03,708 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-28 02:50:03,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1805481747, now seen corresponding path program 1 times [2024-06-28 02:50:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893773309] [2024-06-28 02:50:03,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:03,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:04,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-28 02:50:04,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:04,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893773309] [2024-06-28 02:50:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893773309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:04,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:04,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:50:04,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999496224] [2024-06-28 02:50:04,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:04,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:50:04,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:04,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:50:04,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:50:04,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:04,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:04,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:04,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:04,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:04,980 INFO L124 PetriNetUnfolderBase]: 1672/2619 cut-off events. [2024-06-28 02:50:04,980 INFO L125 PetriNetUnfolderBase]: For 13592/13592 co-relation queries the response was YES. [2024-06-28 02:50:04,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9995 conditions, 2619 events. 1672/2619 cut-off events. For 13592/13592 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12930 event pairs, 591 based on Foata normal form. 4/2619 useless extension candidates. Maximal degree in co-relation 9971. Up to 2384 conditions per place. [2024-06-28 02:50:04,993 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 68 selfloop transitions, 23 changer transitions 0/96 dead transitions. [2024-06-28 02:50:04,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 686 flow [2024-06-28 02:50:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:50:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:50:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-06-28 02:50:04,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2024-06-28 02:50:04,995 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 342 flow. Second operand 7 states and 141 transitions. [2024-06-28 02:50:04,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 686 flow [2024-06-28 02:50:05,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 642 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 02:50:05,005 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 434 flow [2024-06-28 02:50:05,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=434, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2024-06-28 02:50:05,006 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2024-06-28 02:50:05,007 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 434 flow [2024-06-28 02:50:05,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:05,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:05,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:05,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:50:05,007 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-28 02:50:05,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:05,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1227248831, now seen corresponding path program 2 times [2024-06-28 02:50:05,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:05,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553775010] [2024-06-28 02:50:05,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:05,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:05,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-28 02:50:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553775010] [2024-06-28 02:50:05,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553775010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:05,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:05,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:50:05,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460367050] [2024-06-28 02:50:05,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:05,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:50:05,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:05,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:50:05,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:50:05,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:05,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 434 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:05,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:05,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:05,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:06,331 INFO L124 PetriNetUnfolderBase]: 1683/2636 cut-off events. [2024-06-28 02:50:06,331 INFO L125 PetriNetUnfolderBase]: For 16684/16687 co-relation queries the response was YES. [2024-06-28 02:50:06,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10833 conditions, 2636 events. 1683/2636 cut-off events. For 16684/16687 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13001 event pairs, 602 based on Foata normal form. 4/2638 useless extension candidates. Maximal degree in co-relation 10807. Up to 2412 conditions per place. [2024-06-28 02:50:06,345 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 69 selfloop transitions, 26 changer transitions 0/100 dead transitions. [2024-06-28 02:50:06,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 792 flow [2024-06-28 02:50:06,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:50:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:50:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-28 02:50:06,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47278911564625853 [2024-06-28 02:50:06,347 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 434 flow. Second operand 7 states and 139 transitions. [2024-06-28 02:50:06,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 792 flow [2024-06-28 02:50:06,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 766 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-28 02:50:06,357 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 542 flow [2024-06-28 02:50:06,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=542, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2024-06-28 02:50:06,357 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2024-06-28 02:50:06,357 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 542 flow [2024-06-28 02:50:06,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:06,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:06,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:06,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:50:06,358 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-28 02:50:06,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:06,359 INFO L85 PathProgramCache]: Analyzing trace with hash -813616651, now seen corresponding path program 2 times [2024-06-28 02:50:06,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:06,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652572409] [2024-06-28 02:50:06,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:06,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:07,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:07,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652572409] [2024-06-28 02:50:07,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652572409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:07,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:07,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:50:07,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933106500] [2024-06-28 02:50:07,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:07,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:50:07,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:07,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:50:07,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:50:07,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:07,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 542 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:07,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:07,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:07,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:07,630 INFO L124 PetriNetUnfolderBase]: 1705/2664 cut-off events. [2024-06-28 02:50:07,630 INFO L125 PetriNetUnfolderBase]: For 21134/21134 co-relation queries the response was YES. [2024-06-28 02:50:07,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11570 conditions, 2664 events. 1705/2664 cut-off events. For 21134/21134 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13163 event pairs, 876 based on Foata normal form. 4/2657 useless extension candidates. Maximal degree in co-relation 11541. Up to 2494 conditions per place. [2024-06-28 02:50:07,644 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 79 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2024-06-28 02:50:07,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 100 transitions, 827 flow [2024-06-28 02:50:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:50:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:50:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 02:50:07,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-28 02:50:07,646 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 542 flow. Second operand 8 states and 142 transitions. [2024-06-28 02:50:07,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 100 transitions, 827 flow [2024-06-28 02:50:07,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 782 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-28 02:50:07,660 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 593 flow [2024-06-28 02:50:07,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=593, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2024-06-28 02:50:07,661 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places. [2024-06-28 02:50:07,661 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 593 flow [2024-06-28 02:50:07,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:07,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:07,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:07,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:50:07,662 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:50:07,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:07,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1174027177, now seen corresponding path program 3 times [2024-06-28 02:50:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716134125] [2024-06-28 02:50:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:07,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:08,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:08,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716134125] [2024-06-28 02:50:08,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716134125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:08,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:08,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:50:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064352281] [2024-06-28 02:50:08,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:08,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:50:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:50:08,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:50:08,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:08,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 593 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:08,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:08,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:08,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:08,879 INFO L124 PetriNetUnfolderBase]: 1700/2657 cut-off events. [2024-06-28 02:50:08,879 INFO L125 PetriNetUnfolderBase]: For 23425/23425 co-relation queries the response was YES. [2024-06-28 02:50:08,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11805 conditions, 2657 events. 1700/2657 cut-off events. For 23425/23425 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13163 event pairs, 876 based on Foata normal form. 2/2648 useless extension candidates. Maximal degree in co-relation 11773. Up to 2496 conditions per place. [2024-06-28 02:50:08,893 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 79 selfloop transitions, 15 changer transitions 0/99 dead transitions. [2024-06-28 02:50:08,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 99 transitions, 827 flow [2024-06-28 02:50:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:50:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:50:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-28 02:50:08,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-28 02:50:08,894 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 593 flow. Second operand 7 states and 130 transitions. [2024-06-28 02:50:08,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 99 transitions, 827 flow [2024-06-28 02:50:08,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 99 transitions, 758 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-28 02:50:08,911 INFO L231 Difference]: Finished difference. Result has 80 places, 81 transitions, 562 flow [2024-06-28 02:50:08,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=562, PETRI_PLACES=80, PETRI_TRANSITIONS=81} [2024-06-28 02:50:08,912 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2024-06-28 02:50:08,912 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 562 flow [2024-06-28 02:50:08,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:08,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:08,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:08,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:50:08,913 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-28 02:50:08,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2142590937, now seen corresponding path program 3 times [2024-06-28 02:50:08,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:08,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369433773] [2024-06-28 02:50:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:08,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:09,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-28 02:50:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:09,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369433773] [2024-06-28 02:50:09,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369433773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:09,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:09,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:50:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174253670] [2024-06-28 02:50:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:09,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:50:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:50:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:50:09,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:09,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 562 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:09,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:09,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:09,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:10,214 INFO L124 PetriNetUnfolderBase]: 1690/2643 cut-off events. [2024-06-28 02:50:10,214 INFO L125 PetriNetUnfolderBase]: For 25731/25731 co-relation queries the response was YES. [2024-06-28 02:50:10,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11858 conditions, 2643 events. 1690/2643 cut-off events. For 25731/25731 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13084 event pairs, 874 based on Foata normal form. 4/2636 useless extension candidates. Maximal degree in co-relation 11826. Up to 2446 conditions per place. [2024-06-28 02:50:10,230 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 76 selfloop transitions, 20 changer transitions 0/101 dead transitions. [2024-06-28 02:50:10,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 101 transitions, 808 flow [2024-06-28 02:50:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:50:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:50:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-28 02:50:10,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557823129251701 [2024-06-28 02:50:10,231 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 562 flow. Second operand 7 states and 134 transitions. [2024-06-28 02:50:10,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 101 transitions, 808 flow [2024-06-28 02:50:10,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 745 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-28 02:50:10,251 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 547 flow [2024-06-28 02:50:10,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=547, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2024-06-28 02:50:10,252 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2024-06-28 02:50:10,252 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 547 flow [2024-06-28 02:50:10,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-28 02:50:10,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:10,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:10,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 02:50:10,253 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:50:10,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash 875095549, now seen corresponding path program 1 times [2024-06-28 02:50:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:10,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168352580] [2024-06-28 02:50:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:10,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:10,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168352580] [2024-06-28 02:50:10,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168352580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:10,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:10,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:50:10,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943111670] [2024-06-28 02:50:10,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:10,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:50:10,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:10,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:50:10,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:50:10,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:10,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:10,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:10,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:10,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:11,334 INFO L124 PetriNetUnfolderBase]: 2043/3135 cut-off events. [2024-06-28 02:50:11,334 INFO L125 PetriNetUnfolderBase]: For 40844/40902 co-relation queries the response was YES. [2024-06-28 02:50:11,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14545 conditions, 3135 events. 2043/3135 cut-off events. For 40844/40902 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15778 event pairs, 1191 based on Foata normal form. 7/3113 useless extension candidates. Maximal degree in co-relation 14512. Up to 3008 conditions per place. [2024-06-28 02:50:11,353 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 65 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2024-06-28 02:50:11,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 91 transitions, 733 flow [2024-06-28 02:50:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:50:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:50:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-28 02:50:11,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-28 02:50:11,354 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 547 flow. Second operand 5 states and 92 transitions. [2024-06-28 02:50:11,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 91 transitions, 733 flow [2024-06-28 02:50:11,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 91 transitions, 670 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 02:50:11,376 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 534 flow [2024-06-28 02:50:11,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=534, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2024-06-28 02:50:11,377 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2024-06-28 02:50:11,377 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 534 flow [2024-06-28 02:50:11,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:11,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:11,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:11,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 02:50:11,378 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-28 02:50:11,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1995804881, now seen corresponding path program 1 times [2024-06-28 02:50:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:11,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780747828] [2024-06-28 02:50:11,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:11,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:12,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780747828] [2024-06-28 02:50:12,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780747828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:12,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:12,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441343845] [2024-06-28 02:50:12,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:12,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:12,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:12,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:12,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:12,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 534 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:12,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:12,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:12,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:12,883 INFO L124 PetriNetUnfolderBase]: 1856/2871 cut-off events. [2024-06-28 02:50:12,884 INFO L125 PetriNetUnfolderBase]: For 39510/39527 co-relation queries the response was YES. [2024-06-28 02:50:12,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14125 conditions, 2871 events. 1856/2871 cut-off events. For 39510/39527 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14390 event pairs, 909 based on Foata normal form. 4/2854 useless extension candidates. Maximal degree in co-relation 14091. Up to 2584 conditions per place. [2024-06-28 02:50:12,901 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 83 selfloop transitions, 28 changer transitions 0/117 dead transitions. [2024-06-28 02:50:12,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 117 transitions, 958 flow [2024-06-28 02:50:12,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:50:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:50:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-28 02:50:12,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2024-06-28 02:50:12,902 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 534 flow. Second operand 8 states and 155 transitions. [2024-06-28 02:50:12,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 117 transitions, 958 flow [2024-06-28 02:50:12,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 930 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 02:50:12,928 INFO L231 Difference]: Finished difference. Result has 85 places, 90 transitions, 648 flow [2024-06-28 02:50:12,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=648, PETRI_PLACES=85, PETRI_TRANSITIONS=90} [2024-06-28 02:50:12,929 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2024-06-28 02:50:12,929 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 648 flow [2024-06-28 02:50:12,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:12,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:12,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:12,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 02:50:12,930 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-28 02:50:12,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2043283930, now seen corresponding path program 1 times [2024-06-28 02:50:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:12,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690458538] [2024-06-28 02:50:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:12,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:13,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-28 02:50:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:13,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690458538] [2024-06-28 02:50:13,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690458538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:13,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:13,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955713126] [2024-06-28 02:50:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:13,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:13,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:13,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:13,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:13,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 648 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:13,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:13,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:13,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:14,623 INFO L124 PetriNetUnfolderBase]: 1890/2927 cut-off events. [2024-06-28 02:50:14,624 INFO L125 PetriNetUnfolderBase]: For 42499/42507 co-relation queries the response was YES. [2024-06-28 02:50:14,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14946 conditions, 2927 events. 1890/2927 cut-off events. For 42499/42507 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14574 event pairs, 640 based on Foata normal form. 10/2936 useless extension candidates. Maximal degree in co-relation 14911. Up to 2678 conditions per place. [2024-06-28 02:50:14,638 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 110 selfloop transitions, 33 changer transitions 0/149 dead transitions. [2024-06-28 02:50:14,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 149 transitions, 1237 flow [2024-06-28 02:50:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:50:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:50:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-28 02:50:14,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 02:50:14,640 INFO L175 Difference]: Start difference. First operand has 85 places, 90 transitions, 648 flow. Second operand 11 states and 209 transitions. [2024-06-28 02:50:14,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 149 transitions, 1237 flow [2024-06-28 02:50:14,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 149 transitions, 1178 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-28 02:50:14,668 INFO L231 Difference]: Finished difference. Result has 95 places, 108 transitions, 831 flow [2024-06-28 02:50:14,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=831, PETRI_PLACES=95, PETRI_TRANSITIONS=108} [2024-06-28 02:50:14,668 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places. [2024-06-28 02:50:14,669 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 108 transitions, 831 flow [2024-06-28 02:50:14,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:14,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:14,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:14,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 02:50:14,669 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-28 02:50:14,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash -61097684, now seen corresponding path program 2 times [2024-06-28 02:50:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:14,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336408427] [2024-06-28 02:50:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336408427] [2024-06-28 02:50:15,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336408427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:15,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:15,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:15,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120991536] [2024-06-28 02:50:15,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:15,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:15,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:15,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:15,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 108 transitions, 831 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:15,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:15,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:15,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:16,527 INFO L124 PetriNetUnfolderBase]: 2018/3107 cut-off events. [2024-06-28 02:50:16,528 INFO L125 PetriNetUnfolderBase]: For 52468/52503 co-relation queries the response was YES. [2024-06-28 02:50:16,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16830 conditions, 3107 events. 2018/3107 cut-off events. For 52468/52503 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15635 event pairs, 806 based on Foata normal form. 11/3093 useless extension candidates. Maximal degree in co-relation 16790. Up to 2841 conditions per place. [2024-06-28 02:50:16,543 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 120 selfloop transitions, 48 changer transitions 0/174 dead transitions. [2024-06-28 02:50:16,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 174 transitions, 1600 flow [2024-06-28 02:50:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:50:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:50:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 02:50:16,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-28 02:50:16,545 INFO L175 Difference]: Start difference. First operand has 95 places, 108 transitions, 831 flow. Second operand 10 states and 189 transitions. [2024-06-28 02:50:16,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 174 transitions, 1600 flow [2024-06-28 02:50:16,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 174 transitions, 1465 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-28 02:50:16,584 INFO L231 Difference]: Finished difference. Result has 104 places, 141 transitions, 1220 flow [2024-06-28 02:50:16,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1220, PETRI_PLACES=104, PETRI_TRANSITIONS=141} [2024-06-28 02:50:16,584 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2024-06-28 02:50:16,584 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 141 transitions, 1220 flow [2024-06-28 02:50:16,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:16,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:16,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:16,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 02:50:16,585 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-28 02:50:16,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:16,586 INFO L85 PathProgramCache]: Analyzing trace with hash -536907536, now seen corresponding path program 3 times [2024-06-28 02:50:16,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:16,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047267988] [2024-06-28 02:50:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:16,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:17,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047267988] [2024-06-28 02:50:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047267988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:17,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:17,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:50:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108192962] [2024-06-28 02:50:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:17,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:50:17,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:50:17,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:50:17,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:17,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 141 transitions, 1220 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:17,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:17,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:17,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:18,068 INFO L124 PetriNetUnfolderBase]: 2125/3252 cut-off events. [2024-06-28 02:50:18,068 INFO L125 PetriNetUnfolderBase]: For 62638/62672 co-relation queries the response was YES. [2024-06-28 02:50:18,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18781 conditions, 3252 events. 2125/3252 cut-off events. For 62638/62672 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16370 event pairs, 823 based on Foata normal form. 6/3225 useless extension candidates. Maximal degree in co-relation 18735. Up to 2876 conditions per place. [2024-06-28 02:50:18,088 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 112 selfloop transitions, 93 changer transitions 0/211 dead transitions. [2024-06-28 02:50:18,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 211 transitions, 2325 flow [2024-06-28 02:50:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:50:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:50:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-28 02:50:18,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-28 02:50:18,091 INFO L175 Difference]: Start difference. First operand has 104 places, 141 transitions, 1220 flow. Second operand 10 states and 194 transitions. [2024-06-28 02:50:18,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 211 transitions, 2325 flow [2024-06-28 02:50:18,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 211 transitions, 2133 flow, removed 70 selfloop flow, removed 3 redundant places. [2024-06-28 02:50:18,150 INFO L231 Difference]: Finished difference. Result has 113 places, 175 transitions, 1746 flow [2024-06-28 02:50:18,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1746, PETRI_PLACES=113, PETRI_TRANSITIONS=175} [2024-06-28 02:50:18,151 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-06-28 02:50:18,151 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 175 transitions, 1746 flow [2024-06-28 02:50:18,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:18,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:18,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:18,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 02:50:18,152 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-28 02:50:18,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1317320349, now seen corresponding path program 2 times [2024-06-28 02:50:18,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:18,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421726360] [2024-06-28 02:50:18,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:18,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:18,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421726360] [2024-06-28 02:50:18,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421726360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:18,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:18,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:18,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376774860] [2024-06-28 02:50:18,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:18,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:18,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:18,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:18,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:18,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:18,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 175 transitions, 1746 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:18,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:18,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:18,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:19,788 INFO L124 PetriNetUnfolderBase]: 2172/3343 cut-off events. [2024-06-28 02:50:19,788 INFO L125 PetriNetUnfolderBase]: For 71427/71460 co-relation queries the response was YES. [2024-06-28 02:50:19,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20164 conditions, 3343 events. 2172/3343 cut-off events. For 71427/71460 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16958 event pairs, 801 based on Foata normal form. 6/3321 useless extension candidates. Maximal degree in co-relation 20115. Up to 3028 conditions per place. [2024-06-28 02:50:19,809 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 169 selfloop transitions, 52 changer transitions 0/227 dead transitions. [2024-06-28 02:50:19,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 227 transitions, 2630 flow [2024-06-28 02:50:19,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:50:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:50:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-28 02:50:19,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-28 02:50:19,810 INFO L175 Difference]: Start difference. First operand has 113 places, 175 transitions, 1746 flow. Second operand 11 states and 210 transitions. [2024-06-28 02:50:19,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 227 transitions, 2630 flow [2024-06-28 02:50:19,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 227 transitions, 2509 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-28 02:50:19,872 INFO L231 Difference]: Finished difference. Result has 121 places, 187 transitions, 1937 flow [2024-06-28 02:50:19,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1937, PETRI_PLACES=121, PETRI_TRANSITIONS=187} [2024-06-28 02:50:19,872 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places. [2024-06-28 02:50:19,872 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 187 transitions, 1937 flow [2024-06-28 02:50:19,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:19,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:19,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:19,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 02:50:19,873 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-28 02:50:19,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash -61007319, now seen corresponding path program 3 times [2024-06-28 02:50:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:19,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286493197] [2024-06-28 02:50:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:19,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:20,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:20,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286493197] [2024-06-28 02:50:20,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286493197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:20,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:20,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:20,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587602388] [2024-06-28 02:50:20,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:20,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:20,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:20,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:20,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:20,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 187 transitions, 1937 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:20,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:20,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:20,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:21,414 INFO L124 PetriNetUnfolderBase]: 2218/3413 cut-off events. [2024-06-28 02:50:21,414 INFO L125 PetriNetUnfolderBase]: For 71093/71125 co-relation queries the response was YES. [2024-06-28 02:50:21,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20919 conditions, 3413 events. 2218/3413 cut-off events. For 71093/71125 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17316 event pairs, 791 based on Foata normal form. 12/3403 useless extension candidates. Maximal degree in co-relation 20868. Up to 3126 conditions per place. [2024-06-28 02:50:21,438 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 176 selfloop transitions, 47 changer transitions 0/229 dead transitions. [2024-06-28 02:50:21,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 229 transitions, 2735 flow [2024-06-28 02:50:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:50:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:50:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-28 02:50:21,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2024-06-28 02:50:21,439 INFO L175 Difference]: Start difference. First operand has 121 places, 187 transitions, 1937 flow. Second operand 9 states and 172 transitions. [2024-06-28 02:50:21,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 229 transitions, 2735 flow [2024-06-28 02:50:21,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 229 transitions, 2552 flow, removed 74 selfloop flow, removed 5 redundant places. [2024-06-28 02:50:21,488 INFO L231 Difference]: Finished difference. Result has 125 places, 198 transitions, 2107 flow [2024-06-28 02:50:21,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2107, PETRI_PLACES=125, PETRI_TRANSITIONS=198} [2024-06-28 02:50:21,489 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-06-28 02:50:21,489 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 198 transitions, 2107 flow [2024-06-28 02:50:21,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:21,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:21,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:21,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 02:50:21,490 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-28 02:50:21,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 275184891, now seen corresponding path program 4 times [2024-06-28 02:50:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762189455] [2024-06-28 02:50:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:22,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:22,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762189455] [2024-06-28 02:50:22,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762189455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:22,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:22,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:22,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862344699] [2024-06-28 02:50:22,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:22,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:22,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:22,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:22,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:22,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:22,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 198 transitions, 2107 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:22,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:22,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:22,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:23,202 INFO L124 PetriNetUnfolderBase]: 2451/3762 cut-off events. [2024-06-28 02:50:23,202 INFO L125 PetriNetUnfolderBase]: For 82325/82361 co-relation queries the response was YES. [2024-06-28 02:50:23,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23459 conditions, 3762 events. 2451/3762 cut-off events. For 82325/82361 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 19446 event pairs, 769 based on Foata normal form. 12/3745 useless extension candidates. Maximal degree in co-relation 23406. Up to 3100 conditions per place. [2024-06-28 02:50:23,229 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 172 selfloop transitions, 118 changer transitions 0/296 dead transitions. [2024-06-28 02:50:23,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 296 transitions, 3610 flow [2024-06-28 02:50:23,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:50:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:50:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-28 02:50:23,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-06-28 02:50:23,230 INFO L175 Difference]: Start difference. First operand has 125 places, 198 transitions, 2107 flow. Second operand 9 states and 186 transitions. [2024-06-28 02:50:23,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 296 transitions, 3610 flow [2024-06-28 02:50:23,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 296 transitions, 3436 flow, removed 47 selfloop flow, removed 7 redundant places. [2024-06-28 02:50:23,288 INFO L231 Difference]: Finished difference. Result has 131 places, 247 transitions, 2836 flow [2024-06-28 02:50:23,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2836, PETRI_PLACES=131, PETRI_TRANSITIONS=247} [2024-06-28 02:50:23,289 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places. [2024-06-28 02:50:23,289 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 247 transitions, 2836 flow [2024-06-28 02:50:23,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:23,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:23,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:23,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 02:50:23,289 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:50:23,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash 275179156, now seen corresponding path program 4 times [2024-06-28 02:50:23,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:23,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626167824] [2024-06-28 02:50:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:24,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626167824] [2024-06-28 02:50:24,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626167824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:24,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:24,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417667477] [2024-06-28 02:50:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:24,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:24,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:24,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 247 transitions, 2836 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:24,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:24,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:24,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:25,959 INFO L124 PetriNetUnfolderBase]: 2458/3784 cut-off events. [2024-06-28 02:50:25,960 INFO L125 PetriNetUnfolderBase]: For 89855/89892 co-relation queries the response was YES. [2024-06-28 02:50:25,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25111 conditions, 3784 events. 2458/3784 cut-off events. For 89855/89892 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19608 event pairs, 809 based on Foata normal form. 12/3773 useless extension candidates. Maximal degree in co-relation 25053. Up to 3397 conditions per place. [2024-06-28 02:50:25,984 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 206 selfloop transitions, 79 changer transitions 0/291 dead transitions. [2024-06-28 02:50:25,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 291 transitions, 3701 flow [2024-06-28 02:50:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:50:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:50:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 02:50:25,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-28 02:50:25,985 INFO L175 Difference]: Start difference. First operand has 131 places, 247 transitions, 2836 flow. Second operand 10 states and 189 transitions. [2024-06-28 02:50:25,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 291 transitions, 3701 flow [2024-06-28 02:50:26,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 291 transitions, 3614 flow, removed 38 selfloop flow, removed 2 redundant places. [2024-06-28 02:50:26,059 INFO L231 Difference]: Finished difference. Result has 142 places, 260 transitions, 3129 flow [2024-06-28 02:50:26,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2751, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3129, PETRI_PLACES=142, PETRI_TRANSITIONS=260} [2024-06-28 02:50:26,059 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places. [2024-06-28 02:50:26,059 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 260 transitions, 3129 flow [2024-06-28 02:50:26,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:26,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:26,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:26,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 02:50:26,060 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-28 02:50:26,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:26,060 INFO L85 PathProgramCache]: Analyzing trace with hash 275179311, now seen corresponding path program 5 times [2024-06-28 02:50:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:26,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687820730] [2024-06-28 02:50:26,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:26,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:26,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-28 02:50:26,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:26,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687820730] [2024-06-28 02:50:26,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687820730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:26,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:26,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:26,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194030104] [2024-06-28 02:50:26,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:26,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:26,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:26,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:26,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:26,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:26,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 260 transitions, 3129 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:26,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:26,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:26,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:27,718 INFO L124 PetriNetUnfolderBase]: 2459/3782 cut-off events. [2024-06-28 02:50:27,719 INFO L125 PetriNetUnfolderBase]: For 97326/97368 co-relation queries the response was YES. [2024-06-28 02:50:27,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25585 conditions, 3782 events. 2459/3782 cut-off events. For 97326/97368 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 19571 event pairs, 771 based on Foata normal form. 12/3765 useless extension candidates. Maximal degree in co-relation 25522. Up to 3113 conditions per place. [2024-06-28 02:50:27,750 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 179 selfloop transitions, 118 changer transitions 0/303 dead transitions. [2024-06-28 02:50:27,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 303 transitions, 4092 flow [2024-06-28 02:50:27,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:50:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:50:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-28 02:50:27,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-06-28 02:50:27,751 INFO L175 Difference]: Start difference. First operand has 142 places, 260 transitions, 3129 flow. Second operand 9 states and 186 transitions. [2024-06-28 02:50:27,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 303 transitions, 4092 flow [2024-06-28 02:50:27,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 303 transitions, 3872 flow, removed 51 selfloop flow, removed 5 redundant places. [2024-06-28 02:50:27,848 INFO L231 Difference]: Finished difference. Result has 146 places, 260 transitions, 3154 flow [2024-06-28 02:50:27,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2909, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3154, PETRI_PLACES=146, PETRI_TRANSITIONS=260} [2024-06-28 02:50:27,849 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places. [2024-06-28 02:50:27,849 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 260 transitions, 3154 flow [2024-06-28 02:50:27,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:27,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:27,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:27,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 02:50:27,849 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-28 02:50:27,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash -613800298, now seen corresponding path program 5 times [2024-06-28 02:50:27,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:27,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708420808] [2024-06-28 02:50:27,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:28,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:28,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708420808] [2024-06-28 02:50:28,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708420808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:28,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:28,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:28,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020198619] [2024-06-28 02:50:28,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:28,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:28,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:28,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:28,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:28,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:28,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 260 transitions, 3154 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:28,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:28,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:28,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:29,669 INFO L124 PetriNetUnfolderBase]: 2499/3830 cut-off events. [2024-06-28 02:50:29,669 INFO L125 PetriNetUnfolderBase]: For 106887/106931 co-relation queries the response was YES. [2024-06-28 02:50:29,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26362 conditions, 3830 events. 2499/3830 cut-off events. For 106887/106931 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19845 event pairs, 848 based on Foata normal form. 9/3806 useless extension candidates. Maximal degree in co-relation 26299. Up to 3401 conditions per place. [2024-06-28 02:50:29,696 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 193 selfloop transitions, 108 changer transitions 0/307 dead transitions. [2024-06-28 02:50:29,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 307 transitions, 4175 flow [2024-06-28 02:50:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:50:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:50:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-28 02:50:29,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2024-06-28 02:50:29,697 INFO L175 Difference]: Start difference. First operand has 146 places, 260 transitions, 3154 flow. Second operand 9 states and 176 transitions. [2024-06-28 02:50:29,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 307 transitions, 4175 flow [2024-06-28 02:50:29,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 307 transitions, 3959 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-28 02:50:29,784 INFO L231 Difference]: Finished difference. Result has 149 places, 272 transitions, 3338 flow [2024-06-28 02:50:29,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2938, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3338, PETRI_PLACES=149, PETRI_TRANSITIONS=272} [2024-06-28 02:50:29,785 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 106 predicate places. [2024-06-28 02:50:29,785 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 272 transitions, 3338 flow [2024-06-28 02:50:29,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:29,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:29,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:29,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 02:50:29,785 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-28 02:50:29,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash -613709933, now seen corresponding path program 6 times [2024-06-28 02:50:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:29,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411678969] [2024-06-28 02:50:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:29,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411678969] [2024-06-28 02:50:30,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411678969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:30,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:30,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:30,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989435313] [2024-06-28 02:50:30,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:30,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:30,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:30,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:30,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:30,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:30,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 272 transitions, 3338 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:30,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:30,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:30,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:31,608 INFO L124 PetriNetUnfolderBase]: 2488/3834 cut-off events. [2024-06-28 02:50:31,608 INFO L125 PetriNetUnfolderBase]: For 109670/109697 co-relation queries the response was YES. [2024-06-28 02:50:31,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26412 conditions, 3834 events. 2488/3834 cut-off events. For 109670/109697 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 19975 event pairs, 848 based on Foata normal form. 8/3814 useless extension candidates. Maximal degree in co-relation 26348. Up to 3452 conditions per place. [2024-06-28 02:50:31,641 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 232 selfloop transitions, 64 changer transitions 0/302 dead transitions. [2024-06-28 02:50:31,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 302 transitions, 4136 flow [2024-06-28 02:50:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:50:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:50:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-28 02:50:31,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-28 02:50:31,642 INFO L175 Difference]: Start difference. First operand has 149 places, 272 transitions, 3338 flow. Second operand 8 states and 154 transitions. [2024-06-28 02:50:31,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 302 transitions, 4136 flow [2024-06-28 02:50:31,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 302 transitions, 3904 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-28 02:50:31,759 INFO L231 Difference]: Finished difference. Result has 151 places, 275 transitions, 3332 flow [2024-06-28 02:50:31,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3106, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3332, PETRI_PLACES=151, PETRI_TRANSITIONS=275} [2024-06-28 02:50:31,759 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places. [2024-06-28 02:50:31,760 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 275 transitions, 3332 flow [2024-06-28 02:50:31,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:31,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:31,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:31,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 02:50:31,760 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-28 02:50:31,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash -613710088, now seen corresponding path program 6 times [2024-06-28 02:50:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:31,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113342486] [2024-06-28 02:50:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:32,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113342486] [2024-06-28 02:50:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113342486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:32,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:32,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:32,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834380403] [2024-06-28 02:50:32,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:32,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:32,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:32,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:32,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:32,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 275 transitions, 3332 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:32,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:32,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:32,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:33,625 INFO L124 PetriNetUnfolderBase]: 2477/3810 cut-off events. [2024-06-28 02:50:33,625 INFO L125 PetriNetUnfolderBase]: For 115161/115187 co-relation queries the response was YES. [2024-06-28 02:50:33,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26684 conditions, 3810 events. 2477/3810 cut-off events. For 115161/115187 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 19748 event pairs, 870 based on Foata normal form. 6/3788 useless extension candidates. Maximal degree in co-relation 26619. Up to 3475 conditions per place. [2024-06-28 02:50:33,710 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 230 selfloop transitions, 66 changer transitions 0/302 dead transitions. [2024-06-28 02:50:33,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 302 transitions, 4069 flow [2024-06-28 02:50:33,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:50:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:50:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-28 02:50:33,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-28 02:50:33,711 INFO L175 Difference]: Start difference. First operand has 151 places, 275 transitions, 3332 flow. Second operand 8 states and 153 transitions. [2024-06-28 02:50:33,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 302 transitions, 4069 flow [2024-06-28 02:50:33,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 302 transitions, 3831 flow, removed 65 selfloop flow, removed 7 redundant places. [2024-06-28 02:50:33,801 INFO L231 Difference]: Finished difference. Result has 152 places, 275 transitions, 3260 flow [2024-06-28 02:50:33,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3094, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3260, PETRI_PLACES=152, PETRI_TRANSITIONS=275} [2024-06-28 02:50:33,802 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2024-06-28 02:50:33,802 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 275 transitions, 3260 flow [2024-06-28 02:50:33,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:33,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:33,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:33,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 02:50:33,802 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-28 02:50:33,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash 135360163, now seen corresponding path program 7 times [2024-06-28 02:50:33,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:33,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100392886] [2024-06-28 02:50:33,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:33,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:34,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100392886] [2024-06-28 02:50:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100392886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:34,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962823052] [2024-06-28 02:50:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:34,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:34,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:34,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:34,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:34,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:34,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 275 transitions, 3260 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:34,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:34,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:34,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:35,558 INFO L124 PetriNetUnfolderBase]: 2536/3901 cut-off events. [2024-06-28 02:50:35,559 INFO L125 PetriNetUnfolderBase]: For 117605/117635 co-relation queries the response was YES. [2024-06-28 02:50:35,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27281 conditions, 3901 events. 2536/3901 cut-off events. For 117605/117635 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 20368 event pairs, 789 based on Foata normal form. 14/3886 useless extension candidates. Maximal degree in co-relation 27216. Up to 3125 conditions per place. [2024-06-28 02:50:35,588 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 169 selfloop transitions, 147 changer transitions 0/322 dead transitions. [2024-06-28 02:50:35,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 322 transitions, 4572 flow [2024-06-28 02:50:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:50:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:50:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-28 02:50:35,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-28 02:50:35,589 INFO L175 Difference]: Start difference. First operand has 152 places, 275 transitions, 3260 flow. Second operand 8 states and 164 transitions. [2024-06-28 02:50:35,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 322 transitions, 4572 flow [2024-06-28 02:50:35,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 322 transitions, 4418 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 02:50:35,672 INFO L231 Difference]: Finished difference. Result has 153 places, 286 transitions, 3674 flow [2024-06-28 02:50:35,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3106, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3674, PETRI_PLACES=153, PETRI_TRANSITIONS=286} [2024-06-28 02:50:35,673 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places. [2024-06-28 02:50:35,673 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 286 transitions, 3674 flow [2024-06-28 02:50:35,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:35,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:35,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:35,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 02:50:35,674 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:50:35,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:35,674 INFO L85 PathProgramCache]: Analyzing trace with hash 135354428, now seen corresponding path program 7 times [2024-06-28 02:50:35,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:35,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264456270] [2024-06-28 02:50:35,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:35,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:36,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264456270] [2024-06-28 02:50:36,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264456270] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:36,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:36,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856007374] [2024-06-28 02:50:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:36,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:36,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:36,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:36,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 286 transitions, 3674 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:36,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:36,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:36,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:37,556 INFO L124 PetriNetUnfolderBase]: 2536/3906 cut-off events. [2024-06-28 02:50:37,556 INFO L125 PetriNetUnfolderBase]: For 125648/125679 co-relation queries the response was YES. [2024-06-28 02:50:37,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28267 conditions, 3906 events. 2536/3906 cut-off events. For 125648/125679 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20330 event pairs, 828 based on Foata normal form. 12/3895 useless extension candidates. Maximal degree in co-relation 28201. Up to 3500 conditions per place. [2024-06-28 02:50:37,590 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 230 selfloop transitions, 78 changer transitions 0/314 dead transitions. [2024-06-28 02:50:37,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 314 transitions, 4508 flow [2024-06-28 02:50:37,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:50:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:50:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-28 02:50:37,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-28 02:50:37,592 INFO L175 Difference]: Start difference. First operand has 153 places, 286 transitions, 3674 flow. Second operand 8 states and 154 transitions. [2024-06-28 02:50:37,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 314 transitions, 4508 flow [2024-06-28 02:50:37,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 314 transitions, 4152 flow, removed 104 selfloop flow, removed 6 redundant places. [2024-06-28 02:50:37,711 INFO L231 Difference]: Finished difference. Result has 155 places, 289 transitions, 3558 flow [2024-06-28 02:50:37,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3322, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3558, PETRI_PLACES=155, PETRI_TRANSITIONS=289} [2024-06-28 02:50:37,712 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 112 predicate places. [2024-06-28 02:50:37,713 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 289 transitions, 3558 flow [2024-06-28 02:50:37,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:37,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:37,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:37,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 02:50:37,713 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:50:37,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:37,714 INFO L85 PathProgramCache]: Analyzing trace with hash -609990863, now seen corresponding path program 8 times [2024-06-28 02:50:37,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:37,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354047668] [2024-06-28 02:50:37,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:37,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:38,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354047668] [2024-06-28 02:50:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354047668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:38,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:38,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:38,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973341891] [2024-06-28 02:50:38,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:38,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:38,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:38,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 289 transitions, 3558 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:38,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:38,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:38,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:39,226 INFO L124 PetriNetUnfolderBase]: 2531/3891 cut-off events. [2024-06-28 02:50:39,226 INFO L125 PetriNetUnfolderBase]: For 121339/121371 co-relation queries the response was YES. [2024-06-28 02:50:39,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27496 conditions, 3891 events. 2531/3891 cut-off events. For 121339/121371 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 20314 event pairs, 783 based on Foata normal form. 14/3876 useless extension candidates. Maximal degree in co-relation 27430. Up to 3128 conditions per place. [2024-06-28 02:50:39,259 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 181 selfloop transitions, 140 changer transitions 0/327 dead transitions. [2024-06-28 02:50:39,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 327 transitions, 4583 flow [2024-06-28 02:50:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:50:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:50:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-28 02:50:39,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-28 02:50:39,268 INFO L175 Difference]: Start difference. First operand has 155 places, 289 transitions, 3558 flow. Second operand 8 states and 164 transitions. [2024-06-28 02:50:39,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 327 transitions, 4583 flow [2024-06-28 02:50:39,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 327 transitions, 4323 flow, removed 57 selfloop flow, removed 6 redundant places. [2024-06-28 02:50:39,421 INFO L231 Difference]: Finished difference. Result has 157 places, 289 transitions, 3597 flow [2024-06-28 02:50:39,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3298, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3597, PETRI_PLACES=157, PETRI_TRANSITIONS=289} [2024-06-28 02:50:39,421 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places. [2024-06-28 02:50:39,422 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 289 transitions, 3597 flow [2024-06-28 02:50:39,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:39,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:39,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:39,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 02:50:39,422 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:50:39,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1938983645, now seen corresponding path program 9 times [2024-06-28 02:50:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:39,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285467628] [2024-06-28 02:50:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:40,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:40,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285467628] [2024-06-28 02:50:40,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285467628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:40,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:40,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:40,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120338437] [2024-06-28 02:50:40,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:40,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:40,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:40,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:40,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 289 transitions, 3597 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:40,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:40,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:40,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:41,021 INFO L124 PetriNetUnfolderBase]: 2572/3959 cut-off events. [2024-06-28 02:50:41,021 INFO L125 PetriNetUnfolderBase]: For 132056/132084 co-relation queries the response was YES. [2024-06-28 02:50:41,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28503 conditions, 3959 events. 2572/3959 cut-off events. For 132056/132084 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 20807 event pairs, 999 based on Foata normal form. 6/3935 useless extension candidates. Maximal degree in co-relation 28436. Up to 3542 conditions per place. [2024-06-28 02:50:41,055 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 269 selfloop transitions, 56 changer transitions 0/331 dead transitions. [2024-06-28 02:50:41,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 331 transitions, 4740 flow [2024-06-28 02:50:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:50:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:50:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-28 02:50:41,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-28 02:50:41,056 INFO L175 Difference]: Start difference. First operand has 157 places, 289 transitions, 3597 flow. Second operand 8 states and 156 transitions. [2024-06-28 02:50:41,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 331 transitions, 4740 flow [2024-06-28 02:50:41,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 331 transitions, 4335 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-28 02:50:41,157 INFO L231 Difference]: Finished difference. Result has 157 places, 297 transitions, 3464 flow [2024-06-28 02:50:41,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3216, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3464, PETRI_PLACES=157, PETRI_TRANSITIONS=297} [2024-06-28 02:50:41,158 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places. [2024-06-28 02:50:41,158 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 297 transitions, 3464 flow [2024-06-28 02:50:41,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:41,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:41,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:41,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 02:50:41,158 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:50:41,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2027745849, now seen corresponding path program 10 times [2024-06-28 02:50:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:41,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637449191] [2024-06-28 02:50:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:41,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:41,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637449191] [2024-06-28 02:50:41,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637449191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:41,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:41,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:41,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926750692] [2024-06-28 02:50:41,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:41,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:41,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:41,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:41,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:42,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:42,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 297 transitions, 3464 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:42,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:42,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:42,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:42,778 INFO L124 PetriNetUnfolderBase]: 2556/3937 cut-off events. [2024-06-28 02:50:42,778 INFO L125 PetriNetUnfolderBase]: For 118356/118378 co-relation queries the response was YES. [2024-06-28 02:50:42,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27122 conditions, 3937 events. 2556/3937 cut-off events. For 118356/118378 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20669 event pairs, 1000 based on Foata normal form. 6/3913 useless extension candidates. Maximal degree in co-relation 27055. Up to 3646 conditions per place. [2024-06-28 02:50:42,810 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 292 selfloop transitions, 27 changer transitions 0/325 dead transitions. [2024-06-28 02:50:42,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 325 transitions, 4294 flow [2024-06-28 02:50:42,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:50:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:50:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 02:50:42,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2024-06-28 02:50:42,811 INFO L175 Difference]: Start difference. First operand has 157 places, 297 transitions, 3464 flow. Second operand 9 states and 160 transitions. [2024-06-28 02:50:42,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 325 transitions, 4294 flow [2024-06-28 02:50:42,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 325 transitions, 4068 flow, removed 74 selfloop flow, removed 5 redundant places. [2024-06-28 02:50:42,911 INFO L231 Difference]: Finished difference. Result has 161 places, 297 transitions, 3305 flow [2024-06-28 02:50:42,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3238, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3305, PETRI_PLACES=161, PETRI_TRANSITIONS=297} [2024-06-28 02:50:42,912 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places. [2024-06-28 02:50:42,912 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 297 transitions, 3305 flow [2024-06-28 02:50:42,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:42,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:42,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:42,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 02:50:42,913 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-28 02:50:42,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2035103234, now seen corresponding path program 8 times [2024-06-28 02:50:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:42,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298657337] [2024-06-28 02:50:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:43,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:43,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298657337] [2024-06-28 02:50:43,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298657337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:43,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:43,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:43,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867387853] [2024-06-28 02:50:43,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:43,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:43,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:43,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:43,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:43,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:43,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 297 transitions, 3305 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:43,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:43,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:43,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:44,544 INFO L124 PetriNetUnfolderBase]: 2551/3930 cut-off events. [2024-06-28 02:50:44,544 INFO L125 PetriNetUnfolderBase]: For 114346/114368 co-relation queries the response was YES. [2024-06-28 02:50:44,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26421 conditions, 3930 events. 2551/3930 cut-off events. For 114346/114368 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20645 event pairs, 1008 based on Foata normal form. 2/3902 useless extension candidates. Maximal degree in co-relation 26353. Up to 3672 conditions per place. [2024-06-28 02:50:44,583 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 293 selfloop transitions, 23 changer transitions 0/322 dead transitions. [2024-06-28 02:50:44,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 322 transitions, 4127 flow [2024-06-28 02:50:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:50:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:50:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 02:50:44,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-28 02:50:44,585 INFO L175 Difference]: Start difference. First operand has 161 places, 297 transitions, 3305 flow. Second operand 8 states and 147 transitions. [2024-06-28 02:50:44,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 322 transitions, 4127 flow [2024-06-28 02:50:44,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 322 transitions, 4014 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-28 02:50:44,690 INFO L231 Difference]: Finished difference. Result has 160 places, 300 transitions, 3311 flow [2024-06-28 02:50:44,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3192, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3311, PETRI_PLACES=160, PETRI_TRANSITIONS=300} [2024-06-28 02:50:44,691 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-28 02:50:44,691 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 300 transitions, 3311 flow [2024-06-28 02:50:44,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:44,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:44,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:44,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 02:50:44,691 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:50:44,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash 593753238, now seen corresponding path program 1 times [2024-06-28 02:50:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:44,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219465914] [2024-06-28 02:50:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:45,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-28 02:50:45,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:45,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219465914] [2024-06-28 02:50:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219465914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:45,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:45,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:50:45,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946046233] [2024-06-28 02:50:45,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:45,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:50:45,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:45,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:50:45,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:50:46,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-28 02:50:46,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 300 transitions, 3311 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:46,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:46,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-28 02:50:46,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:47,023 INFO L124 PetriNetUnfolderBase]: 3060/4598 cut-off events. [2024-06-28 02:50:47,024 INFO L125 PetriNetUnfolderBase]: For 141263/141291 co-relation queries the response was YES. [2024-06-28 02:50:47,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30728 conditions, 4598 events. 3060/4598 cut-off events. For 141263/141291 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 23191 event pairs, 1247 based on Foata normal form. 4/4568 useless extension candidates. Maximal degree in co-relation 30659. Up to 4396 conditions per place. [2024-06-28 02:50:47,062 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 304 selfloop transitions, 19 changer transitions 0/328 dead transitions. [2024-06-28 02:50:47,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 328 transitions, 4150 flow [2024-06-28 02:50:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:50:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:50:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-28 02:50:47,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2024-06-28 02:50:47,063 INFO L175 Difference]: Start difference. First operand has 160 places, 300 transitions, 3311 flow. Second operand 8 states and 141 transitions. [2024-06-28 02:50:47,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 328 transitions, 4150 flow [2024-06-28 02:50:47,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 328 transitions, 4057 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-28 02:50:47,167 INFO L231 Difference]: Finished difference. Result has 163 places, 305 transitions, 3338 flow [2024-06-28 02:50:47,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3218, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3338, PETRI_PLACES=163, PETRI_TRANSITIONS=305} [2024-06-28 02:50:47,168 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 120 predicate places. [2024-06-28 02:50:47,168 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 305 transitions, 3338 flow [2024-06-28 02:50:47,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:47,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:47,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:47,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 02:50:47,168 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-28 02:50:47,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1358159770, now seen corresponding path program 1 times [2024-06-28 02:50:47,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:47,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363155368] [2024-06-28 02:50:47,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:47,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:47,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:47,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363155368] [2024-06-28 02:50:47,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363155368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:47,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:47,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:50:47,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765653156] [2024-06-28 02:50:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:47,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:50:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:47,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:50:47,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:50:47,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:47,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 305 transitions, 3338 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-28 02:50:47,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:47,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:47,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:48,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([381] L782-->L785: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0][65], [323#true, Black: 253#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 134#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 263#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 515#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 152#true, Black: 392#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 521#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 ~z$w_buff0_used~0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 149#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 278#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 282#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 274#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 16#L851true, Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork2InUse, Black: 170#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork0InUse, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 434#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff0_thd3~0) (<= 0 ~z$r_buff1_thd2~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 230#true, Black: 186#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 446#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 42#$Ultimate##0true, Black: 317#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 288#true, 20#L769true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 426#true, Black: 199#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 105#true, Black: 458#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 337#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 214#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 327#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 333#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 22#L785true, Black: 470#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 269#true, Black: 353#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 526#true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 140#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), 506#true, Black: 240#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 500#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-28 02:50:48,219 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-28 02:50:48,220 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-28 02:50:48,220 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-28 02:50:48,220 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-28 02:50:48,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L800-->L802: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0][292], [323#true, Black: 253#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 263#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 134#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 152#true, Black: 515#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 521#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 ~z$w_buff0_used~0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 149#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 278#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 282#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 274#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 16#L851true, Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork2InUse, Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork0InUse, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 434#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff0_thd3~0) (<= 0 ~z$r_buff1_thd2~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 230#true, Black: 186#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 446#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 317#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 288#true, 20#L769true, 2#L782true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 426#true, Black: 199#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 105#true, Black: 458#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 337#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 214#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 327#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 333#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 470#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 269#true, Black: 353#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 38#L802true, 526#true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 140#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), 506#true, Black: 240#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 500#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-28 02:50:48,254 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-28 02:50:48,255 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:50:48,255 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:50:48,255 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:50:48,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L769-->L772: 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][149], [323#true, Black: 253#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 263#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 134#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 515#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 152#true, Black: 256#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 521#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 ~z$w_buff0_used~0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 149#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 278#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 282#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 274#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 16#L851true, Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork2InUse, Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork0InUse, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 434#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff0_thd3~0) (<= 0 ~z$r_buff1_thd2~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 230#true, Black: 186#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 446#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 317#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 42#$Ultimate##0true, 288#true, 2#L782true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 426#true, Black: 199#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 105#true, Black: 458#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 337#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 214#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 327#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 333#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 470#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 37#L772true, Black: 224#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 269#true, Black: 353#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 526#true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 140#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), 506#true, Black: 240#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 500#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-28 02:50:48,257 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-06-28 02:50:48,257 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 02:50:48,257 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 02:50:48,257 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 02:50:48,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([349] L851-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse12 (not (= (mod v_~z$r_buff0_thd0~0_7 256) 0))) (.cse2 (not (= v_~__unbuffered_p0_EAX~0_7 1))) (.cse3 (not (= v_~__unbuffered_p0_EAX~0_7 0))) (.cse16 (not (= v_~x~0_9 1))) (.cse17 (not (= v_~x~0_9 0))) (.cse19 (< v_~__unbuffered_cnt~0_12 0)) (.cse18 (not (= (mod v_~z$r_buff0_thd3~0_21 256) 0))) (.cse26 (not (= v_~z$w_buff0~0_14 1))) (.cse27 (not (= v_~z$w_buff0~0_14 0))) (.cse28 (not (= v_~z~0_18 1))) (.cse29 (not (= v_~z~0_18 0))) (.cse15 (not (= v_~z$read_delayed_var~0.offset_6 0))) (.cse25 (not (= v_~z$read_delayed_var~0.base_6 0))) (.cse7 (not (= v_~__unbuffered_p1_EBX~0_7 1))) (.cse8 (not (= v_~__unbuffered_p1_EBX~0_7 0))) (.cse11 (not (= (mod v_~z$read_delayed~0_6 256) 0))) (.cse0 (not (= v_~__unbuffered_p1_EAX~0_7 0))) (.cse1 (not (= v_~__unbuffered_p1_EAX~0_7 1))) (.cse22 (not (= v_~y~0_9 1))) (.cse23 (not (= v_~y~0_9 0))) (.cse31 (not (= (mod v_~z$r_buff1_thd2~0_11 256) 0))) (.cse9 (not (= v_~z$w_buff1~0_13 1))) (.cse10 (not (= v_~z$w_buff1~0_13 0))) (.cse4 (not (= v_~z$mem_tmp~0_8 0))) (.cse5 (not (= v_~z$mem_tmp~0_8 1))) (.cse30 (not (= (mod v_~z$r_buff1_thd3~0_19 256) 0))) (.cse13 (not (= v_~__unbuffered_p2_EBX~0_7 1))) (.cse14 (not (= v_~__unbuffered_p2_EBX~0_7 0))) (.cse6 (not (= (mod v_~z$r_buff1_thd0~0_7 256) 0))) (.cse20 (not (= v_~__unbuffered_p2_EAX~0_7 1))) (.cse21 (not (= v_~__unbuffered_p2_EAX~0_7 0))) (.cse24 (not (= (mod v_~z$r_buff0_thd2~0_13 256) 0))) (.cse32 (not (= |v_#ghost~multithreaded_7| 0)))) (or (and (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse4 .cse5) .cse6 (and .cse7 .cse8) (and .cse9 .cse10) .cse11 .cse12 (and .cse13 .cse14) .cse15 (and .cse16 .cse17) (not (= (mod v_~z$flush_delayed~0_9 256) 0)) .cse18 .cse19 (and .cse20 .cse21) (and .cse22 .cse23) .cse24 .cse25 (and .cse26 .cse27) (and .cse28 .cse29) .cse30 .cse31) .cse32) (and .cse12 .cse32) (and .cse2 .cse3 .cse32) (and .cse16 .cse17 .cse32) (and .cse19 .cse32) (and .cse18 .cse32) (and .cse26 .cse32 .cse27) (and .cse28 .cse32 .cse29) (and (or .cse15 .cse25) .cse32) (and .cse7 .cse8 .cse32) (and .cse11 .cse32) (and .cse0 .cse1 .cse32) (and .cse22 .cse23 .cse32) (and .cse32 .cse31) (and .cse9 .cse32 .cse10) (and .cse4 .cse5 .cse32) (and .cse32 .cse30) (and .cse13 .cse14 .cse32) (and .cse6 .cse32) (and .cse20 .cse21 .cse32) (and .cse24 .cse32))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~z~0=v_~z~0_18, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~x~0=v_~x~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~z~0=v_~z~0_18, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[][219], [323#true, Black: 253#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 259#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 263#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 134#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 152#true, Black: 256#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 515#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 521#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 ~z$w_buff0_used~0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 147#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 149#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 278#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 282#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 274#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 159#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork2InUse, Black: 170#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork0InUse, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P2Thread1of1ForFork1InUse, Black: 434#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (<= 0 ~z$r_buff0_thd3~0) (<= 0 ~z$r_buff1_thd2~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 230#true, Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 446#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 317#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 42#$Ultimate##0true, 288#true, 20#L769true, 2#L782true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 426#true, 105#true, Black: 199#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 458#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (<= 0 ~z$r_buff0_thd3~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (<= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= 0 ~z$read_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 337#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 214#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 327#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 333#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 89#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 470#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 224#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 269#true, Black: 353#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 359#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 484#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 357#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (or (and (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)))) (= ~z~0 0)))) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 34#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 526#true, Black: 111#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 140#true, Black: 235#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), 506#true, Black: 240#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff0_used~0 1) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 237#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 500#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))]) [2024-06-28 02:50:48,259 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-06-28 02:50:48,259 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 02:50:48,259 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 02:50:48,259 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-06-28 02:50:48,545 INFO L124 PetriNetUnfolderBase]: 2802/4249 cut-off events. [2024-06-28 02:50:48,545 INFO L125 PetriNetUnfolderBase]: For 153334/153579 co-relation queries the response was YES. [2024-06-28 02:50:48,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29003 conditions, 4249 events. 2802/4249 cut-off events. For 153334/153579 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 21805 event pairs, 1212 based on Foata normal form. 31/4205 useless extension candidates. Maximal degree in co-relation 28932. Up to 3985 conditions per place. [2024-06-28 02:50:48,581 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 255 selfloop transitions, 12 changer transitions 0/318 dead transitions. [2024-06-28 02:50:48,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 318 transitions, 3936 flow [2024-06-28 02:50:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:50:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:50:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-28 02:50:48,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 02:50:48,582 INFO L175 Difference]: Start difference. First operand has 163 places, 305 transitions, 3338 flow. Second operand 6 states and 108 transitions. [2024-06-28 02:50:48,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 318 transitions, 3936 flow [2024-06-28 02:50:48,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 318 transitions, 3863 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-28 02:50:48,692 INFO L231 Difference]: Finished difference. Result has 164 places, 308 transitions, 3327 flow [2024-06-28 02:50:48,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3265, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3327, PETRI_PLACES=164, PETRI_TRANSITIONS=308} [2024-06-28 02:50:48,692 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2024-06-28 02:50:48,692 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 308 transitions, 3327 flow [2024-06-28 02:50:48,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-28 02:50:48,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:48,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:48,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 02:50:48,693 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-28 02:50:48,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash 621564356, now seen corresponding path program 1 times [2024-06-28 02:50:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:48,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341044740] [2024-06-28 02:50:48,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:49,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:49,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341044740] [2024-06-28 02:50:49,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341044740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:49,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:49,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:50:49,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145750122] [2024-06-28 02:50:49,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:49,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:50:49,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:49,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:50:49,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:50:49,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:49,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 308 transitions, 3327 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:49,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:49,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:49,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:50,783 INFO L124 PetriNetUnfolderBase]: 2777/4278 cut-off events. [2024-06-28 02:50:50,783 INFO L125 PetriNetUnfolderBase]: For 147795/147828 co-relation queries the response was YES. [2024-06-28 02:50:50,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29960 conditions, 4278 events. 2777/4278 cut-off events. For 147795/147828 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 22526 event pairs, 893 based on Foata normal form. 10/4254 useless extension candidates. Maximal degree in co-relation 29888. Up to 3759 conditions per place. [2024-06-28 02:50:50,824 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 269 selfloop transitions, 91 changer transitions 0/367 dead transitions. [2024-06-28 02:50:50,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 367 transitions, 4495 flow [2024-06-28 02:50:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 02:50:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 02:50:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 264 transitions. [2024-06-28 02:50:50,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-28 02:50:50,825 INFO L175 Difference]: Start difference. First operand has 164 places, 308 transitions, 3327 flow. Second operand 14 states and 264 transitions. [2024-06-28 02:50:50,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 367 transitions, 4495 flow [2024-06-28 02:50:50,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 367 transitions, 4455 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 02:50:50,949 INFO L231 Difference]: Finished difference. Result has 174 places, 314 transitions, 3604 flow [2024-06-28 02:50:50,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3287, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3604, PETRI_PLACES=174, PETRI_TRANSITIONS=314} [2024-06-28 02:50:50,950 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 131 predicate places. [2024-06-28 02:50:50,950 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 314 transitions, 3604 flow [2024-06-28 02:50:50,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:50,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:50,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:50,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 02:50:50,951 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-28 02:50:50,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1769263332, now seen corresponding path program 1 times [2024-06-28 02:50:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905971102] [2024-06-28 02:50:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:51,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:51,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905971102] [2024-06-28 02:50:51,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905971102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:51,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:51,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:50:51,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900389862] [2024-06-28 02:50:51,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:51,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:50:51,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:51,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:50:51,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:50:51,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:51,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 314 transitions, 3604 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:51,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:51,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:51,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:52,741 INFO L124 PetriNetUnfolderBase]: 2921/4479 cut-off events. [2024-06-28 02:50:52,741 INFO L125 PetriNetUnfolderBase]: For 173938/173967 co-relation queries the response was YES. [2024-06-28 02:50:52,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32780 conditions, 4479 events. 2921/4479 cut-off events. For 173938/173967 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 23775 event pairs, 748 based on Foata normal form. 14/4453 useless extension candidates. Maximal degree in co-relation 32707. Up to 3828 conditions per place. [2024-06-28 02:50:52,780 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 249 selfloop transitions, 113 changer transitions 0/369 dead transitions. [2024-06-28 02:50:52,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 369 transitions, 4912 flow [2024-06-28 02:50:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:50:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:50:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 214 transitions. [2024-06-28 02:50:52,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2024-06-28 02:50:52,781 INFO L175 Difference]: Start difference. First operand has 174 places, 314 transitions, 3604 flow. Second operand 11 states and 214 transitions. [2024-06-28 02:50:52,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 369 transitions, 4912 flow [2024-06-28 02:50:52,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 369 transitions, 4778 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-28 02:50:52,932 INFO L231 Difference]: Finished difference. Result has 179 places, 323 transitions, 3936 flow [2024-06-28 02:50:52,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3470, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3936, PETRI_PLACES=179, PETRI_TRANSITIONS=323} [2024-06-28 02:50:52,933 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 136 predicate places. [2024-06-28 02:50:52,933 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 323 transitions, 3936 flow [2024-06-28 02:50:52,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:52,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:52,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:52,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 02:50:52,934 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-28 02:50:52,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash 535749628, now seen corresponding path program 2 times [2024-06-28 02:50:52,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:52,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564723195] [2024-06-28 02:50:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:53,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564723195] [2024-06-28 02:50:53,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564723195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:53,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:53,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:53,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148486534] [2024-06-28 02:50:53,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:53,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:53,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:53,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:53,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:53,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:53,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 323 transitions, 3936 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:53,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:53,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:53,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:54,681 INFO L124 PetriNetUnfolderBase]: 2973/4585 cut-off events. [2024-06-28 02:50:54,681 INFO L125 PetriNetUnfolderBase]: For 184687/184703 co-relation queries the response was YES. [2024-06-28 02:50:54,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34288 conditions, 4585 events. 2973/4585 cut-off events. For 184687/184703 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 24509 event pairs, 862 based on Foata normal form. 6/4562 useless extension candidates. Maximal degree in co-relation 34211. Up to 3830 conditions per place. [2024-06-28 02:50:54,720 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 245 selfloop transitions, 128 changer transitions 0/380 dead transitions. [2024-06-28 02:50:54,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 380 transitions, 5344 flow [2024-06-28 02:50:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:50:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:50:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-28 02:50:54,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-28 02:50:54,721 INFO L175 Difference]: Start difference. First operand has 179 places, 323 transitions, 3936 flow. Second operand 11 states and 217 transitions. [2024-06-28 02:50:54,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 380 transitions, 5344 flow [2024-06-28 02:50:54,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 380 transitions, 5110 flow, removed 55 selfloop flow, removed 7 redundant places. [2024-06-28 02:50:54,891 INFO L231 Difference]: Finished difference. Result has 184 places, 337 transitions, 4273 flow [2024-06-28 02:50:54,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3702, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4273, PETRI_PLACES=184, PETRI_TRANSITIONS=337} [2024-06-28 02:50:54,892 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places. [2024-06-28 02:50:54,892 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 337 transitions, 4273 flow [2024-06-28 02:50:54,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:54,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:54,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:54,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 02:50:54,892 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-28 02:50:54,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:54,893 INFO L85 PathProgramCache]: Analyzing trace with hash 533513784, now seen corresponding path program 2 times [2024-06-28 02:50:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:54,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270041743] [2024-06-28 02:50:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:55,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270041743] [2024-06-28 02:50:55,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270041743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:55,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:55,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:55,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247896069] [2024-06-28 02:50:55,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:55,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:55,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:55,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:55,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:55,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:55,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 337 transitions, 4273 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:55,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:55,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:55,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:56,736 INFO L124 PetriNetUnfolderBase]: 3082/4752 cut-off events. [2024-06-28 02:50:56,736 INFO L125 PetriNetUnfolderBase]: For 201799/201820 co-relation queries the response was YES. [2024-06-28 02:50:56,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36369 conditions, 4752 events. 3082/4752 cut-off events. For 201799/201820 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 25717 event pairs, 909 based on Foata normal form. 12/4733 useless extension candidates. Maximal degree in co-relation 36290. Up to 4115 conditions per place. [2024-06-28 02:50:56,771 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 266 selfloop transitions, 120 changer transitions 0/393 dead transitions. [2024-06-28 02:50:56,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 393 transitions, 5573 flow [2024-06-28 02:50:56,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:50:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:50:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-28 02:50:56,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2024-06-28 02:50:56,772 INFO L175 Difference]: Start difference. First operand has 184 places, 337 transitions, 4273 flow. Second operand 11 states and 213 transitions. [2024-06-28 02:50:56,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 393 transitions, 5573 flow [2024-06-28 02:50:56,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 393 transitions, 5401 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-06-28 02:50:56,949 INFO L231 Difference]: Finished difference. Result has 189 places, 351 transitions, 4615 flow [2024-06-28 02:50:56,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4105, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4615, PETRI_PLACES=189, PETRI_TRANSITIONS=351} [2024-06-28 02:50:56,950 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 146 predicate places. [2024-06-28 02:50:56,950 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 351 transitions, 4615 flow [2024-06-28 02:50:56,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:56,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:56,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:56,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 02:50:56,950 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-28 02:50:56,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1987358458, now seen corresponding path program 3 times [2024-06-28 02:50:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56914794] [2024-06-28 02:50:56,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:56,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:50:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:50:57,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:50:57,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56914794] [2024-06-28 02:50:57,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56914794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:50:57,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:50:57,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:50:57,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730367258] [2024-06-28 02:50:57,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:50:57,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:50:57,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:50:57,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:50:57,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:50:57,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:50:57,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 351 transitions, 4615 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:57,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:50:57,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:50:57,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:50:58,822 INFO L124 PetriNetUnfolderBase]: 3085/4761 cut-off events. [2024-06-28 02:50:58,822 INFO L125 PetriNetUnfolderBase]: For 197901/197915 co-relation queries the response was YES. [2024-06-28 02:50:58,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36329 conditions, 4761 events. 3085/4761 cut-off events. For 197901/197915 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 25736 event pairs, 933 based on Foata normal form. 8/4738 useless extension candidates. Maximal degree in co-relation 36248. Up to 4231 conditions per place. [2024-06-28 02:50:58,862 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 272 selfloop transitions, 110 changer transitions 0/389 dead transitions. [2024-06-28 02:50:58,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 389 transitions, 5601 flow [2024-06-28 02:50:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:50:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:50:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-28 02:50:58,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45021645021645024 [2024-06-28 02:50:58,864 INFO L175 Difference]: Start difference. First operand has 189 places, 351 transitions, 4615 flow. Second operand 11 states and 208 transitions. [2024-06-28 02:50:58,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 389 transitions, 5601 flow [2024-06-28 02:50:59,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 389 transitions, 5404 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-28 02:50:59,057 INFO L231 Difference]: Finished difference. Result has 193 places, 353 transitions, 4706 flow [2024-06-28 02:50:59,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4418, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4706, PETRI_PLACES=193, PETRI_TRANSITIONS=353} [2024-06-28 02:50:59,058 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places. [2024-06-28 02:50:59,058 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 353 transitions, 4706 flow [2024-06-28 02:50:59,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:50:59,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:50:59,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:50:59,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 02:50:59,059 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-28 02:50:59,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:50:59,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1894087738, now seen corresponding path program 4 times [2024-06-28 02:50:59,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:50:59,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907528427] [2024-06-28 02:50:59,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:50:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:50:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:00,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907528427] [2024-06-28 02:51:00,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907528427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:00,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:00,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:00,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628797012] [2024-06-28 02:51:00,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:00,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:00,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:00,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:00,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:00,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 353 transitions, 4706 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:00,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:00,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:00,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:01,260 INFO L124 PetriNetUnfolderBase]: 3243/5015 cut-off events. [2024-06-28 02:51:01,260 INFO L125 PetriNetUnfolderBase]: For 211607/211627 co-relation queries the response was YES. [2024-06-28 02:51:01,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38597 conditions, 5015 events. 3243/5015 cut-off events. For 211607/211627 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 27482 event pairs, 937 based on Foata normal form. 12/5003 useless extension candidates. Maximal degree in co-relation 38514. Up to 4447 conditions per place. [2024-06-28 02:51:01,313 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 322 selfloop transitions, 88 changer transitions 0/417 dead transitions. [2024-06-28 02:51:01,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 417 transitions, 6217 flow [2024-06-28 02:51:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:51:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:51:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2024-06-28 02:51:01,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2024-06-28 02:51:01,314 INFO L175 Difference]: Start difference. First operand has 193 places, 353 transitions, 4706 flow. Second operand 11 states and 211 transitions. [2024-06-28 02:51:01,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 417 transitions, 6217 flow [2024-06-28 02:51:01,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 417 transitions, 5899 flow, removed 51 selfloop flow, removed 9 redundant places. [2024-06-28 02:51:01,542 INFO L231 Difference]: Finished difference. Result has 196 places, 375 transitions, 5032 flow [2024-06-28 02:51:01,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4428, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5032, PETRI_PLACES=196, PETRI_TRANSITIONS=375} [2024-06-28 02:51:01,543 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 153 predicate places. [2024-06-28 02:51:01,543 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 375 transitions, 5032 flow [2024-06-28 02:51:01,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:01,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:01,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:01,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 02:51:01,543 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:01,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1780523578, now seen corresponding path program 5 times [2024-06-28 02:51:01,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:01,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001442664] [2024-06-28 02:51:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:01,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:02,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:02,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001442664] [2024-06-28 02:51:02,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001442664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:02,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:02,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649735275] [2024-06-28 02:51:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:02,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:02,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:02,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:02,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:02,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:02,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 375 transitions, 5032 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:02,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:02,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:02,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:03,832 INFO L124 PetriNetUnfolderBase]: 3225/4990 cut-off events. [2024-06-28 02:51:03,833 INFO L125 PetriNetUnfolderBase]: For 217977/217997 co-relation queries the response was YES. [2024-06-28 02:51:03,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38410 conditions, 4990 events. 3225/4990 cut-off events. For 217977/217997 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 27369 event pairs, 955 based on Foata normal form. 14/4980 useless extension candidates. Maximal degree in co-relation 38325. Up to 4531 conditions per place. [2024-06-28 02:51:03,882 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 328 selfloop transitions, 77 changer transitions 0/412 dead transitions. [2024-06-28 02:51:03,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 412 transitions, 5997 flow [2024-06-28 02:51:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:51:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:51:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2024-06-28 02:51:03,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2024-06-28 02:51:03,883 INFO L175 Difference]: Start difference. First operand has 196 places, 375 transitions, 5032 flow. Second operand 11 states and 206 transitions. [2024-06-28 02:51:03,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 412 transitions, 5997 flow [2024-06-28 02:51:04,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 412 transitions, 5752 flow, removed 82 selfloop flow, removed 7 redundant places. [2024-06-28 02:51:04,137 INFO L231 Difference]: Finished difference. Result has 200 places, 375 transitions, 4961 flow [2024-06-28 02:51:04,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4787, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4961, PETRI_PLACES=200, PETRI_TRANSITIONS=375} [2024-06-28 02:51:04,138 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places. [2024-06-28 02:51:04,138 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 375 transitions, 4961 flow [2024-06-28 02:51:04,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:04,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:04,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:04,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 02:51:04,138 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:04,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:04,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1780523454, now seen corresponding path program 3 times [2024-06-28 02:51:04,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:04,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576899218] [2024-06-28 02:51:04,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:04,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:05,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:05,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576899218] [2024-06-28 02:51:05,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576899218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:05,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:05,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170144810] [2024-06-28 02:51:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:05,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:05,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:05,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:05,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:05,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 375 transitions, 4961 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:05,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:05,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:05,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:06,526 INFO L124 PetriNetUnfolderBase]: 3303/5116 cut-off events. [2024-06-28 02:51:06,526 INFO L125 PetriNetUnfolderBase]: For 228519/228539 co-relation queries the response was YES. [2024-06-28 02:51:06,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39412 conditions, 5116 events. 3303/5116 cut-off events. For 228519/228539 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 28244 event pairs, 960 based on Foata normal form. 14/5107 useless extension candidates. Maximal degree in co-relation 39325. Up to 4571 conditions per place. [2024-06-28 02:51:06,570 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 328 selfloop transitions, 97 changer transitions 0/432 dead transitions. [2024-06-28 02:51:06,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 432 transitions, 6247 flow [2024-06-28 02:51:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:51:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:51:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2024-06-28 02:51:06,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-28 02:51:06,571 INFO L175 Difference]: Start difference. First operand has 200 places, 375 transitions, 4961 flow. Second operand 12 states and 225 transitions. [2024-06-28 02:51:06,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 432 transitions, 6247 flow [2024-06-28 02:51:06,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 432 transitions, 6103 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-28 02:51:06,799 INFO L231 Difference]: Finished difference. Result has 203 places, 390 transitions, 5315 flow [2024-06-28 02:51:06,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4817, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5315, PETRI_PLACES=203, PETRI_TRANSITIONS=390} [2024-06-28 02:51:06,800 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places. [2024-06-28 02:51:06,800 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 390 transitions, 5315 flow [2024-06-28 02:51:06,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:06,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:06,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:06,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 02:51:06,800 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:06,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash -59202086, now seen corresponding path program 4 times [2024-06-28 02:51:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:06,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574275414] [2024-06-28 02:51:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:06,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:07,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:07,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574275414] [2024-06-28 02:51:07,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574275414] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:07,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:07,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587290143] [2024-06-28 02:51:07,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:07,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:07,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:07,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:07,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:07,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:07,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 390 transitions, 5315 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:07,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:07,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:07,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:09,165 INFO L124 PetriNetUnfolderBase]: 3314/5135 cut-off events. [2024-06-28 02:51:09,165 INFO L125 PetriNetUnfolderBase]: For 239861/239877 co-relation queries the response was YES. [2024-06-28 02:51:09,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40125 conditions, 5135 events. 3314/5135 cut-off events. For 239861/239877 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28435 event pairs, 900 based on Foata normal form. 12/5123 useless extension candidates. Maximal degree in co-relation 40037. Up to 4326 conditions per place. [2024-06-28 02:51:09,219 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 292 selfloop transitions, 139 changer transitions 0/438 dead transitions. [2024-06-28 02:51:09,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 438 transitions, 6542 flow [2024-06-28 02:51:09,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:51:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:51:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-28 02:51:09,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738095238095238 [2024-06-28 02:51:09,220 INFO L175 Difference]: Start difference. First operand has 203 places, 390 transitions, 5315 flow. Second operand 10 states and 199 transitions. [2024-06-28 02:51:09,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 438 transitions, 6542 flow [2024-06-28 02:51:09,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 438 transitions, 6231 flow, removed 72 selfloop flow, removed 10 redundant places. [2024-06-28 02:51:09,520 INFO L231 Difference]: Finished difference. Result has 203 places, 393 transitions, 5362 flow [2024-06-28 02:51:09,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5004, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5362, PETRI_PLACES=203, PETRI_TRANSITIONS=393} [2024-06-28 02:51:09,520 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places. [2024-06-28 02:51:09,520 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 393 transitions, 5362 flow [2024-06-28 02:51:09,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:09,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:09,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:09,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 02:51:09,521 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:09,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:09,521 INFO L85 PathProgramCache]: Analyzing trace with hash -59379716, now seen corresponding path program 5 times [2024-06-28 02:51:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:09,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170816636] [2024-06-28 02:51:09,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:09,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:10,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-28 02:51:10,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:10,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170816636] [2024-06-28 02:51:10,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170816636] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:10,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:10,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:10,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181197929] [2024-06-28 02:51:10,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:10,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:10,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:10,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:10,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:10,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:10,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 393 transitions, 5362 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:10,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:10,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:10,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:11,830 INFO L124 PetriNetUnfolderBase]: 3346/5191 cut-off events. [2024-06-28 02:51:11,830 INFO L125 PetriNetUnfolderBase]: For 252577/252593 co-relation queries the response was YES. [2024-06-28 02:51:11,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41206 conditions, 5191 events. 3346/5191 cut-off events. For 252577/252593 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 28840 event pairs, 871 based on Foata normal form. 12/5182 useless extension candidates. Maximal degree in co-relation 41117. Up to 4338 conditions per place. [2024-06-28 02:51:11,883 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 299 selfloop transitions, 141 changer transitions 0/447 dead transitions. [2024-06-28 02:51:11,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 447 transitions, 6657 flow [2024-06-28 02:51:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:51:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:51:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-28 02:51:11,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 02:51:11,885 INFO L175 Difference]: Start difference. First operand has 203 places, 393 transitions, 5362 flow. Second operand 11 states and 220 transitions. [2024-06-28 02:51:11,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 447 transitions, 6657 flow [2024-06-28 02:51:12,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 447 transitions, 6323 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-28 02:51:12,270 INFO L231 Difference]: Finished difference. Result has 206 places, 396 transitions, 5397 flow [2024-06-28 02:51:12,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5028, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5397, PETRI_PLACES=206, PETRI_TRANSITIONS=396} [2024-06-28 02:51:12,270 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 163 predicate places. [2024-06-28 02:51:12,270 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 396 transitions, 5397 flow [2024-06-28 02:51:12,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:12,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:12,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:12,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 02:51:12,271 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:12,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:12,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1775939608, now seen corresponding path program 6 times [2024-06-28 02:51:12,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:12,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558690229] [2024-06-28 02:51:12,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:12,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:13,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-28 02:51:13,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558690229] [2024-06-28 02:51:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558690229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:13,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:13,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035327103] [2024-06-28 02:51:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:13,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:13,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:13,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:13,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:13,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 396 transitions, 5397 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:13,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:13,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:13,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:14,856 INFO L124 PetriNetUnfolderBase]: 3364/5207 cut-off events. [2024-06-28 02:51:14,857 INFO L125 PetriNetUnfolderBase]: For 264767/264784 co-relation queries the response was YES. [2024-06-28 02:51:14,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41943 conditions, 5207 events. 3364/5207 cut-off events. For 264767/264784 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 28892 event pairs, 961 based on Foata normal form. 14/5204 useless extension candidates. Maximal degree in co-relation 41853. Up to 4727 conditions per place. [2024-06-28 02:51:14,907 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 345 selfloop transitions, 80 changer transitions 0/432 dead transitions. [2024-06-28 02:51:14,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 432 transitions, 6503 flow [2024-06-28 02:51:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:51:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:51:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-28 02:51:14,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-28 02:51:14,909 INFO L175 Difference]: Start difference. First operand has 206 places, 396 transitions, 5397 flow. Second operand 10 states and 191 transitions. [2024-06-28 02:51:14,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 432 transitions, 6503 flow [2024-06-28 02:51:15,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 432 transitions, 6160 flow, removed 33 selfloop flow, removed 9 redundant places. [2024-06-28 02:51:15,202 INFO L231 Difference]: Finished difference. Result has 207 places, 398 transitions, 5289 flow [2024-06-28 02:51:15,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5054, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5289, PETRI_PLACES=207, PETRI_TRANSITIONS=398} [2024-06-28 02:51:15,202 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 164 predicate places. [2024-06-28 02:51:15,202 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 398 transitions, 5289 flow [2024-06-28 02:51:15,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:15,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:15,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:15,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 02:51:15,203 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-28 02:51:15,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1989681320, now seen corresponding path program 1 times [2024-06-28 02:51:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:15,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457075799] [2024-06-28 02:51:15,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:15,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:15,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:15,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457075799] [2024-06-28 02:51:15,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457075799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:15,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:15,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:51:15,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360142248] [2024-06-28 02:51:15,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:15,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:51:15,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:15,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:51:15,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:51:15,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:15,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 398 transitions, 5289 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-28 02:51:15,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:15,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:15,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:16,809 INFO L124 PetriNetUnfolderBase]: 3439/5282 cut-off events. [2024-06-28 02:51:16,809 INFO L125 PetriNetUnfolderBase]: For 291522/291583 co-relation queries the response was YES. [2024-06-28 02:51:16,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42007 conditions, 5282 events. 3439/5282 cut-off events. For 291522/291583 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 28616 event pairs, 1158 based on Foata normal form. 27/5275 useless extension candidates. Maximal degree in co-relation 41916. Up to 4817 conditions per place. [2024-06-28 02:51:16,863 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 321 selfloop transitions, 32 changer transitions 0/422 dead transitions. [2024-06-28 02:51:16,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 422 transitions, 6217 flow [2024-06-28 02:51:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:51:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:51:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-28 02:51:16,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 02:51:16,864 INFO L175 Difference]: Start difference. First operand has 207 places, 398 transitions, 5289 flow. Second operand 7 states and 133 transitions. [2024-06-28 02:51:16,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 422 transitions, 6217 flow [2024-06-28 02:51:17,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 422 transitions, 6000 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-28 02:51:17,157 INFO L231 Difference]: Finished difference. Result has 206 places, 404 transitions, 5211 flow [2024-06-28 02:51:17,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5072, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5211, PETRI_PLACES=206, PETRI_TRANSITIONS=404} [2024-06-28 02:51:17,157 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 163 predicate places. [2024-06-28 02:51:17,157 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 404 transitions, 5211 flow [2024-06-28 02:51:17,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-28 02:51:17,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:17,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:17,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 02:51:17,158 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:17,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:17,158 INFO L85 PathProgramCache]: Analyzing trace with hash -917997140, now seen corresponding path program 1 times [2024-06-28 02:51:17,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:17,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816418394] [2024-06-28 02:51:17,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:17,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:17,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-28 02:51:17,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:17,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816418394] [2024-06-28 02:51:17,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816418394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:17,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:17,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247863208] [2024-06-28 02:51:17,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:17,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:17,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:17,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:17,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:18,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:18,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 404 transitions, 5211 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:18,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:18,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:18,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:19,371 INFO L124 PetriNetUnfolderBase]: 3607/5603 cut-off events. [2024-06-28 02:51:19,371 INFO L125 PetriNetUnfolderBase]: For 331265/331286 co-relation queries the response was YES. [2024-06-28 02:51:19,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46321 conditions, 5603 events. 3607/5603 cut-off events. For 331265/331286 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 31634 event pairs, 953 based on Foata normal form. 24/5596 useless extension candidates. Maximal degree in co-relation 46229. Up to 4132 conditions per place. [2024-06-28 02:51:19,424 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 304 selfloop transitions, 156 changer transitions 0/469 dead transitions. [2024-06-28 02:51:19,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 469 transitions, 6979 flow [2024-06-28 02:51:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:51:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:51:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 244 transitions. [2024-06-28 02:51:19,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-06-28 02:51:19,426 INFO L175 Difference]: Start difference. First operand has 206 places, 404 transitions, 5211 flow. Second operand 12 states and 244 transitions. [2024-06-28 02:51:19,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 469 transitions, 6979 flow [2024-06-28 02:51:19,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 469 transitions, 6931 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-28 02:51:19,782 INFO L231 Difference]: Finished difference. Result has 215 places, 406 transitions, 5578 flow [2024-06-28 02:51:19,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5163, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5578, PETRI_PLACES=215, PETRI_TRANSITIONS=406} [2024-06-28 02:51:19,782 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places. [2024-06-28 02:51:19,783 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 406 transitions, 5578 flow [2024-06-28 02:51:19,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:19,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:19,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:19,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 02:51:19,783 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-28 02:51:19,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1847999588, now seen corresponding path program 7 times [2024-06-28 02:51:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:19,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366223091] [2024-06-28 02:51:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:19,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:20,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:20,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366223091] [2024-06-28 02:51:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366223091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:20,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:20,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:20,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548965261] [2024-06-28 02:51:20,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:20,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:20,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:20,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:20,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:21,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:21,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 406 transitions, 5578 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:21,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:21,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:21,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:22,277 INFO L124 PetriNetUnfolderBase]: 3678/5682 cut-off events. [2024-06-28 02:51:22,278 INFO L125 PetriNetUnfolderBase]: For 355754/355818 co-relation queries the response was YES. [2024-06-28 02:51:22,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48395 conditions, 5682 events. 3678/5682 cut-off events. For 355754/355818 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32220 event pairs, 860 based on Foata normal form. 18/5648 useless extension candidates. Maximal degree in co-relation 48301. Up to 4746 conditions per place. [2024-06-28 02:51:22,341 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 288 selfloop transitions, 154 changer transitions 0/451 dead transitions. [2024-06-28 02:51:22,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 451 transitions, 6958 flow [2024-06-28 02:51:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:51:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:51:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-28 02:51:22,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-28 02:51:22,343 INFO L175 Difference]: Start difference. First operand has 215 places, 406 transitions, 5578 flow. Second operand 10 states and 194 transitions. [2024-06-28 02:51:22,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 451 transitions, 6958 flow [2024-06-28 02:51:22,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 451 transitions, 6786 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-28 02:51:22,736 INFO L231 Difference]: Finished difference. Result has 218 places, 410 transitions, 5849 flow [2024-06-28 02:51:22,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5406, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5849, PETRI_PLACES=218, PETRI_TRANSITIONS=410} [2024-06-28 02:51:22,737 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 175 predicate places. [2024-06-28 02:51:22,737 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 410 transitions, 5849 flow [2024-06-28 02:51:22,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:22,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:22,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:22,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 02:51:22,737 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-28 02:51:22,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1847939138, now seen corresponding path program 8 times [2024-06-28 02:51:22,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:22,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979092005] [2024-06-28 02:51:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979092005] [2024-06-28 02:51:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979092005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:23,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:23,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230484184] [2024-06-28 02:51:23,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:23,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:24,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:24,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 410 transitions, 5849 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:24,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:24,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:24,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:25,215 INFO L124 PetriNetUnfolderBase]: 3614/5604 cut-off events. [2024-06-28 02:51:25,215 INFO L125 PetriNetUnfolderBase]: For 349813/349859 co-relation queries the response was YES. [2024-06-28 02:51:25,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47850 conditions, 5604 events. 3614/5604 cut-off events. For 349813/349859 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 31770 event pairs, 1089 based on Foata normal form. 14/5578 useless extension candidates. Maximal degree in co-relation 47754. Up to 4943 conditions per place. [2024-06-28 02:51:25,276 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 312 selfloop transitions, 126 changer transitions 0/447 dead transitions. [2024-06-28 02:51:25,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 447 transitions, 6933 flow [2024-06-28 02:51:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:51:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:51:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-28 02:51:25,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 02:51:25,277 INFO L175 Difference]: Start difference. First operand has 218 places, 410 transitions, 5849 flow. Second operand 10 states and 190 transitions. [2024-06-28 02:51:25,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 447 transitions, 6933 flow [2024-06-28 02:51:25,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 447 transitions, 6521 flow, removed 88 selfloop flow, removed 8 redundant places. [2024-06-28 02:51:25,789 INFO L231 Difference]: Finished difference. Result has 220 places, 410 transitions, 5727 flow [2024-06-28 02:51:25,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5437, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5727, PETRI_PLACES=220, PETRI_TRANSITIONS=410} [2024-06-28 02:51:25,790 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places. [2024-06-28 02:51:25,790 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 410 transitions, 5727 flow [2024-06-28 02:51:25,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:25,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:25,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:25,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 02:51:25,791 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-28 02:51:25,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1847939014, now seen corresponding path program 6 times [2024-06-28 02:51:25,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:25,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049051743] [2024-06-28 02:51:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:25,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:26,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:26,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049051743] [2024-06-28 02:51:26,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049051743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:26,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:26,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:26,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997699920] [2024-06-28 02:51:26,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:26,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:26,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:26,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:26,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:27,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:27,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 410 transitions, 5727 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:27,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:27,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:27,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:28,385 INFO L124 PetriNetUnfolderBase]: 3592/5600 cut-off events. [2024-06-28 02:51:28,385 INFO L125 PetriNetUnfolderBase]: For 315473/315509 co-relation queries the response was YES. [2024-06-28 02:51:28,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46256 conditions, 5600 events. 3592/5600 cut-off events. For 315473/315509 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 31879 event pairs, 1023 based on Foata normal form. 14/5578 useless extension candidates. Maximal degree in co-relation 46160. Up to 4758 conditions per place. [2024-06-28 02:51:28,436 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 280 selfloop transitions, 164 changer transitions 0/453 dead transitions. [2024-06-28 02:51:28,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 453 transitions, 6891 flow [2024-06-28 02:51:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:51:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:51:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-28 02:51:28,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 02:51:28,438 INFO L175 Difference]: Start difference. First operand has 220 places, 410 transitions, 5727 flow. Second operand 11 states and 209 transitions. [2024-06-28 02:51:28,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 453 transitions, 6891 flow [2024-06-28 02:51:28,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 453 transitions, 6505 flow, removed 49 selfloop flow, removed 10 redundant places. [2024-06-28 02:51:28,822 INFO L231 Difference]: Finished difference. Result has 221 places, 410 transitions, 5727 flow [2024-06-28 02:51:28,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5341, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5727, PETRI_PLACES=221, PETRI_TRANSITIONS=410} [2024-06-28 02:51:28,822 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 178 predicate places. [2024-06-28 02:51:28,822 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 410 transitions, 5727 flow [2024-06-28 02:51:28,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:28,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:28,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:28,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 02:51:28,823 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-28 02:51:28,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1729673704, now seen corresponding path program 7 times [2024-06-28 02:51:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590376823] [2024-06-28 02:51:28,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:28,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:29,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:29,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590376823] [2024-06-28 02:51:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590376823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453424571] [2024-06-28 02:51:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:29,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:30,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:30,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 410 transitions, 5727 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:30,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:30,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:30,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:31,376 INFO L124 PetriNetUnfolderBase]: 3728/5818 cut-off events. [2024-06-28 02:51:31,376 INFO L125 PetriNetUnfolderBase]: For 299521/299541 co-relation queries the response was YES. [2024-06-28 02:51:31,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47512 conditions, 5818 events. 3728/5818 cut-off events. For 299521/299541 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 33447 event pairs, 1334 based on Foata normal form. 4/5793 useless extension candidates. Maximal degree in co-relation 47416. Up to 4925 conditions per place. [2024-06-28 02:51:31,442 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 337 selfloop transitions, 153 changer transitions 0/499 dead transitions. [2024-06-28 02:51:31,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 499 transitions, 8038 flow [2024-06-28 02:51:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:51:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:51:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-28 02:51:31,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 02:51:31,443 INFO L175 Difference]: Start difference. First operand has 221 places, 410 transitions, 5727 flow. Second operand 10 states and 190 transitions. [2024-06-28 02:51:31,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 499 transitions, 8038 flow [2024-06-28 02:51:31,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 499 transitions, 7649 flow, removed 34 selfloop flow, removed 9 redundant places. [2024-06-28 02:51:31,800 INFO L231 Difference]: Finished difference. Result has 226 places, 456 transitions, 6758 flow [2024-06-28 02:51:31,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5389, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6758, PETRI_PLACES=226, PETRI_TRANSITIONS=456} [2024-06-28 02:51:31,801 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places. [2024-06-28 02:51:31,801 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 456 transitions, 6758 flow [2024-06-28 02:51:31,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:31,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:31,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:31,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 02:51:31,802 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:31,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:31,802 INFO L85 PathProgramCache]: Analyzing trace with hash -98978988, now seen corresponding path program 8 times [2024-06-28 02:51:31,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:31,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558643273] [2024-06-28 02:51:31,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:32,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:32,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558643273] [2024-06-28 02:51:32,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558643273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:32,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:32,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030823354] [2024-06-28 02:51:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:32,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:32,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:32,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:32,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:32,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 456 transitions, 6758 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:32,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:32,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:32,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:34,270 INFO L124 PetriNetUnfolderBase]: 3705/5784 cut-off events. [2024-06-28 02:51:34,271 INFO L125 PetriNetUnfolderBase]: For 299215/299243 co-relation queries the response was YES. [2024-06-28 02:51:34,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48376 conditions, 5784 events. 3705/5784 cut-off events. For 299215/299243 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 33262 event pairs, 1044 based on Foata normal form. 12/5773 useless extension candidates. Maximal degree in co-relation 48275. Up to 4632 conditions per place. [2024-06-28 02:51:34,342 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 288 selfloop transitions, 209 changer transitions 0/506 dead transitions. [2024-06-28 02:51:34,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 506 transitions, 8221 flow [2024-06-28 02:51:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:51:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:51:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-28 02:51:34,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738095238095238 [2024-06-28 02:51:34,344 INFO L175 Difference]: Start difference. First operand has 226 places, 456 transitions, 6758 flow. Second operand 10 states and 199 transitions. [2024-06-28 02:51:34,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 506 transitions, 8221 flow [2024-06-28 02:51:34,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 506 transitions, 8079 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-28 02:51:34,827 INFO L231 Difference]: Finished difference. Result has 231 places, 459 transitions, 7146 flow [2024-06-28 02:51:34,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6617, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7146, PETRI_PLACES=231, PETRI_TRANSITIONS=459} [2024-06-28 02:51:34,827 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places. [2024-06-28 02:51:34,827 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 459 transitions, 7146 flow [2024-06-28 02:51:34,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:34,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:34,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:34,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 02:51:34,828 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-28 02:51:34,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1729851458, now seen corresponding path program 9 times [2024-06-28 02:51:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:34,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894535093] [2024-06-28 02:51:34,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:34,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:35,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:35,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894535093] [2024-06-28 02:51:35,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894535093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:35,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:35,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283685260] [2024-06-28 02:51:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:35,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:35,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:35,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:35,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:36,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:36,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 459 transitions, 7146 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:36,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:36,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:36,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:37,417 INFO L124 PetriNetUnfolderBase]: 3761/5869 cut-off events. [2024-06-28 02:51:37,417 INFO L125 PetriNetUnfolderBase]: For 319298/319341 co-relation queries the response was YES. [2024-06-28 02:51:37,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50548 conditions, 5869 events. 3761/5869 cut-off events. For 319298/319341 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 33691 event pairs, 1080 based on Foata normal form. 14/5866 useless extension candidates. Maximal degree in co-relation 50445. Up to 5276 conditions per place. [2024-06-28 02:51:37,480 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 380 selfloop transitions, 102 changer transitions 0/491 dead transitions. [2024-06-28 02:51:37,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 491 transitions, 8384 flow [2024-06-28 02:51:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:51:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:51:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-28 02:51:37,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 02:51:37,481 INFO L175 Difference]: Start difference. First operand has 231 places, 459 transitions, 7146 flow. Second operand 9 states and 171 transitions. [2024-06-28 02:51:37,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 491 transitions, 8384 flow [2024-06-28 02:51:37,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 491 transitions, 7903 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-28 02:51:37,923 INFO L231 Difference]: Finished difference. Result has 232 places, 461 transitions, 6957 flow [2024-06-28 02:51:37,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6665, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6957, PETRI_PLACES=232, PETRI_TRANSITIONS=461} [2024-06-28 02:51:37,924 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 189 predicate places. [2024-06-28 02:51:37,924 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 461 transitions, 6957 flow [2024-06-28 02:51:37,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:37,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:37,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:37,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 02:51:37,924 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-28 02:51:37,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:37,924 INFO L85 PathProgramCache]: Analyzing trace with hash 972431238, now seen corresponding path program 2 times [2024-06-28 02:51:37,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:37,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699156585] [2024-06-28 02:51:37,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:37,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:38,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:38,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699156585] [2024-06-28 02:51:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699156585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:38,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:38,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:51:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588270851] [2024-06-28 02:51:38,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:38,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:51:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:51:38,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:51:38,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:38,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 461 transitions, 6957 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-28 02:51:38,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:38,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:38,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:39,720 INFO L124 PetriNetUnfolderBase]: 3859/5959 cut-off events. [2024-06-28 02:51:39,720 INFO L125 PetriNetUnfolderBase]: For 343877/343958 co-relation queries the response was YES. [2024-06-28 02:51:39,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50843 conditions, 5959 events. 3859/5959 cut-off events. For 343877/343958 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 33575 event pairs, 1270 based on Foata normal form. 43/5960 useless extension candidates. Maximal degree in co-relation 50739. Up to 5454 conditions per place. [2024-06-28 02:51:39,783 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 359 selfloop transitions, 42 changer transitions 0/478 dead transitions. [2024-06-28 02:51:39,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 478 transitions, 7949 flow [2024-06-28 02:51:39,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:51:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:51:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-28 02:51:39,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-28 02:51:39,784 INFO L175 Difference]: Start difference. First operand has 232 places, 461 transitions, 6957 flow. Second operand 6 states and 115 transitions. [2024-06-28 02:51:39,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 478 transitions, 7949 flow [2024-06-28 02:51:40,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 478 transitions, 7685 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-28 02:51:40,188 INFO L231 Difference]: Finished difference. Result has 231 places, 464 transitions, 6830 flow [2024-06-28 02:51:40,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6693, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6830, PETRI_PLACES=231, PETRI_TRANSITIONS=464} [2024-06-28 02:51:40,189 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places. [2024-06-28 02:51:40,189 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 464 transitions, 6830 flow [2024-06-28 02:51:40,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-28 02:51:40,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:40,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:40,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 02:51:40,189 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:40,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:40,189 INFO L85 PathProgramCache]: Analyzing trace with hash -282946324, now seen corresponding path program 2 times [2024-06-28 02:51:40,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:40,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778867057] [2024-06-28 02:51:40,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:40,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:41,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:41,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778867057] [2024-06-28 02:51:41,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778867057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:41,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:41,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:51:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241522214] [2024-06-28 02:51:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:41,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:51:41,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:41,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:51:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:51:41,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:41,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 464 transitions, 6830 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:41,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:41,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:41,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:43,054 INFO L124 PetriNetUnfolderBase]: 4089/6418 cut-off events. [2024-06-28 02:51:43,054 INFO L125 PetriNetUnfolderBase]: For 400104/400143 co-relation queries the response was YES. [2024-06-28 02:51:43,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56317 conditions, 6418 events. 4089/6418 cut-off events. For 400104/400143 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 37847 event pairs, 1090 based on Foata normal form. 24/6421 useless extension candidates. Maximal degree in co-relation 56212. Up to 5067 conditions per place. [2024-06-28 02:51:43,129 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 397 selfloop transitions, 121 changer transitions 0/528 dead transitions. [2024-06-28 02:51:43,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 528 transitions, 8556 flow [2024-06-28 02:51:43,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:51:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:51:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2024-06-28 02:51:43,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742063492063492 [2024-06-28 02:51:43,131 INFO L175 Difference]: Start difference. First operand has 231 places, 464 transitions, 6830 flow. Second operand 12 states and 239 transitions. [2024-06-28 02:51:43,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 528 transitions, 8556 flow [2024-06-28 02:51:43,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 528 transitions, 8480 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-28 02:51:43,603 INFO L231 Difference]: Finished difference. Result has 240 places, 468 transitions, 7225 flow [2024-06-28 02:51:43,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6756, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7225, PETRI_PLACES=240, PETRI_TRANSITIONS=468} [2024-06-28 02:51:43,603 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places. [2024-06-28 02:51:43,603 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 468 transitions, 7225 flow [2024-06-28 02:51:43,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:43,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:43,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:43,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 02:51:43,604 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:43,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:43,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1572966830, now seen corresponding path program 1 times [2024-06-28 02:51:43,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:43,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419024048] [2024-06-28 02:51:43,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:43,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:44,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419024048] [2024-06-28 02:51:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419024048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:44,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055073929] [2024-06-28 02:51:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:44,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:44,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:44,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:44,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-28 02:51:44,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 468 transitions, 7225 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:44,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:44,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-28 02:51:44,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:46,263 INFO L124 PetriNetUnfolderBase]: 4674/7141 cut-off events. [2024-06-28 02:51:46,263 INFO L125 PetriNetUnfolderBase]: For 427115/427127 co-relation queries the response was YES. [2024-06-28 02:51:46,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62210 conditions, 7141 events. 4674/7141 cut-off events. For 427115/427127 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 40536 event pairs, 1910 based on Foata normal form. 2/7121 useless extension candidates. Maximal degree in co-relation 62104. Up to 6847 conditions per place. [2024-06-28 02:51:46,345 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 468 selfloop transitions, 26 changer transitions 0/502 dead transitions. [2024-06-28 02:51:46,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 502 transitions, 8533 flow [2024-06-28 02:51:46,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:51:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:51:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 02:51:46,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-28 02:51:46,346 INFO L175 Difference]: Start difference. First operand has 240 places, 468 transitions, 7225 flow. Second operand 8 states and 142 transitions. [2024-06-28 02:51:46,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 502 transitions, 8533 flow [2024-06-28 02:51:46,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 502 transitions, 8377 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-28 02:51:46,961 INFO L231 Difference]: Finished difference. Result has 241 places, 477 transitions, 7295 flow [2024-06-28 02:51:46,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7069, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7295, PETRI_PLACES=241, PETRI_TRANSITIONS=477} [2024-06-28 02:51:46,964 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 198 predicate places. [2024-06-28 02:51:46,964 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 477 transitions, 7295 flow [2024-06-28 02:51:46,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:46,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:46,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:46,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 02:51:46,965 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-28 02:51:46,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash -862715429, now seen corresponding path program 1 times [2024-06-28 02:51:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880772511] [2024-06-28 02:51:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:47,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:47,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880772511] [2024-06-28 02:51:47,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880772511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:47,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:47,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:51:47,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224385521] [2024-06-28 02:51:47,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:47,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:51:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:47,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:51:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:51:47,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:47,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 477 transitions, 7295 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:47,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:47,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:47,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:49,156 INFO L124 PetriNetUnfolderBase]: 4328/6698 cut-off events. [2024-06-28 02:51:49,156 INFO L125 PetriNetUnfolderBase]: For 443235/443366 co-relation queries the response was YES. [2024-06-28 02:51:49,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59529 conditions, 6698 events. 4328/6698 cut-off events. For 443235/443366 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 38779 event pairs, 1453 based on Foata normal form. 57/6698 useless extension candidates. Maximal degree in co-relation 59421. Up to 6134 conditions per place. [2024-06-28 02:51:49,251 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 377 selfloop transitions, 49 changer transitions 0/505 dead transitions. [2024-06-28 02:51:49,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 505 transitions, 8397 flow [2024-06-28 02:51:49,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:51:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:51:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-28 02:51:49,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2024-06-28 02:51:49,252 INFO L175 Difference]: Start difference. First operand has 241 places, 477 transitions, 7295 flow. Second operand 7 states and 135 transitions. [2024-06-28 02:51:49,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 505 transitions, 8397 flow [2024-06-28 02:51:49,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 505 transitions, 8302 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-28 02:51:49,937 INFO L231 Difference]: Finished difference. Result has 243 places, 486 transitions, 7408 flow [2024-06-28 02:51:49,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7200, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7408, PETRI_PLACES=243, PETRI_TRANSITIONS=486} [2024-06-28 02:51:49,938 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 200 predicate places. [2024-06-28 02:51:49,938 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 486 transitions, 7408 flow [2024-06-28 02:51:49,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:49,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:49,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:49,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 02:51:49,938 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:49,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:49,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1229420995, now seen corresponding path program 1 times [2024-06-28 02:51:49,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:49,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098176481] [2024-06-28 02:51:49,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:49,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098176481] [2024-06-28 02:51:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098176481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:51,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:51,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:51:51,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325518007] [2024-06-28 02:51:51,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:51,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:51:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:51:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:51:51,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:51,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 486 transitions, 7408 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:51,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:51,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:51,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:52,879 INFO L124 PetriNetUnfolderBase]: 4348/6839 cut-off events. [2024-06-28 02:51:52,879 INFO L125 PetriNetUnfolderBase]: For 466016/466042 co-relation queries the response was YES. [2024-06-28 02:51:52,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62204 conditions, 6839 events. 4348/6839 cut-off events. For 466016/466042 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 41123 event pairs, 1166 based on Foata normal form. 24/6843 useless extension candidates. Maximal degree in co-relation 62094. Up to 5490 conditions per place. [2024-06-28 02:51:52,962 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 359 selfloop transitions, 181 changer transitions 0/550 dead transitions. [2024-06-28 02:51:52,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 550 transitions, 9213 flow [2024-06-28 02:51:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:51:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:51:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2024-06-28 02:51:52,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48917748917748916 [2024-06-28 02:51:52,963 INFO L175 Difference]: Start difference. First operand has 243 places, 486 transitions, 7408 flow. Second operand 11 states and 226 transitions. [2024-06-28 02:51:52,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 550 transitions, 9213 flow [2024-06-28 02:51:53,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 550 transitions, 9166 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-28 02:51:53,569 INFO L231 Difference]: Finished difference. Result has 252 places, 488 transitions, 7843 flow [2024-06-28 02:51:53,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7361, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7843, PETRI_PLACES=252, PETRI_TRANSITIONS=488} [2024-06-28 02:51:53,569 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 209 predicate places. [2024-06-28 02:51:53,569 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 488 transitions, 7843 flow [2024-06-28 02:51:53,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:53,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:53,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:53,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 02:51:53,570 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:53,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash -201526380, now seen corresponding path program 9 times [2024-06-28 02:51:53,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:53,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915279480] [2024-06-28 02:51:53,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:53,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:54,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-28 02:51:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915279480] [2024-06-28 02:51:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915279480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:54,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:54,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029278994] [2024-06-28 02:51:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:54,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:54,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:54,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:54,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:54,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:54,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 488 transitions, 7843 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:54,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:54,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:54,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:56,139 INFO L124 PetriNetUnfolderBase]: 4374/6872 cut-off events. [2024-06-28 02:51:56,139 INFO L125 PetriNetUnfolderBase]: For 486700/486742 co-relation queries the response was YES. [2024-06-28 02:51:56,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63696 conditions, 6872 events. 4374/6872 cut-off events. For 486700/486742 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 41395 event pairs, 1725 based on Foata normal form. 6/6846 useless extension candidates. Maximal degree in co-relation 63583. Up to 6287 conditions per place. [2024-06-28 02:51:56,229 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 474 selfloop transitions, 46 changer transitions 0/530 dead transitions. [2024-06-28 02:51:56,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 530 transitions, 9443 flow [2024-06-28 02:51:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:51:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:51:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-28 02:51:56,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-28 02:51:56,230 INFO L175 Difference]: Start difference. First operand has 252 places, 488 transitions, 7843 flow. Second operand 10 states and 186 transitions. [2024-06-28 02:51:56,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 530 transitions, 9443 flow [2024-06-28 02:51:56,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 530 transitions, 9183 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-28 02:51:56,926 INFO L231 Difference]: Finished difference. Result has 255 places, 491 transitions, 7798 flow [2024-06-28 02:51:56,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7589, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7798, PETRI_PLACES=255, PETRI_TRANSITIONS=491} [2024-06-28 02:51:56,927 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 212 predicate places. [2024-06-28 02:51:56,927 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 491 transitions, 7798 flow [2024-06-28 02:51:56,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:56,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:51:56,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:51:56,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 02:51:56,927 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:51:56,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:51:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1740583032, now seen corresponding path program 10 times [2024-06-28 02:51:56,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:51:56,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373156020] [2024-06-28 02:51:56,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:51:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:51:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:51:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:51:57,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:51:57,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373156020] [2024-06-28 02:51:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373156020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:51:57,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:51:57,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:51:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678512559] [2024-06-28 02:51:57,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:51:57,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:51:57,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:51:57,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:51:57,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:51:58,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:51:58,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 491 transitions, 7798 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:51:58,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:51:58,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:51:58,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:51:59,757 INFO L124 PetriNetUnfolderBase]: 4396/6901 cut-off events. [2024-06-28 02:51:59,757 INFO L125 PetriNetUnfolderBase]: For 496362/496406 co-relation queries the response was YES. [2024-06-28 02:51:59,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64573 conditions, 6901 events. 4396/6901 cut-off events. For 496362/496406 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 41558 event pairs, 1727 based on Foata normal form. 4/6873 useless extension candidates. Maximal degree in co-relation 64458. Up to 6226 conditions per place. [2024-06-28 02:51:59,831 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 449 selfloop transitions, 74 changer transitions 0/533 dead transitions. [2024-06-28 02:51:59,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 533 transitions, 9433 flow [2024-06-28 02:51:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:51:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:51:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-28 02:51:59,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-28 02:51:59,832 INFO L175 Difference]: Start difference. First operand has 255 places, 491 transitions, 7798 flow. Second operand 10 states and 186 transitions. [2024-06-28 02:51:59,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 533 transitions, 9433 flow [2024-06-28 02:52:00,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 533 transitions, 9246 flow, removed 60 selfloop flow, removed 6 redundant places. [2024-06-28 02:52:00,432 INFO L231 Difference]: Finished difference. Result has 259 places, 494 transitions, 7881 flow [2024-06-28 02:52:00,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7611, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7881, PETRI_PLACES=259, PETRI_TRANSITIONS=494} [2024-06-28 02:52:00,433 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 216 predicate places. [2024-06-28 02:52:00,433 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 494 transitions, 7881 flow [2024-06-28 02:52:00,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:00,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:00,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 02:52:00,434 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-28 02:52:00,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1336314876, now seen corresponding path program 11 times [2024-06-28 02:52:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405623488] [2024-06-28 02:52:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405623488] [2024-06-28 02:52:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405623488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:01,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:01,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:52:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111458397] [2024-06-28 02:52:01,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:01,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:52:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:01,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:52:01,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:52:01,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:01,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 494 transitions, 7881 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:01,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:01,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:01,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:03,205 INFO L124 PetriNetUnfolderBase]: 4418/6936 cut-off events. [2024-06-28 02:52:03,205 INFO L125 PetriNetUnfolderBase]: For 517981/518027 co-relation queries the response was YES. [2024-06-28 02:52:03,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65477 conditions, 6936 events. 4418/6936 cut-off events. For 517981/518027 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 41834 event pairs, 1708 based on Foata normal form. 4/6908 useless extension candidates. Maximal degree in co-relation 65361. Up to 6287 conditions per place. [2024-06-28 02:52:03,293 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 458 selfloop transitions, 67 changer transitions 0/535 dead transitions. [2024-06-28 02:52:03,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 535 transitions, 9365 flow [2024-06-28 02:52:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:52:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:52:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-28 02:52:03,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 02:52:03,294 INFO L175 Difference]: Start difference. First operand has 259 places, 494 transitions, 7881 flow. Second operand 9 states and 171 transitions. [2024-06-28 02:52:03,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 535 transitions, 9365 flow [2024-06-28 02:52:03,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 535 transitions, 9123 flow, removed 50 selfloop flow, removed 8 redundant places. [2024-06-28 02:52:03,991 INFO L231 Difference]: Finished difference. Result has 260 places, 497 transitions, 7901 flow [2024-06-28 02:52:03,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7639, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7901, PETRI_PLACES=260, PETRI_TRANSITIONS=497} [2024-06-28 02:52:03,992 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 217 predicate places. [2024-06-28 02:52:03,992 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 497 transitions, 7901 flow [2024-06-28 02:52:03,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:03,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:03,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:03,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 02:52:03,992 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:52:03,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1336310226, now seen corresponding path program 12 times [2024-06-28 02:52:03,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:03,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993053641] [2024-06-28 02:52:03,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:03,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:04,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:04,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993053641] [2024-06-28 02:52:04,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993053641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:04,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:04,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:52:04,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282321093] [2024-06-28 02:52:04,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:04,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:52:04,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:04,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:52:04,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:52:05,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:05,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 497 transitions, 7901 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:05,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:05,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:05,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:06,642 INFO L124 PetriNetUnfolderBase]: 4409/6923 cut-off events. [2024-06-28 02:52:06,643 INFO L125 PetriNetUnfolderBase]: For 536292/536318 co-relation queries the response was YES. [2024-06-28 02:52:06,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65709 conditions, 6923 events. 4409/6923 cut-off events. For 536292/536318 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 41826 event pairs, 1705 based on Foata normal form. 4/6897 useless extension candidates. Maximal degree in co-relation 65592. Up to 6135 conditions per place. [2024-06-28 02:52:06,723 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 443 selfloop transitions, 85 changer transitions 0/538 dead transitions. [2024-06-28 02:52:06,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 538 transitions, 9559 flow [2024-06-28 02:52:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:52:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:52:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-28 02:52:06,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-28 02:52:06,725 INFO L175 Difference]: Start difference. First operand has 260 places, 497 transitions, 7901 flow. Second operand 9 states and 175 transitions. [2024-06-28 02:52:06,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 538 transitions, 9559 flow [2024-06-28 02:52:07,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 538 transitions, 9325 flow, removed 53 selfloop flow, removed 7 redundant places. [2024-06-28 02:52:07,530 INFO L231 Difference]: Finished difference. Result has 262 places, 500 transitions, 7969 flow [2024-06-28 02:52:07,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7667, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7969, PETRI_PLACES=262, PETRI_TRANSITIONS=500} [2024-06-28 02:52:07,530 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 219 predicate places. [2024-06-28 02:52:07,531 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 500 transitions, 7969 flow [2024-06-28 02:52:07,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:07,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:07,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:07,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 02:52:07,531 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:52:07,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1740405278, now seen corresponding path program 10 times [2024-06-28 02:52:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:07,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166921362] [2024-06-28 02:52:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:07,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:08,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:08,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166921362] [2024-06-28 02:52:08,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166921362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:08,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:08,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:52:08,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80200120] [2024-06-28 02:52:08,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:08,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:52:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:08,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:52:08,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:52:08,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:08,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 500 transitions, 7969 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:08,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:08,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:08,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:10,329 INFO L124 PetriNetUnfolderBase]: 4401/6913 cut-off events. [2024-06-28 02:52:10,330 INFO L125 PetriNetUnfolderBase]: For 551485/551511 co-relation queries the response was YES. [2024-06-28 02:52:10,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66030 conditions, 6913 events. 4401/6913 cut-off events. For 551485/551511 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 41678 event pairs, 1734 based on Foata normal form. 4/6886 useless extension candidates. Maximal degree in co-relation 65912. Up to 6480 conditions per place. [2024-06-28 02:52:10,415 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 494 selfloop transitions, 25 changer transitions 0/529 dead transitions. [2024-06-28 02:52:10,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 529 transitions, 9271 flow [2024-06-28 02:52:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:52:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:52:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-28 02:52:10,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2024-06-28 02:52:10,416 INFO L175 Difference]: Start difference. First operand has 262 places, 500 transitions, 7969 flow. Second operand 9 states and 164 transitions. [2024-06-28 02:52:10,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 529 transitions, 9271 flow [2024-06-28 02:52:11,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 529 transitions, 8993 flow, removed 56 selfloop flow, removed 7 redundant places. [2024-06-28 02:52:11,196 INFO L231 Difference]: Finished difference. Result has 264 places, 502 transitions, 7842 flow [2024-06-28 02:52:11,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7691, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7842, PETRI_PLACES=264, PETRI_TRANSITIONS=502} [2024-06-28 02:52:11,197 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 221 predicate places. [2024-06-28 02:52:11,197 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 502 transitions, 7842 flow [2024-06-28 02:52:11,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:11,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:11,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:11,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 02:52:11,197 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-28 02:52:11,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash -375737702, now seen corresponding path program 3 times [2024-06-28 02:52:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:11,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075790830] [2024-06-28 02:52:11,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:11,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:11,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075790830] [2024-06-28 02:52:11,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075790830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:11,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:11,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:52:11,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774031245] [2024-06-28 02:52:11,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:11,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:52:11,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:11,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:52:11,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:52:11,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:11,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 502 transitions, 7842 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:11,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:11,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:11,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:13,385 INFO L124 PetriNetUnfolderBase]: 4625/7154 cut-off events. [2024-06-28 02:52:13,385 INFO L125 PetriNetUnfolderBase]: For 606418/606615 co-relation queries the response was YES. [2024-06-28 02:52:13,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67915 conditions, 7154 events. 4625/7154 cut-off events. For 606418/606615 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 42270 event pairs, 2007 based on Foata normal form. 76/7129 useless extension candidates. Maximal degree in co-relation 67796. Up to 6703 conditions per place. [2024-06-28 02:52:13,469 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 418 selfloop transitions, 12 changer transitions 0/510 dead transitions. [2024-06-28 02:52:13,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 510 transitions, 8740 flow [2024-06-28 02:52:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:52:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:52:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-28 02:52:13,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-28 02:52:13,470 INFO L175 Difference]: Start difference. First operand has 264 places, 502 transitions, 7842 flow. Second operand 6 states and 106 transitions. [2024-06-28 02:52:13,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 510 transitions, 8740 flow [2024-06-28 02:52:14,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 510 transitions, 8591 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-06-28 02:52:14,177 INFO L231 Difference]: Finished difference. Result has 263 places, 502 transitions, 7723 flow [2024-06-28 02:52:14,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7693, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7723, PETRI_PLACES=263, PETRI_TRANSITIONS=502} [2024-06-28 02:52:14,178 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 220 predicate places. [2024-06-28 02:52:14,178 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 502 transitions, 7723 flow [2024-06-28 02:52:14,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:14,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:14,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:14,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 02:52:14,179 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:52:14,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1858991130, now seen corresponding path program 3 times [2024-06-28 02:52:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:14,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114315753] [2024-06-28 02:52:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:15,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-28 02:52:15,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:15,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114315753] [2024-06-28 02:52:15,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114315753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:15,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:15,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:52:15,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359573035] [2024-06-28 02:52:15,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:15,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:52:15,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:15,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:52:15,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:52:15,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:15,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 502 transitions, 7723 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:15,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:15,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:15,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:17,431 INFO L124 PetriNetUnfolderBase]: 5025/7930 cut-off events. [2024-06-28 02:52:17,431 INFO L125 PetriNetUnfolderBase]: For 691389/691419 co-relation queries the response was YES. [2024-06-28 02:52:17,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77387 conditions, 7930 events. 5025/7930 cut-off events. For 691389/691419 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 49369 event pairs, 1772 based on Foata normal form. 16/7911 useless extension candidates. Maximal degree in co-relation 77267. Up to 6335 conditions per place. [2024-06-28 02:52:17,533 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 482 selfloop transitions, 123 changer transitions 0/615 dead transitions. [2024-06-28 02:52:17,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 615 transitions, 10588 flow [2024-06-28 02:52:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:52:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:52:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 228 transitions. [2024-06-28 02:52:17,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 02:52:17,535 INFO L175 Difference]: Start difference. First operand has 263 places, 502 transitions, 7723 flow. Second operand 12 states and 228 transitions. [2024-06-28 02:52:17,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 615 transitions, 10588 flow [2024-06-28 02:52:18,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 615 transitions, 10529 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 02:52:18,504 INFO L231 Difference]: Finished difference. Result has 274 places, 550 transitions, 9083 flow [2024-06-28 02:52:18,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7664, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9083, PETRI_PLACES=274, PETRI_TRANSITIONS=550} [2024-06-28 02:52:18,504 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 231 predicate places. [2024-06-28 02:52:18,505 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 550 transitions, 9083 flow [2024-06-28 02:52:18,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:18,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:18,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:18,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 02:52:18,505 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-28 02:52:18,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:18,505 INFO L85 PathProgramCache]: Analyzing trace with hash -375968900, now seen corresponding path program 1 times [2024-06-28 02:52:18,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:18,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557166102] [2024-06-28 02:52:18,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:18,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:19,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:19,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557166102] [2024-06-28 02:52:19,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557166102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:19,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:19,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:52:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107340796] [2024-06-28 02:52:19,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:19,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:52:19,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:19,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:52:19,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:52:19,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 02:52:19,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 550 transitions, 9083 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-28 02:52:19,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:19,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 02:52:19,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:20,987 INFO L124 PetriNetUnfolderBase]: 5914/8996 cut-off events. [2024-06-28 02:52:20,987 INFO L125 PetriNetUnfolderBase]: For 740381/740381 co-relation queries the response was YES. [2024-06-28 02:52:21,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87399 conditions, 8996 events. 5914/8996 cut-off events. For 740381/740381 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 52770 event pairs, 2580 based on Foata normal form. 1/8996 useless extension candidates. Maximal degree in co-relation 87274. Up to 8868 conditions per place. [2024-06-28 02:52:21,116 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 548 selfloop transitions, 17 changer transitions 0/568 dead transitions. [2024-06-28 02:52:21,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 568 transitions, 10475 flow [2024-06-28 02:52:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:52:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:52:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-28 02:52:21,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-28 02:52:21,117 INFO L175 Difference]: Start difference. First operand has 274 places, 550 transitions, 9083 flow. Second operand 6 states and 102 transitions. [2024-06-28 02:52:21,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 568 transitions, 10475 flow [2024-06-28 02:52:22,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 568 transitions, 10322 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-28 02:52:22,298 INFO L231 Difference]: Finished difference. Result has 275 places, 556 transitions, 9068 flow [2024-06-28 02:52:22,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8930, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9068, PETRI_PLACES=275, PETRI_TRANSITIONS=556} [2024-06-28 02:52:22,298 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 232 predicate places. [2024-06-28 02:52:22,298 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 556 transitions, 9068 flow [2024-06-28 02:52:22,298 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-28 02:52:22,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:22,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:22,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 02:52:22,299 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-28 02:52:22,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:22,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1436009240, now seen corresponding path program 2 times [2024-06-28 02:52:22,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:22,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418546157] [2024-06-28 02:52:22,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:22,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:22,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:22,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418546157] [2024-06-28 02:52:22,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418546157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:22,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:22,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:52:22,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504425889] [2024-06-28 02:52:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:22,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:52:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:22,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:52:22,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:52:22,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 02:52:22,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 556 transitions, 9068 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-28 02:52:22,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:22,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 02:52:22,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:24,825 INFO L124 PetriNetUnfolderBase]: 5911/8993 cut-off events. [2024-06-28 02:52:24,825 INFO L125 PetriNetUnfolderBase]: For 748046/748049 co-relation queries the response was YES. [2024-06-28 02:52:24,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87516 conditions, 8993 events. 5911/8993 cut-off events. For 748046/748049 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 52750 event pairs, 2583 based on Foata normal form. 3/8994 useless extension candidates. Maximal degree in co-relation 87389. Up to 8865 conditions per place. [2024-06-28 02:52:24,947 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 544 selfloop transitions, 17 changer transitions 0/564 dead transitions. [2024-06-28 02:52:24,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 564 transitions, 10228 flow [2024-06-28 02:52:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:52:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:52:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-28 02:52:24,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-28 02:52:24,948 INFO L175 Difference]: Start difference. First operand has 275 places, 556 transitions, 9068 flow. Second operand 6 states and 98 transitions. [2024-06-28 02:52:24,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 564 transitions, 10228 flow [2024-06-28 02:52:26,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 564 transitions, 10147 flow, removed 36 selfloop flow, removed 2 redundant places. [2024-06-28 02:52:26,152 INFO L231 Difference]: Finished difference. Result has 279 places, 556 transitions, 9027 flow [2024-06-28 02:52:26,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8987, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9027, PETRI_PLACES=279, PETRI_TRANSITIONS=556} [2024-06-28 02:52:26,152 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 236 predicate places. [2024-06-28 02:52:26,152 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 556 transitions, 9027 flow [2024-06-28 02:52:26,152 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-28 02:52:26,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:26,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:26,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 02:52:26,153 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:52:26,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash -912860416, now seen corresponding path program 4 times [2024-06-28 02:52:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:26,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267439207] [2024-06-28 02:52:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:26,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:26,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:26,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267439207] [2024-06-28 02:52:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267439207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:26,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:26,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:52:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420433485] [2024-06-28 02:52:26,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:26,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:52:26,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:26,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:52:26,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:52:27,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:27,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 556 transitions, 9027 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:27,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:27,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:27,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:29,258 INFO L124 PetriNetUnfolderBase]: 5540/8796 cut-off events. [2024-06-28 02:52:29,258 INFO L125 PetriNetUnfolderBase]: For 838379/838409 co-relation queries the response was YES. [2024-06-28 02:52:29,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89004 conditions, 8796 events. 5540/8796 cut-off events. For 838379/838409 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 56403 event pairs, 1047 based on Foata normal form. 24/8777 useless extension candidates. Maximal degree in co-relation 88875. Up to 6425 conditions per place. [2024-06-28 02:52:29,387 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 438 selfloop transitions, 226 changer transitions 0/676 dead transitions. [2024-06-28 02:52:29,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 676 transitions, 12555 flow [2024-06-28 02:52:29,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:52:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:52:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2024-06-28 02:52:29,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742063492063492 [2024-06-28 02:52:29,388 INFO L175 Difference]: Start difference. First operand has 279 places, 556 transitions, 9027 flow. Second operand 12 states and 239 transitions. [2024-06-28 02:52:29,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 676 transitions, 12555 flow [2024-06-28 02:52:30,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 676 transitions, 12509 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 02:52:30,670 INFO L231 Difference]: Finished difference. Result has 289 places, 618 transitions, 11312 flow [2024-06-28 02:52:30,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8981, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11312, PETRI_PLACES=289, PETRI_TRANSITIONS=618} [2024-06-28 02:52:30,671 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 246 predicate places. [2024-06-28 02:52:30,671 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 618 transitions, 11312 flow [2024-06-28 02:52:30,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:30,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:30,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:30,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 02:52:30,671 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-28 02:52:30,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash -572037140, now seen corresponding path program 5 times [2024-06-28 02:52:30,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:30,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598793042] [2024-06-28 02:52:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:31,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598793042] [2024-06-28 02:52:31,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598793042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:31,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:31,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:52:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266136407] [2024-06-28 02:52:31,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:31,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:52:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:52:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:52:31,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:31,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 618 transitions, 11312 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:31,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:31,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:31,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:34,010 INFO L124 PetriNetUnfolderBase]: 5902/9382 cut-off events. [2024-06-28 02:52:34,010 INFO L125 PetriNetUnfolderBase]: For 982571/982586 co-relation queries the response was YES. [2024-06-28 02:52:34,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100390 conditions, 9382 events. 5902/9382 cut-off events. For 982571/982586 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 60823 event pairs, 1728 based on Foata normal form. 42/9378 useless extension candidates. Maximal degree in co-relation 100257. Up to 7415 conditions per place. [2024-06-28 02:52:34,357 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 450 selfloop transitions, 228 changer transitions 0/690 dead transitions. [2024-06-28 02:52:34,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 690 transitions, 13964 flow [2024-06-28 02:52:34,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:52:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:52:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 240 transitions. [2024-06-28 02:52:34,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 02:52:34,358 INFO L175 Difference]: Start difference. First operand has 289 places, 618 transitions, 11312 flow. Second operand 12 states and 240 transitions. [2024-06-28 02:52:34,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 690 transitions, 13964 flow [2024-06-28 02:52:35,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 690 transitions, 13610 flow, removed 150 selfloop flow, removed 5 redundant places. [2024-06-28 02:52:35,805 INFO L231 Difference]: Finished difference. Result has 296 places, 629 transitions, 12075 flow [2024-06-28 02:52:35,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11074, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12075, PETRI_PLACES=296, PETRI_TRANSITIONS=629} [2024-06-28 02:52:35,806 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 253 predicate places. [2024-06-28 02:52:35,806 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 629 transitions, 12075 flow [2024-06-28 02:52:35,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:35,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:35,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:35,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 02:52:35,806 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-28 02:52:35,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:35,807 INFO L85 PathProgramCache]: Analyzing trace with hash -583651910, now seen corresponding path program 6 times [2024-06-28 02:52:35,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:35,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841323672] [2024-06-28 02:52:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:35,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:36,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-28 02:52:36,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:36,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841323672] [2024-06-28 02:52:36,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841323672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:36,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:36,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:52:36,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319192618] [2024-06-28 02:52:36,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:36,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:52:36,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:36,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:52:36,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:52:36,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:36,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 629 transitions, 12075 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:36,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:36,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:36,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:39,506 INFO L124 PetriNetUnfolderBase]: 5784/9220 cut-off events. [2024-06-28 02:52:39,506 INFO L125 PetriNetUnfolderBase]: For 942924/942939 co-relation queries the response was YES. [2024-06-28 02:52:39,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95294 conditions, 9220 events. 5784/9220 cut-off events. For 942924/942939 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 59916 event pairs, 1797 based on Foata normal form. 58/9232 useless extension candidates. Maximal degree in co-relation 95159. Up to 7686 conditions per place. [2024-06-28 02:52:39,626 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 446 selfloop transitions, 223 changer transitions 0/681 dead transitions. [2024-06-28 02:52:39,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 681 transitions, 13793 flow [2024-06-28 02:52:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:52:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:52:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2024-06-28 02:52:39,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662698412698413 [2024-06-28 02:52:39,627 INFO L175 Difference]: Start difference. First operand has 296 places, 629 transitions, 12075 flow. Second operand 12 states and 235 transitions. [2024-06-28 02:52:39,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 681 transitions, 13793 flow [2024-06-28 02:52:41,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 681 transitions, 13330 flow, removed 125 selfloop flow, removed 7 redundant places. [2024-06-28 02:52:41,295 INFO L231 Difference]: Finished difference. Result has 301 places, 629 transitions, 12090 flow [2024-06-28 02:52:41,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11612, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12090, PETRI_PLACES=301, PETRI_TRANSITIONS=629} [2024-06-28 02:52:41,296 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 258 predicate places. [2024-06-28 02:52:41,296 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 629 transitions, 12090 flow [2024-06-28 02:52:41,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:41,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:41,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:41,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 02:52:41,296 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-28 02:52:41,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1414700976, now seen corresponding path program 7 times [2024-06-28 02:52:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:41,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016407418] [2024-06-28 02:52:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:42,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016407418] [2024-06-28 02:52:42,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016407418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:42,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:42,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:52:42,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969897742] [2024-06-28 02:52:42,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:42,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:52:42,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:42,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:52:42,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:52:42,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:42,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 629 transitions, 12090 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:42,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:42,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:42,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:45,003 INFO L124 PetriNetUnfolderBase]: 5910/9441 cut-off events. [2024-06-28 02:52:45,004 INFO L125 PetriNetUnfolderBase]: For 935624/935641 co-relation queries the response was YES. [2024-06-28 02:52:45,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96271 conditions, 9441 events. 5910/9441 cut-off events. For 935624/935641 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 61851 event pairs, 1946 based on Foata normal form. 62/9466 useless extension candidates. Maximal degree in co-relation 96134. Up to 8166 conditions per place. [2024-06-28 02:52:45,139 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 529 selfloop transitions, 149 changer transitions 0/690 dead transitions. [2024-06-28 02:52:45,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 690 transitions, 14152 flow [2024-06-28 02:52:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 02:52:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 02:52:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 246 transitions. [2024-06-28 02:52:45,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45054945054945056 [2024-06-28 02:52:45,140 INFO L175 Difference]: Start difference. First operand has 301 places, 629 transitions, 12090 flow. Second operand 13 states and 246 transitions. [2024-06-28 02:52:45,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 690 transitions, 14152 flow [2024-06-28 02:52:46,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 690 transitions, 13705 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-28 02:52:46,960 INFO L231 Difference]: Finished difference. Result has 304 places, 636 transitions, 12367 flow [2024-06-28 02:52:46,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11651, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12367, PETRI_PLACES=304, PETRI_TRANSITIONS=636} [2024-06-28 02:52:46,961 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 261 predicate places. [2024-06-28 02:52:46,961 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 636 transitions, 12367 flow [2024-06-28 02:52:46,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:46,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:46,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:46,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 02:52:46,961 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-28 02:52:46,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:46,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1414697256, now seen corresponding path program 8 times [2024-06-28 02:52:46,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:46,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636082196] [2024-06-28 02:52:46,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:48,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:48,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636082196] [2024-06-28 02:52:48,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636082196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:48,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:48,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:52:48,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127852286] [2024-06-28 02:52:48,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:48,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:52:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:48,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:52:48,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:52:48,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:48,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 636 transitions, 12367 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:48,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:48,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:48,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:50,736 INFO L124 PetriNetUnfolderBase]: 5828/9316 cut-off events. [2024-06-28 02:52:50,737 INFO L125 PetriNetUnfolderBase]: For 869836/869853 co-relation queries the response was YES. [2024-06-28 02:52:50,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93018 conditions, 9316 events. 5828/9316 cut-off events. For 869836/869853 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 60898 event pairs, 1788 based on Foata normal form. 46/9325 useless extension candidates. Maximal degree in co-relation 92880. Up to 7669 conditions per place. [2024-06-28 02:52:50,884 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 528 selfloop transitions, 155 changer transitions 0/695 dead transitions. [2024-06-28 02:52:50,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 695 transitions, 14142 flow [2024-06-28 02:52:50,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:52:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:52:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 234 transitions. [2024-06-28 02:52:50,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-28 02:52:50,885 INFO L175 Difference]: Start difference. First operand has 304 places, 636 transitions, 12367 flow. Second operand 12 states and 234 transitions. [2024-06-28 02:52:50,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 695 transitions, 14142 flow [2024-06-28 02:52:52,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 695 transitions, 13716 flow, removed 80 selfloop flow, removed 11 redundant places. [2024-06-28 02:52:52,871 INFO L231 Difference]: Finished difference. Result has 305 places, 636 transitions, 12268 flow [2024-06-28 02:52:52,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11941, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12268, PETRI_PLACES=305, PETRI_TRANSITIONS=636} [2024-06-28 02:52:52,872 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 262 predicate places. [2024-06-28 02:52:52,872 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 636 transitions, 12268 flow [2024-06-28 02:52:52,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:52,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:52,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:52,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 02:52:52,872 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:52:52,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1840770280, now seen corresponding path program 9 times [2024-06-28 02:52:52,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:52,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611346232] [2024-06-28 02:52:52,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:52,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:52:53,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:53,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611346232] [2024-06-28 02:52:53,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611346232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:53,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:53,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:52:53,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141387359] [2024-06-28 02:52:53,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:53,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:52:53,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:53,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:52:53,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:52:54,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:54,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 636 transitions, 12268 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:54,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:54,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:54,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:52:56,604 INFO L124 PetriNetUnfolderBase]: 5922/9486 cut-off events. [2024-06-28 02:52:56,604 INFO L125 PetriNetUnfolderBase]: For 851926/851945 co-relation queries the response was YES. [2024-06-28 02:52:56,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94045 conditions, 9486 events. 5922/9486 cut-off events. For 851926/851945 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 62475 event pairs, 1845 based on Foata normal form. 26/9485 useless extension candidates. Maximal degree in co-relation 93906. Up to 8174 conditions per place. [2024-06-28 02:52:56,753 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 494 selfloop transitions, 192 changer transitions 0/698 dead transitions. [2024-06-28 02:52:56,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 698 transitions, 14191 flow [2024-06-28 02:52:56,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:52:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:52:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2024-06-28 02:52:56,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2024-06-28 02:52:56,754 INFO L175 Difference]: Start difference. First operand has 305 places, 636 transitions, 12268 flow. Second operand 11 states and 222 transitions. [2024-06-28 02:52:56,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 698 transitions, 14191 flow [2024-06-28 02:52:58,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 698 transitions, 13688 flow, removed 69 selfloop flow, removed 11 redundant places. [2024-06-28 02:52:58,756 INFO L231 Difference]: Finished difference. Result has 305 places, 640 transitions, 12227 flow [2024-06-28 02:52:58,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11765, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12227, PETRI_PLACES=305, PETRI_TRANSITIONS=640} [2024-06-28 02:52:58,756 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 262 predicate places. [2024-06-28 02:52:58,756 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 640 transitions, 12227 flow [2024-06-28 02:52:58,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:58,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:52:58,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:52:58,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-28 02:52:58,757 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:52:58,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:52:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash 780595910, now seen corresponding path program 10 times [2024-06-28 02:52:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:52:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487808813] [2024-06-28 02:52:58,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:52:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:52:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:52:59,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-28 02:52:59,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:52:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487808813] [2024-06-28 02:52:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487808813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:52:59,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:52:59,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:52:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479148852] [2024-06-28 02:52:59,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:52:59,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:52:59,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:52:59,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:52:59,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:52:59,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:52:59,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 640 transitions, 12227 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:52:59,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:52:59,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:52:59,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:53:02,700 INFO L124 PetriNetUnfolderBase]: 6055/9709 cut-off events. [2024-06-28 02:53:02,700 INFO L125 PetriNetUnfolderBase]: For 900775/900794 co-relation queries the response was YES. [2024-06-28 02:53:02,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96081 conditions, 9709 events. 6055/9709 cut-off events. For 900775/900794 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 64324 event pairs, 1880 based on Foata normal form. 42/9724 useless extension candidates. Maximal degree in co-relation 95941. Up to 8376 conditions per place. [2024-06-28 02:53:02,822 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 505 selfloop transitions, 184 changer transitions 0/701 dead transitions. [2024-06-28 02:53:02,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 701 transitions, 14227 flow [2024-06-28 02:53:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:53:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:53:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2024-06-28 02:53:02,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2024-06-28 02:53:02,823 INFO L175 Difference]: Start difference. First operand has 305 places, 640 transitions, 12227 flow. Second operand 11 states and 222 transitions. [2024-06-28 02:53:02,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 701 transitions, 14227 flow [2024-06-28 02:53:04,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 701 transitions, 13853 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-28 02:53:04,330 INFO L231 Difference]: Finished difference. Result has 309 places, 642 transitions, 12357 flow [2024-06-28 02:53:04,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11853, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12357, PETRI_PLACES=309, PETRI_TRANSITIONS=642} [2024-06-28 02:53:04,330 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 266 predicate places. [2024-06-28 02:53:04,331 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 642 transitions, 12357 flow [2024-06-28 02:53:04,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:04,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:53:04,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:53:04,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-28 02:53:04,331 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:53:04,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:53:04,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1835048269, now seen corresponding path program 1 times [2024-06-28 02:53:04,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:53:04,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923561558] [2024-06-28 02:53:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:53:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:53:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:53:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:53:05,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:53:05,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923561558] [2024-06-28 02:53:05,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923561558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:53:05,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:53:05,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:53:05,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150548711] [2024-06-28 02:53:05,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:53:05,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:53:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:53:05,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:53:05,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:53:05,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-28 02:53:05,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 642 transitions, 12357 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:05,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:53:05,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-28 02:53:05,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:53:08,422 INFO L124 PetriNetUnfolderBase]: 7088/10966 cut-off events. [2024-06-28 02:53:08,423 INFO L125 PetriNetUnfolderBase]: For 931927/931945 co-relation queries the response was YES. [2024-06-28 02:53:08,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105994 conditions, 10966 events. 7088/10966 cut-off events. For 931927/931945 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 68814 event pairs, 2462 based on Foata normal form. 6/10932 useless extension candidates. Maximal degree in co-relation 105853. Up to 10451 conditions per place. [2024-06-28 02:53:08,574 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 606 selfloop transitions, 88 changer transitions 0/704 dead transitions. [2024-06-28 02:53:08,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 704 transitions, 14340 flow [2024-06-28 02:53:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:53:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:53:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-28 02:53:08,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-28 02:53:08,575 INFO L175 Difference]: Start difference. First operand has 309 places, 642 transitions, 12357 flow. Second operand 10 states and 188 transitions. [2024-06-28 02:53:08,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 704 transitions, 14340 flow [2024-06-28 02:53:10,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 704 transitions, 13901 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-28 02:53:10,792 INFO L231 Difference]: Finished difference. Result has 311 places, 666 transitions, 12511 flow [2024-06-28 02:53:10,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11932, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12511, PETRI_PLACES=311, PETRI_TRANSITIONS=666} [2024-06-28 02:53:10,793 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 268 predicate places. [2024-06-28 02:53:10,793 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 666 transitions, 12511 flow [2024-06-28 02:53:10,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:10,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:53:10,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:53:10,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-28 02:53:10,793 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:53:10,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:53:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1835263750, now seen corresponding path program 11 times [2024-06-28 02:53:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:53:10,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939299562] [2024-06-28 02:53:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:53:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:53:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:53:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:53:11,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:53:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939299562] [2024-06-28 02:53:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939299562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:53:11,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:53:11,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:53:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972579252] [2024-06-28 02:53:11,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:53:11,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:53:11,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:53:11,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:53:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:53:12,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:53:12,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 666 transitions, 12511 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:12,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:53:12,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:53:12,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:53:14,813 INFO L124 PetriNetUnfolderBase]: 6140/9847 cut-off events. [2024-06-28 02:53:14,813 INFO L125 PetriNetUnfolderBase]: For 920913/920940 co-relation queries the response was YES. [2024-06-28 02:53:14,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96899 conditions, 9847 events. 6140/9847 cut-off events. For 920913/920940 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 65467 event pairs, 1916 based on Foata normal form. 44/9856 useless extension candidates. Maximal degree in co-relation 96755. Up to 8463 conditions per place. [2024-06-28 02:53:14,959 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 510 selfloop transitions, 200 changer transitions 0/723 dead transitions. [2024-06-28 02:53:14,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 723 transitions, 14509 flow [2024-06-28 02:53:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:53:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:53:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-28 02:53:14,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 02:53:14,961 INFO L175 Difference]: Start difference. First operand has 311 places, 666 transitions, 12511 flow. Second operand 11 states and 220 transitions. [2024-06-28 02:53:14,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 723 transitions, 14509 flow [2024-06-28 02:53:17,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 723 transitions, 14014 flow, removed 73 selfloop flow, removed 9 redundant places. [2024-06-28 02:53:17,632 INFO L231 Difference]: Finished difference. Result has 313 places, 667 transitions, 12518 flow [2024-06-28 02:53:17,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12028, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12518, PETRI_PLACES=313, PETRI_TRANSITIONS=667} [2024-06-28 02:53:17,633 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 270 predicate places. [2024-06-28 02:53:17,633 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 667 transitions, 12518 flow [2024-06-28 02:53:17,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:17,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:53:17,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:53:17,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-28 02:53:17,633 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:53:17,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:53:17,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1860868800, now seen corresponding path program 12 times [2024-06-28 02:53:17,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:53:17,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647407669] [2024-06-28 02:53:17,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:53:17,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:53:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:53:18,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-28 02:53:18,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:53:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647407669] [2024-06-28 02:53:18,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647407669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:53:18,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:53:18,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:53:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541824559] [2024-06-28 02:53:18,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:53:18,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:53:18,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:53:18,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:53:18,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:53:19,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:53:19,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 667 transitions, 12518 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:19,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:53:19,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:53:19,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:53:22,219 INFO L124 PetriNetUnfolderBase]: 6873/11084 cut-off events. [2024-06-28 02:53:22,219 INFO L125 PetriNetUnfolderBase]: For 1027357/1027387 co-relation queries the response was YES. [2024-06-28 02:53:22,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108617 conditions, 11084 events. 6873/11084 cut-off events. For 1027357/1027387 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 76170 event pairs, 2092 based on Foata normal form. 44/11081 useless extension candidates. Maximal degree in co-relation 108475. Up to 8911 conditions per place. [2024-06-28 02:53:22,370 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 470 selfloop transitions, 294 changer transitions 0/777 dead transitions. [2024-06-28 02:53:22,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 777 transitions, 16028 flow [2024-06-28 02:53:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:53:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:53:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-06-28 02:53:22,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-06-28 02:53:22,371 INFO L175 Difference]: Start difference. First operand has 313 places, 667 transitions, 12518 flow. Second operand 11 states and 216 transitions. [2024-06-28 02:53:22,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 777 transitions, 16028 flow [2024-06-28 02:53:24,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 777 transitions, 15576 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-06-28 02:53:24,808 INFO L231 Difference]: Finished difference. Result has 315 places, 726 transitions, 14353 flow [2024-06-28 02:53:24,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12082, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14353, PETRI_PLACES=315, PETRI_TRANSITIONS=726} [2024-06-28 02:53:24,809 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 272 predicate places. [2024-06-28 02:53:24,809 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 726 transitions, 14353 flow [2024-06-28 02:53:24,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:24,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:53:24,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:53:24,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-28 02:53:24,809 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:53:24,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:53:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash 980414452, now seen corresponding path program 13 times [2024-06-28 02:53:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:53:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993658992] [2024-06-28 02:53:24,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:53:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:53:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:53:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:53:26,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:53:26,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993658992] [2024-06-28 02:53:26,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993658992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:53:26,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:53:26,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:53:26,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20415477] [2024-06-28 02:53:26,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:53:26,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:53:26,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:53:26,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:53:26,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:53:26,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:53:26,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 726 transitions, 14353 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:26,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:53:26,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:53:26,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:53:29,654 INFO L124 PetriNetUnfolderBase]: 7010/11265 cut-off events. [2024-06-28 02:53:29,654 INFO L125 PetriNetUnfolderBase]: For 1048268/1048296 co-relation queries the response was YES. [2024-06-28 02:53:29,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111555 conditions, 11265 events. 7010/11265 cut-off events. For 1048268/1048296 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 77171 event pairs, 1803 based on Foata normal form. 38/11254 useless extension candidates. Maximal degree in co-relation 111412. Up to 7146 conditions per place. [2024-06-28 02:53:29,816 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 432 selfloop transitions, 344 changer transitions 0/789 dead transitions. [2024-06-28 02:53:29,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 789 transitions, 16886 flow [2024-06-28 02:53:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:53:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:53:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-28 02:53:29,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 02:53:29,817 INFO L175 Difference]: Start difference. First operand has 315 places, 726 transitions, 14353 flow. Second operand 11 states and 220 transitions. [2024-06-28 02:53:29,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 789 transitions, 16886 flow [2024-06-28 02:53:32,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 789 transitions, 16375 flow, removed 82 selfloop flow, removed 7 redundant places. [2024-06-28 02:53:32,090 INFO L231 Difference]: Finished difference. Result has 319 places, 731 transitions, 14865 flow [2024-06-28 02:53:32,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13842, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14865, PETRI_PLACES=319, PETRI_TRANSITIONS=731} [2024-06-28 02:53:32,090 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 276 predicate places. [2024-06-28 02:53:32,091 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 731 transitions, 14865 flow [2024-06-28 02:53:32,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:32,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:53:32,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:53:32,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-28 02:53:32,091 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:53:32,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:53:32,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1947560610, now seen corresponding path program 14 times [2024-06-28 02:53:32,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:53:32,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16031374] [2024-06-28 02:53:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:53:32,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:53:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:53:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:53:33,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:53:33,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16031374] [2024-06-28 02:53:33,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16031374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:53:33,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:53:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:53:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006482482] [2024-06-28 02:53:33,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:53:33,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:53:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:53:33,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:53:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:53:33,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:53:33,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 731 transitions, 14865 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:33,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:53:33,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:53:33,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:53:37,464 INFO L124 PetriNetUnfolderBase]: 7764/12525 cut-off events. [2024-06-28 02:53:37,464 INFO L125 PetriNetUnfolderBase]: For 1158670/1158694 co-relation queries the response was YES. [2024-06-28 02:53:37,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124208 conditions, 12525 events. 7764/12525 cut-off events. For 1158670/1158694 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 88606 event pairs, 2508 based on Foata normal form. 40/12517 useless extension candidates. Maximal degree in co-relation 124064. Up to 10529 conditions per place. [2024-06-28 02:53:37,654 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 592 selfloop transitions, 242 changer transitions 0/847 dead transitions. [2024-06-28 02:53:37,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 847 transitions, 18882 flow [2024-06-28 02:53:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:53:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:53:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-28 02:53:37,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-28 02:53:37,655 INFO L175 Difference]: Start difference. First operand has 319 places, 731 transitions, 14865 flow. Second operand 10 states and 195 transitions. [2024-06-28 02:53:37,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 847 transitions, 18882 flow [2024-06-28 02:53:40,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 847 transitions, 18104 flow, removed 79 selfloop flow, removed 10 redundant places. [2024-06-28 02:53:40,102 INFO L231 Difference]: Finished difference. Result has 319 places, 800 transitions, 16648 flow [2024-06-28 02:53:40,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14176, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16648, PETRI_PLACES=319, PETRI_TRANSITIONS=800} [2024-06-28 02:53:40,103 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 276 predicate places. [2024-06-28 02:53:40,103 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 800 transitions, 16648 flow [2024-06-28 02:53:40,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:40,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:53:40,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:53:40,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-28 02:53:40,104 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:53:40,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:53:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1067254132, now seen corresponding path program 15 times [2024-06-28 02:53:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:53:40,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927884429] [2024-06-28 02:53:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:53:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:53:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:53:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:53:41,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:53:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927884429] [2024-06-28 02:53:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927884429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:53:41,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:53:41,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:53:41,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312778114] [2024-06-28 02:53:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:53:41,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:53:41,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:53:41,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:53:41,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:53:41,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:53:41,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 800 transitions, 16648 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:41,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:53:41,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:53:41,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:53:45,145 INFO L124 PetriNetUnfolderBase]: 7677/12372 cut-off events. [2024-06-28 02:53:45,145 INFO L125 PetriNetUnfolderBase]: For 1046298/1046320 co-relation queries the response was YES. [2024-06-28 02:53:45,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118631 conditions, 12372 events. 7677/12372 cut-off events. For 1046298/1046320 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 87355 event pairs, 2530 based on Foata normal form. 46/12368 useless extension candidates. Maximal degree in co-relation 118488. Up to 10410 conditions per place. [2024-06-28 02:53:45,482 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 660 selfloop transitions, 172 changer transitions 0/845 dead transitions. [2024-06-28 02:53:45,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 845 transitions, 18663 flow [2024-06-28 02:53:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:53:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:53:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-28 02:53:45,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595238095238095 [2024-06-28 02:53:45,484 INFO L175 Difference]: Start difference. First operand has 319 places, 800 transitions, 16648 flow. Second operand 10 states and 193 transitions. [2024-06-28 02:53:45,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 845 transitions, 18663 flow [2024-06-28 02:53:48,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 845 transitions, 17266 flow, removed 473 selfloop flow, removed 7 redundant places. [2024-06-28 02:53:48,468 INFO L231 Difference]: Finished difference. Result has 322 places, 800 transitions, 15658 flow [2024-06-28 02:53:48,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=15251, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15658, PETRI_PLACES=322, PETRI_TRANSITIONS=800} [2024-06-28 02:53:48,469 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 279 predicate places. [2024-06-28 02:53:48,469 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 800 transitions, 15658 flow [2024-06-28 02:53:48,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:48,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:53:48,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:53:48,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-28 02:53:48,470 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:53:48,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:53:48,470 INFO L85 PathProgramCache]: Analyzing trace with hash 346168956, now seen corresponding path program 16 times [2024-06-28 02:53:48,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:53:48,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133482981] [2024-06-28 02:53:48,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:53:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:53:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:53:49,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-28 02:53:49,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:53:49,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133482981] [2024-06-28 02:53:49,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133482981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:53:49,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:53:49,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:53:49,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661372256] [2024-06-28 02:53:49,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:53:49,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:53:49,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:53:49,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:53:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:53:49,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:53:49,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 800 transitions, 15658 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:49,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:53:49,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:53:49,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:53:53,340 INFO L124 PetriNetUnfolderBase]: 7711/12467 cut-off events. [2024-06-28 02:53:53,340 INFO L125 PetriNetUnfolderBase]: For 951790/951818 co-relation queries the response was YES. [2024-06-28 02:53:53,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115817 conditions, 12467 events. 7711/12467 cut-off events. For 951790/951818 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 88739 event pairs, 2298 based on Foata normal form. 26/12464 useless extension candidates. Maximal degree in co-relation 115673. Up to 10672 conditions per place. [2024-06-28 02:53:53,657 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 595 selfloop transitions, 248 changer transitions 0/856 dead transitions. [2024-06-28 02:53:53,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 856 transitions, 18150 flow [2024-06-28 02:53:53,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:53:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:53:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions. [2024-06-28 02:53:53,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 02:53:53,658 INFO L175 Difference]: Start difference. First operand has 322 places, 800 transitions, 15658 flow. Second operand 10 states and 204 transitions. [2024-06-28 02:53:53,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 856 transitions, 18150 flow [2024-06-28 02:53:56,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 856 transitions, 17355 flow, removed 43 selfloop flow, removed 10 redundant places. [2024-06-28 02:53:56,028 INFO L231 Difference]: Finished difference. Result has 322 places, 804 transitions, 15467 flow [2024-06-28 02:53:56,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14863, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15467, PETRI_PLACES=322, PETRI_TRANSITIONS=804} [2024-06-28 02:53:56,029 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 279 predicate places. [2024-06-28 02:53:56,029 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 804 transitions, 15467 flow [2024-06-28 02:53:56,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:56,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:53:56,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:53:56,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-28 02:53:56,029 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:53:56,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:53:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1226615864, now seen corresponding path program 17 times [2024-06-28 02:53:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:53:56,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492813760] [2024-06-28 02:53:56,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:53:56,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:53:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:53:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:53:57,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:53:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492813760] [2024-06-28 02:53:57,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492813760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:53:57,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:53:57,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:53:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777190258] [2024-06-28 02:53:57,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:53:57,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:53:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:53:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:53:57,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:53:57,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:53:57,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 804 transitions, 15467 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:53:57,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:53:57,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:53:57,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:54:01,133 INFO L124 PetriNetUnfolderBase]: 7930/12823 cut-off events. [2024-06-28 02:54:01,133 INFO L125 PetriNetUnfolderBase]: For 1034996/1035024 co-relation queries the response was YES. [2024-06-28 02:54:01,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121244 conditions, 12823 events. 7930/12823 cut-off events. For 1034996/1035024 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 91672 event pairs, 2292 based on Foata normal form. 22/12817 useless extension candidates. Maximal degree in co-relation 121099. Up to 10163 conditions per place. [2024-06-28 02:54:01,483 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 599 selfloop transitions, 250 changer transitions 0/862 dead transitions. [2024-06-28 02:54:01,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 862 transitions, 18089 flow [2024-06-28 02:54:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:54:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:54:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions. [2024-06-28 02:54:01,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2024-06-28 02:54:01,485 INFO L175 Difference]: Start difference. First operand has 322 places, 804 transitions, 15467 flow. Second operand 10 states and 206 transitions. [2024-06-28 02:54:01,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 862 transitions, 18089 flow [2024-06-28 02:54:03,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 862 transitions, 17594 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-28 02:54:03,922 INFO L231 Difference]: Finished difference. Result has 325 places, 806 transitions, 15646 flow [2024-06-28 02:54:03,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=14976, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15646, PETRI_PLACES=325, PETRI_TRANSITIONS=806} [2024-06-28 02:54:03,923 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 282 predicate places. [2024-06-28 02:54:03,923 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 806 transitions, 15646 flow [2024-06-28 02:54:03,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:54:03,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:54:03,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:54:03,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-28 02:54:03,923 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:54:03,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:54:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2085638736, now seen corresponding path program 18 times [2024-06-28 02:54:03,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:54:03,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56796091] [2024-06-28 02:54:03,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:54:03,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:54:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:54:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:54:05,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:54:05,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56796091] [2024-06-28 02:54:05,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56796091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:54:05,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:54:05,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:54:05,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581881628] [2024-06-28 02:54:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:54:05,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:54:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:54:05,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:54:05,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:54:05,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 02:54:05,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 806 transitions, 15646 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:54:05,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:54:05,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 02:54:05,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:54:09,052 INFO L124 PetriNetUnfolderBase]: 8005/12950 cut-off events. [2024-06-28 02:54:09,052 INFO L125 PetriNetUnfolderBase]: For 1051614/1051642 co-relation queries the response was YES. [2024-06-28 02:54:09,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122673 conditions, 12950 events. 8005/12950 cut-off events. For 1051614/1051642 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 92931 event pairs, 2391 based on Foata normal form. 26/12947 useless extension candidates. Maximal degree in co-relation 122528. Up to 11287 conditions per place. [2024-06-28 02:54:09,222 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 616 selfloop transitions, 232 changer transitions 0/861 dead transitions. [2024-06-28 02:54:09,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 861 transitions, 18164 flow [2024-06-28 02:54:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:54:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:54:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-28 02:54:09,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-28 02:54:09,224 INFO L175 Difference]: Start difference. First operand has 325 places, 806 transitions, 15646 flow. Second operand 10 states and 203 transitions. [2024-06-28 02:54:09,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 861 transitions, 18164 flow [2024-06-28 02:54:11,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 861 transitions, 17806 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-28 02:54:11,944 INFO L231 Difference]: Finished difference. Result has 328 places, 807 transitions, 15850 flow [2024-06-28 02:54:11,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=15302, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15850, PETRI_PLACES=328, PETRI_TRANSITIONS=807} [2024-06-28 02:54:11,945 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 285 predicate places. [2024-06-28 02:54:11,945 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 807 transitions, 15850 flow [2024-06-28 02:54:11,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:54:11,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:54:11,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:54:11,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-28 02:54:11,946 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:54:11,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:54:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2080276356, now seen corresponding path program 19 times [2024-06-28 02:54:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:54:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527247731] [2024-06-28 02:54:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:54:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:54:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat