./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix001.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/mix001.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix001.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 23:05:28,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:05:28,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:05:28,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:05:28,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:05:28,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:05:28,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:05:28,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:05:28,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:05:28,840 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:05:28,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:05:28,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:05:28,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:05:28,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:05:28,842 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:05:28,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:05:28,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:05:28,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:05:28,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:05:28,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:05:28,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:05:28,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:05:28,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:05:28,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:05:28,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:05:28,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:05:28,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:05:28,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:05:28,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:05:28,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:05:28,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:05:28,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:05:28,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:05:28,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:05:28,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:05:28,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:05:28,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:05:28,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:05:28,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:05:28,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:05:28,848 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:05:28,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:05:28,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:05:28,849 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-27 23:05:29,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:05:29,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:05:29,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:05:29,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:05:29,086 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:05:29,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2024-06-27 23:05:30,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:05:30,298 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:05:30,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2024-06-27 23:05:30,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68bdedb7f/ce46ecd7266e4a769e87c19002542aff/FLAGa92eba0cd [2024-06-27 23:05:30,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68bdedb7f/ce46ecd7266e4a769e87c19002542aff [2024-06-27 23:05:30,328 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:05:30,329 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:05:30,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix001.oepc.yml/witness.yml [2024-06-27 23:05:30,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:05:30,395 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:05:30,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:05:30,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:05:30,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:05:30,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:05:30" (1/2) ... [2024-06-27 23:05:30,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be92b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:30, skipping insertion in model container [2024-06-27 23:05:30,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:05:30" (1/2) ... [2024-06-27 23:05:30,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1929d4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:30, skipping insertion in model container [2024-06-27 23:05:30,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:05:30" (2/2) ... [2024-06-27 23:05:30,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be92b2e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30, skipping insertion in model container [2024-06-27 23:05:30,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:05:30" (2/2) ... [2024-06-27 23:05:30,405 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:05:30,430 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:05:30,431 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 23:05:30,432 INFO L97 edCorrectnessWitness]: Location invariant before [L867-L867] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 23:05:30,432 INFO L97 edCorrectnessWitness]: Location invariant before [L870-L870] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 23:05:30,432 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:05:30,432 INFO L106 edCorrectnessWitness]: ghost_update [L865-L865] multithreaded = 1; [2024-06-27 23:05:30,472 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:05:30,786 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:05:30,794 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 23:05:30,946 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:05:30,982 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:05:30,983 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30 WrapperNode [2024-06-27 23:05:30,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:05:30,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:05:30,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:05:30,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:05:30,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,045 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-06-27 23:05:31,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:05:31,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:05:31,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:05:31,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:05:31,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,077 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 23:05:31,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:05:31,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:05:31,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:05:31,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:05:31,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (1/1) ... [2024-06-27 23:05:31,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:05:31,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:05:31,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 23:05:31,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 23:05:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:05:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:05:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:05:31,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:05:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:05:31,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:05:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:05:31,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:05:31,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:05:31,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:05:31,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:05:31,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:05:31,179 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 23:05:31,291 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:05:31,293 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:05:31,623 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:05:31,623 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:05:31,773 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:05:31,773 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:05:31,774 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:05:31 BoogieIcfgContainer [2024-06-27 23:05:31,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:05:31,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:05:31,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:05:31,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:05:31,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:05:30" (1/4) ... [2024-06-27 23:05:31,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c46a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:05:31, skipping insertion in model container [2024-06-27 23:05:31,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:05:30" (2/4) ... [2024-06-27 23:05:31,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c46a10 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:05:31, skipping insertion in model container [2024-06-27 23:05:31,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:30" (3/4) ... [2024-06-27 23:05:31,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c46a10 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:05:31, skipping insertion in model container [2024-06-27 23:05:31,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:05:31" (4/4) ... [2024-06-27 23:05:31,783 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2024-06-27 23:05:31,795 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:05:31,796 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 23:05:31,796 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:05:31,879 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:05:31,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow [2024-06-27 23:05:31,937 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-06-27 23:05:31,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:05:31,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:05:31,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow [2024-06-27 23:05:31,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2024-06-27 23:05:31,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:05:31,960 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;@4e25a2f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:05:31,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 23:05:31,965 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:05:31,965 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 23:05:31,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:05:31,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:31,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:05:31,966 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:31,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:31,994 INFO L85 PathProgramCache]: Analyzing trace with hash 421617153, now seen corresponding path program 1 times [2024-06-27 23:05:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:32,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530533079] [2024-06-27 23:05:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:32,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:33,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:33,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530533079] [2024-06-27 23:05:33,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530533079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:33,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:33,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:05:33,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259813632] [2024-06-27 23:05:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:33,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:05:33,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:33,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:05:33,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:05:33,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 23:05:33,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:33,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:33,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 23:05:33,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:33,499 INFO L124 PetriNetUnfolderBase]: 1363/2133 cut-off events. [2024-06-27 23:05:33,500 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-06-27 23:05:33,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4257 conditions, 2133 events. 1363/2133 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10767 event pairs, 964 based on Foata normal form. 1/2077 useless extension candidates. Maximal degree in co-relation 4245. Up to 2037 conditions per place. [2024-06-27 23:05:33,517 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-27 23:05:33,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 175 flow [2024-06-27 23:05:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:05:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:05:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-06-27 23:05:33,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2024-06-27 23:05:33,529 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 81 transitions. [2024-06-27 23:05:33,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 175 flow [2024-06-27 23:05:33,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 23:05:33,535 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow [2024-06-27 23:05:33,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-27 23:05:33,540 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-06-27 23:05:33,540 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow [2024-06-27 23:05:33,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:33,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:33,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:33,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:05:33,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:33,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1447404018, now seen corresponding path program 1 times [2024-06-27 23:05:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:33,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735361441] [2024-06-27 23:05:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:33,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:34,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:34,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735361441] [2024-06-27 23:05:34,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735361441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:34,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:34,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:05:34,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891797424] [2024-06-27 23:05:34,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:34,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:05:34,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:34,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:05:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:05:34,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 23:05:34,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 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-27 23:05:34,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:34,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 23:05:34,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:34,686 INFO L124 PetriNetUnfolderBase]: 1357/2134 cut-off events. [2024-06-27 23:05:34,687 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2024-06-27 23:05:34,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 2134 events. 1357/2134 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10886 event pairs, 840 based on Foata normal form. 3/2120 useless extension candidates. Maximal degree in co-relation 4789. Up to 2013 conditions per place. [2024-06-27 23:05:34,697 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 39 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-06-27 23:05:34,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 242 flow [2024-06-27 23:05:34,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:05:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:05:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-06-27 23:05:34,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2024-06-27 23:05:34,699 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 105 transitions. [2024-06-27 23:05:34,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 242 flow [2024-06-27 23:05:34,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:05:34,701 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow [2024-06-27 23:05:34,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-06-27 23:05:34,702 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2024-06-27 23:05:34,702 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow [2024-06-27 23:05:34,702 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-27 23:05:34,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:34,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:34,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:05:34,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:34,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:34,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1919853034, now seen corresponding path program 1 times [2024-06-27 23:05:34,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:34,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286822890] [2024-06-27 23:05:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:35,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:35,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286822890] [2024-06-27 23:05:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286822890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:35,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:35,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:05:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532924528] [2024-06-27 23:05:35,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:35,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:05:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:05:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:05:35,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 23:05:35,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:35,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:35,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 23:05:35,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:36,264 INFO L124 PetriNetUnfolderBase]: 1345/2138 cut-off events. [2024-06-27 23:05:36,264 INFO L125 PetriNetUnfolderBase]: For 1162/1162 co-relation queries the response was YES. [2024-06-27 23:05:36,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5310 conditions, 2138 events. 1345/2138 cut-off events. For 1162/1162 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11001 event pairs, 592 based on Foata normal form. 6/2124 useless extension candidates. Maximal degree in co-relation 5296. Up to 1965 conditions per place. [2024-06-27 23:05:36,274 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 47 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2024-06-27 23:05:36,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 324 flow [2024-06-27 23:05:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:05:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:05:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-06-27 23:05:36,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2024-06-27 23:05:36,280 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 130 transitions. [2024-06-27 23:05:36,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 324 flow [2024-06-27 23:05:36,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 310 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 23:05:36,284 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 176 flow [2024-06-27 23:05:36,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-06-27 23:05:36,285 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2024-06-27 23:05:36,285 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 176 flow [2024-06-27 23:05:36,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:36,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:36,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:36,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:05:36,286 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:36,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:36,287 INFO L85 PathProgramCache]: Analyzing trace with hash -143902164, now seen corresponding path program 1 times [2024-06-27 23:05:36,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:36,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481440382] [2024-06-27 23:05:36,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:36,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:37,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481440382] [2024-06-27 23:05:37,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481440382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:37,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:37,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:05:37,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930896100] [2024-06-27 23:05:37,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:37,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:05:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:37,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:05:37,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:05:37,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:37,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:37,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:37,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:37,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:37,818 INFO L124 PetriNetUnfolderBase]: 1930/2956 cut-off events. [2024-06-27 23:05:37,818 INFO L125 PetriNetUnfolderBase]: For 3039/3039 co-relation queries the response was YES. [2024-06-27 23:05:37,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8011 conditions, 2956 events. 1930/2956 cut-off events. For 3039/3039 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14782 event pairs, 1405 based on Foata normal form. 2/2938 useless extension candidates. Maximal degree in co-relation 7995. Up to 2849 conditions per place. [2024-06-27 23:05:37,832 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 43 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2024-06-27 23:05:37,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 332 flow [2024-06-27 23:05:37,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:05:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:05:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-06-27 23:05:37,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4604651162790698 [2024-06-27 23:05:37,834 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 176 flow. Second operand 5 states and 99 transitions. [2024-06-27 23:05:37,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 332 flow [2024-06-27 23:05:37,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 306 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 23:05:37,836 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 215 flow [2024-06-27 23:05:37,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2024-06-27 23:05:37,837 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2024-06-27 23:05:37,837 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 215 flow [2024-06-27 23:05:37,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:37,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:37,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:37,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:05:37,838 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:37,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash 866500830, now seen corresponding path program 1 times [2024-06-27 23:05:37,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:37,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030215206] [2024-06-27 23:05:37,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:37,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:40,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:40,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030215206] [2024-06-27 23:05:40,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030215206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:40,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:40,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:05:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63947597] [2024-06-27 23:05:40,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:40,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:05:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:05:40,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:05:40,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:05:40,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 215 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:40,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:40,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:05:40,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:41,014 INFO L124 PetriNetUnfolderBase]: 1797/2830 cut-off events. [2024-06-27 23:05:41,014 INFO L125 PetriNetUnfolderBase]: For 4367/4375 co-relation queries the response was YES. [2024-06-27 23:05:41,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8167 conditions, 2830 events. 1797/2830 cut-off events. For 4367/4375 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14642 event pairs, 603 based on Foata normal form. 14/2832 useless extension candidates. Maximal degree in co-relation 8147. Up to 2550 conditions per place. [2024-06-27 23:05:41,031 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 67 selfloop transitions, 20 changer transitions 0/94 dead transitions. [2024-06-27 23:05:41,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 94 transitions, 527 flow [2024-06-27 23:05:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:05:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:05:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-27 23:05:41,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038759689922481 [2024-06-27 23:05:41,033 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 215 flow. Second operand 9 states and 195 transitions. [2024-06-27 23:05:41,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 94 transitions, 527 flow [2024-06-27 23:05:41,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 511 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 23:05:41,038 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 292 flow [2024-06-27 23:05:41,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-06-27 23:05:41,039 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2024-06-27 23:05:41,039 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 292 flow [2024-06-27 23:05:41,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:41,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:41,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:41,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:05:41,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:41,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash -165998705, now seen corresponding path program 1 times [2024-06-27 23:05:41,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:41,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418378412] [2024-06-27 23:05:41,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:41,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:41,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:41,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418378412] [2024-06-27 23:05:41,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418378412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:41,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:41,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:05:41,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877599984] [2024-06-27 23:05:41,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:41,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:05:41,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:41,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:05:41,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:05:41,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:41,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:41,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:41,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:41,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:42,588 INFO L124 PetriNetUnfolderBase]: 1911/2939 cut-off events. [2024-06-27 23:05:42,588 INFO L125 PetriNetUnfolderBase]: For 6822/6822 co-relation queries the response was YES. [2024-06-27 23:05:42,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9346 conditions, 2939 events. 1911/2939 cut-off events. For 6822/6822 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14664 event pairs, 1080 based on Foata normal form. 4/2926 useless extension candidates. Maximal degree in co-relation 9322. Up to 2802 conditions per place. [2024-06-27 23:05:42,614 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 13 changer transitions 0/73 dead transitions. [2024-06-27 23:05:42,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 486 flow [2024-06-27 23:05:42,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:05:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:05:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-27 23:05:42,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2024-06-27 23:05:42,616 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 292 flow. Second operand 6 states and 116 transitions. [2024-06-27 23:05:42,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 486 flow [2024-06-27 23:05:42,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 439 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 23:05:42,622 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 307 flow [2024-06-27 23:05:42,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2024-06-27 23:05:42,624 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2024-06-27 23:05:42,625 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 307 flow [2024-06-27 23:05:42,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:42,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:42,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:42,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:05:42,625 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:42,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1086244669, now seen corresponding path program 1 times [2024-06-27 23:05:42,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:42,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842371827] [2024-06-27 23:05:42,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:42,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:43,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:43,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842371827] [2024-06-27 23:05:43,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842371827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:43,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:43,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:05:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317800421] [2024-06-27 23:05:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:43,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:05:43,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:05:43,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:05:43,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:43,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:43,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:43,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:43,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:44,101 INFO L124 PetriNetUnfolderBase]: 1944/2992 cut-off events. [2024-06-27 23:05:44,101 INFO L125 PetriNetUnfolderBase]: For 8870/8876 co-relation queries the response was YES. [2024-06-27 23:05:44,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10106 conditions, 2992 events. 1944/2992 cut-off events. For 8870/8876 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15015 event pairs, 1025 based on Foata normal form. 6/2995 useless extension candidates. Maximal degree in co-relation 10080. Up to 2820 conditions per place. [2024-06-27 23:05:44,119 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 66 selfloop transitions, 24 changer transitions 0/95 dead transitions. [2024-06-27 23:05:44,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 670 flow [2024-06-27 23:05:44,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:05:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:05:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-06-27 23:05:44,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684385382059801 [2024-06-27 23:05:44,121 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 307 flow. Second operand 7 states and 141 transitions. [2024-06-27 23:05:44,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 670 flow [2024-06-27 23:05:44,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 638 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 23:05:44,128 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 448 flow [2024-06-27 23:05:44,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=448, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2024-06-27 23:05:44,130 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2024-06-27 23:05:44,130 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 448 flow [2024-06-27 23:05:44,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:44,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:44,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:44,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:05:44,131 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:44,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1602745393, now seen corresponding path program 2 times [2024-06-27 23:05:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:44,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004995059] [2024-06-27 23:05:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:45,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004995059] [2024-06-27 23:05:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004995059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:45,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:45,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:05:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498343201] [2024-06-27 23:05:45,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:45,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:05:45,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:45,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:05:45,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:05:45,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:45,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:45,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:45,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:45,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:45,589 INFO L124 PetriNetUnfolderBase]: 1976/3035 cut-off events. [2024-06-27 23:05:45,590 INFO L125 PetriNetUnfolderBase]: For 11894/11900 co-relation queries the response was YES. [2024-06-27 23:05:45,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11120 conditions, 3035 events. 1976/3035 cut-off events. For 11894/11900 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15144 event pairs, 1075 based on Foata normal form. 7/3026 useless extension candidates. Maximal degree in co-relation 11091. Up to 2871 conditions per place. [2024-06-27 23:05:45,602 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 66 selfloop transitions, 30 changer transitions 0/101 dead transitions. [2024-06-27 23:05:45,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 844 flow [2024-06-27 23:05:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:05:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:05:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-27 23:05:45,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-27 23:05:45,604 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 448 flow. Second operand 6 states and 120 transitions. [2024-06-27 23:05:45,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 844 flow [2024-06-27 23:05:45,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 801 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-27 23:05:45,610 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 636 flow [2024-06-27 23:05:45,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2024-06-27 23:05:45,611 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2024-06-27 23:05:45,611 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 636 flow [2024-06-27 23:05:45,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:45,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:45,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:45,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:05:45,612 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:45,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:45,612 INFO L85 PathProgramCache]: Analyzing trace with hash -535513683, now seen corresponding path program 3 times [2024-06-27 23:05:45,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:45,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633919854] [2024-06-27 23:05:45,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:45,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:46,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:46,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633919854] [2024-06-27 23:05:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633919854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:46,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:46,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:05:46,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030764654] [2024-06-27 23:05:46,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:46,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:05:46,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:46,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:05:46,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:05:46,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:46,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 636 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:46,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:46,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:46,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:47,047 INFO L124 PetriNetUnfolderBase]: 1968/3023 cut-off events. [2024-06-27 23:05:47,047 INFO L125 PetriNetUnfolderBase]: For 13967/13967 co-relation queries the response was YES. [2024-06-27 23:05:47,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11464 conditions, 3023 events. 1968/3023 cut-off events. For 13967/13967 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15059 event pairs, 1073 based on Foata normal form. 3/3011 useless extension candidates. Maximal degree in co-relation 11432. Up to 2892 conditions per place. [2024-06-27 23:05:47,063 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 78 selfloop transitions, 16 changer transitions 0/99 dead transitions. [2024-06-27 23:05:47,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 99 transitions, 868 flow [2024-06-27 23:05:47,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:05:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:05:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-27 23:05:47,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44573643410852715 [2024-06-27 23:05:47,065 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 636 flow. Second operand 6 states and 115 transitions. [2024-06-27 23:05:47,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 99 transitions, 868 flow [2024-06-27 23:05:47,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 777 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-27 23:05:47,076 INFO L231 Difference]: Finished difference. Result has 75 places, 85 transitions, 588 flow [2024-06-27 23:05:47,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=75, PETRI_TRANSITIONS=85} [2024-06-27 23:05:47,077 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2024-06-27 23:05:47,077 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 85 transitions, 588 flow [2024-06-27 23:05:47,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:47,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:47,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:47,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:05:47,078 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:47,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:47,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1469320333, now seen corresponding path program 1 times [2024-06-27 23:05:47,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:47,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860302183] [2024-06-27 23:05:47,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:47,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860302183] [2024-06-27 23:05:47,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860302183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:47,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:47,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:05:47,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843302974] [2024-06-27 23:05:47,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:47,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:05:47,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:05:47,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:05:48,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:48,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 85 transitions, 588 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:48,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:48,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:48,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:48,704 INFO L124 PetriNetUnfolderBase]: 2001/3092 cut-off events. [2024-06-27 23:05:48,705 INFO L125 PetriNetUnfolderBase]: For 16217/16228 co-relation queries the response was YES. [2024-06-27 23:05:48,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11888 conditions, 3092 events. 2001/3092 cut-off events. For 16217/16228 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15584 event pairs, 988 based on Foata normal form. 10/3099 useless extension candidates. Maximal degree in co-relation 11855. Up to 2817 conditions per place. [2024-06-27 23:05:48,722 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 74 selfloop transitions, 49 changer transitions 0/128 dead transitions. [2024-06-27 23:05:48,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 128 transitions, 1076 flow [2024-06-27 23:05:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:05:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:05:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-27 23:05:48,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47093023255813954 [2024-06-27 23:05:48,724 INFO L175 Difference]: Start difference. First operand has 75 places, 85 transitions, 588 flow. Second operand 8 states and 162 transitions. [2024-06-27 23:05:48,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 128 transitions, 1076 flow [2024-06-27 23:05:48,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 128 transitions, 1043 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 23:05:48,739 INFO L231 Difference]: Finished difference. Result has 81 places, 99 transitions, 802 flow [2024-06-27 23:05:48,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=802, PETRI_PLACES=81, PETRI_TRANSITIONS=99} [2024-06-27 23:05:48,740 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2024-06-27 23:05:48,742 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 99 transitions, 802 flow [2024-06-27 23:05:48,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:48,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:48,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:48,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:05:48,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:48,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash -696479483, now seen corresponding path program 2 times [2024-06-27 23:05:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:48,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759756178] [2024-06-27 23:05:48,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:48,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:50,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:50,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759756178] [2024-06-27 23:05:50,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759756178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:50,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:50,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:05:50,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528906672] [2024-06-27 23:05:50,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:50,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:05:50,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:50,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:05:50,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:05:50,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:50,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 99 transitions, 802 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:50,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:50,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:50,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:51,191 INFO L124 PetriNetUnfolderBase]: 2071/3185 cut-off events. [2024-06-27 23:05:51,191 INFO L125 PetriNetUnfolderBase]: For 21109/21120 co-relation queries the response was YES. [2024-06-27 23:05:51,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13328 conditions, 3185 events. 2071/3185 cut-off events. For 21109/21120 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 16004 event pairs, 1007 based on Foata normal form. 11/3193 useless extension candidates. Maximal degree in co-relation 13292. Up to 2939 conditions per place. [2024-06-27 23:05:51,209 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 87 selfloop transitions, 55 changer transitions 0/147 dead transitions. [2024-06-27 23:05:51,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 147 transitions, 1443 flow [2024-06-27 23:05:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:05:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:05:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-27 23:05:51,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950166112956811 [2024-06-27 23:05:51,210 INFO L175 Difference]: Start difference. First operand has 81 places, 99 transitions, 802 flow. Second operand 7 states and 149 transitions. [2024-06-27 23:05:51,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 147 transitions, 1443 flow [2024-06-27 23:05:51,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 147 transitions, 1330 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 23:05:51,228 INFO L231 Difference]: Finished difference. Result has 86 places, 120 transitions, 1091 flow [2024-06-27 23:05:51,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1091, PETRI_PLACES=86, PETRI_TRANSITIONS=120} [2024-06-27 23:05:51,229 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2024-06-27 23:05:51,229 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 120 transitions, 1091 flow [2024-06-27 23:05:51,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:51,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:51,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:51,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:05:51,230 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:51,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:51,230 INFO L85 PathProgramCache]: Analyzing trace with hash -686152546, now seen corresponding path program 1 times [2024-06-27 23:05:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:51,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158210651] [2024-06-27 23:05:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:51,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:52,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:52,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158210651] [2024-06-27 23:05:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158210651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:52,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:52,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:05:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977460153] [2024-06-27 23:05:52,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:52,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:05:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:52,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:05:52,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:05:52,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:52,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 120 transitions, 1091 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:52,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:52,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:52,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:52,970 INFO L124 PetriNetUnfolderBase]: 2092/3220 cut-off events. [2024-06-27 23:05:52,970 INFO L125 PetriNetUnfolderBase]: For 23983/23996 co-relation queries the response was YES. [2024-06-27 23:05:52,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13841 conditions, 3220 events. 2092/3220 cut-off events. For 23983/23996 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 16118 event pairs, 976 based on Foata normal form. 9/3225 useless extension candidates. Maximal degree in co-relation 13803. Up to 2973 conditions per place. [2024-06-27 23:05:52,988 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 110 selfloop transitions, 45 changer transitions 0/160 dead transitions. [2024-06-27 23:05:52,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 160 transitions, 1655 flow [2024-06-27 23:05:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:05:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:05:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-27 23:05:52,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2024-06-27 23:05:52,989 INFO L175 Difference]: Start difference. First operand has 86 places, 120 transitions, 1091 flow. Second operand 8 states and 161 transitions. [2024-06-27 23:05:52,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 160 transitions, 1655 flow [2024-06-27 23:05:53,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 160 transitions, 1584 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 23:05:53,014 INFO L231 Difference]: Finished difference. Result has 93 places, 133 transitions, 1259 flow [2024-06-27 23:05:53,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1259, PETRI_PLACES=93, PETRI_TRANSITIONS=133} [2024-06-27 23:05:53,015 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2024-06-27 23:05:53,016 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 133 transitions, 1259 flow [2024-06-27 23:05:53,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:53,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:53,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:53,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:05:53,016 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:53,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash -696329753, now seen corresponding path program 3 times [2024-06-27 23:05:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:53,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336313013] [2024-06-27 23:05:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:54,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:54,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336313013] [2024-06-27 23:05:54,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336313013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:54,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:54,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:05:54,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990129512] [2024-06-27 23:05:54,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:54,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:05:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:54,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:05:54,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:05:54,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:54,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 133 transitions, 1259 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:54,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:54,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:54,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:54,979 INFO L124 PetriNetUnfolderBase]: 2094/3224 cut-off events. [2024-06-27 23:05:54,979 INFO L125 PetriNetUnfolderBase]: For 28188/28198 co-relation queries the response was YES. [2024-06-27 23:05:54,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14694 conditions, 3224 events. 2094/3224 cut-off events. For 28188/28198 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 16171 event pairs, 970 based on Foata normal form. 11/3232 useless extension candidates. Maximal degree in co-relation 14651. Up to 3013 conditions per place. [2024-06-27 23:05:54,997 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 113 selfloop transitions, 42 changer transitions 0/160 dead transitions. [2024-06-27 23:05:54,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 160 transitions, 1695 flow [2024-06-27 23:05:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:05:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:05:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-27 23:05:54,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48172757475083056 [2024-06-27 23:05:54,999 INFO L175 Difference]: Start difference. First operand has 93 places, 133 transitions, 1259 flow. Second operand 7 states and 145 transitions. [2024-06-27 23:05:54,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 160 transitions, 1695 flow [2024-06-27 23:05:55,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 160 transitions, 1663 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 23:05:55,028 INFO L231 Difference]: Finished difference. Result has 98 places, 136 transitions, 1369 flow [2024-06-27 23:05:55,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1369, PETRI_PLACES=98, PETRI_TRANSITIONS=136} [2024-06-27 23:05:55,028 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2024-06-27 23:05:55,028 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 136 transitions, 1369 flow [2024-06-27 23:05:55,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:55,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:55,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:55,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:05:55,029 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:55,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash -818010091, now seen corresponding path program 4 times [2024-06-27 23:05:55,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:55,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090495420] [2024-06-27 23:05:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:55,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:56,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:56,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090495420] [2024-06-27 23:05:56,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090495420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:56,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:05:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003585600] [2024-06-27 23:05:56,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:56,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:05:56,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:56,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:05:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:05:56,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:56,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 136 transitions, 1369 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:56,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:56,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:56,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:57,116 INFO L124 PetriNetUnfolderBase]: 2147/3304 cut-off events. [2024-06-27 23:05:57,116 INFO L125 PetriNetUnfolderBase]: For 32689/32692 co-relation queries the response was YES. [2024-06-27 23:05:57,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15583 conditions, 3304 events. 2147/3304 cut-off events. For 32689/32692 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16639 event pairs, 1032 based on Foata normal form. 5/3295 useless extension candidates. Maximal degree in co-relation 15538. Up to 3049 conditions per place. [2024-06-27 23:05:57,137 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 113 selfloop transitions, 61 changer transitions 0/179 dead transitions. [2024-06-27 23:05:57,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 179 transitions, 2084 flow [2024-06-27 23:05:57,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:05:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:05:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-27 23:05:57,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46179401993355484 [2024-06-27 23:05:57,138 INFO L175 Difference]: Start difference. First operand has 98 places, 136 transitions, 1369 flow. Second operand 7 states and 139 transitions. [2024-06-27 23:05:57,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 179 transitions, 2084 flow [2024-06-27 23:05:57,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 179 transitions, 1957 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 23:05:57,163 INFO L231 Difference]: Finished difference. Result has 101 places, 158 transitions, 1688 flow [2024-06-27 23:05:57,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1688, PETRI_PLACES=101, PETRI_TRANSITIONS=158} [2024-06-27 23:05:57,164 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2024-06-27 23:05:57,164 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 158 transitions, 1688 flow [2024-06-27 23:05:57,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:57,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:57,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:57,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:05:57,165 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:57,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:57,165 INFO L85 PathProgramCache]: Analyzing trace with hash -817860361, now seen corresponding path program 5 times [2024-06-27 23:05:57,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:57,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304617210] [2024-06-27 23:05:57,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:57,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:05:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:58,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304617210] [2024-06-27 23:05:58,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304617210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:58,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:58,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:05:58,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960416471] [2024-06-27 23:05:58,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:58,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:05:58,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:58,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:05:58,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:05:58,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:58,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 158 transitions, 1688 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:58,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:58,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:58,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:59,109 INFO L124 PetriNetUnfolderBase]: 2172/3342 cut-off events. [2024-06-27 23:05:59,109 INFO L125 PetriNetUnfolderBase]: For 37098/37101 co-relation queries the response was YES. [2024-06-27 23:05:59,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16334 conditions, 3342 events. 2172/3342 cut-off events. For 37098/37101 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16774 event pairs, 1034 based on Foata normal form. 6/3334 useless extension candidates. Maximal degree in co-relation 16286. Up to 3136 conditions per place. [2024-06-27 23:05:59,131 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 138 selfloop transitions, 42 changer transitions 0/185 dead transitions. [2024-06-27 23:05:59,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 185 transitions, 2260 flow [2024-06-27 23:05:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:05:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:05:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-27 23:05:59,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4485049833887043 [2024-06-27 23:05:59,132 INFO L175 Difference]: Start difference. First operand has 101 places, 158 transitions, 1688 flow. Second operand 7 states and 135 transitions. [2024-06-27 23:05:59,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 185 transitions, 2260 flow [2024-06-27 23:05:59,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 185 transitions, 2140 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 23:05:59,173 INFO L231 Difference]: Finished difference. Result has 104 places, 167 transitions, 1836 flow [2024-06-27 23:05:59,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1836, PETRI_PLACES=104, PETRI_TRANSITIONS=167} [2024-06-27 23:05:59,174 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2024-06-27 23:05:59,174 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 167 transitions, 1836 flow [2024-06-27 23:05:59,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:05:59,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:59,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:59,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:05:59,175 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:59,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash -817860144, now seen corresponding path program 2 times [2024-06-27 23:05:59,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:59,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641262218] [2024-06-27 23:05:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:59,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:00,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:00,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641262218] [2024-06-27 23:06:00,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641262218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:00,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:00,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:00,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199797398] [2024-06-27 23:06:00,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:00,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:00,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:00,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:00,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:00,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:00,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 167 transitions, 1836 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:00,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:00,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:00,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:00,808 INFO L124 PetriNetUnfolderBase]: 2224/3422 cut-off events. [2024-06-27 23:06:00,808 INFO L125 PetriNetUnfolderBase]: For 42085/42088 co-relation queries the response was YES. [2024-06-27 23:06:00,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16981 conditions, 3422 events. 2224/3422 cut-off events. For 42085/42088 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 17248 event pairs, 1040 based on Foata normal form. 5/3412 useless extension candidates. Maximal degree in co-relation 16932. Up to 3150 conditions per place. [2024-06-27 23:06:00,825 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 153 selfloop transitions, 46 changer transitions 0/204 dead transitions. [2024-06-27 23:06:00,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 204 transitions, 2526 flow [2024-06-27 23:06:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:06:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:06:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-06-27 23:06:00,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684385382059801 [2024-06-27 23:06:00,829 INFO L175 Difference]: Start difference. First operand has 104 places, 167 transitions, 1836 flow. Second operand 7 states and 141 transitions. [2024-06-27 23:06:00,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 204 transitions, 2526 flow [2024-06-27 23:06:00,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 204 transitions, 2409 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 23:06:00,863 INFO L231 Difference]: Finished difference. Result has 106 places, 179 transitions, 1969 flow [2024-06-27 23:06:00,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1969, PETRI_PLACES=106, PETRI_TRANSITIONS=179} [2024-06-27 23:06:00,864 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 62 predicate places. [2024-06-27 23:06:00,864 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 179 transitions, 1969 flow [2024-06-27 23:06:00,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:00,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:00,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:00,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:06:00,865 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:00,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2116781748, now seen corresponding path program 3 times [2024-06-27 23:06:00,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:00,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128462296] [2024-06-27 23:06:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:01,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:01,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128462296] [2024-06-27 23:06:01,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128462296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:01,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:01,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108397584] [2024-06-27 23:06:01,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:01,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:01,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:01,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:01,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:01,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:01,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 179 transitions, 1969 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:01,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:01,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:01,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:02,356 INFO L124 PetriNetUnfolderBase]: 2253/3470 cut-off events. [2024-06-27 23:06:02,356 INFO L125 PetriNetUnfolderBase]: For 47391/47391 co-relation queries the response was YES. [2024-06-27 23:06:02,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17863 conditions, 3470 events. 2253/3470 cut-off events. For 47391/47391 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 17536 event pairs, 1048 based on Foata normal form. 5/3462 useless extension candidates. Maximal degree in co-relation 17813. Up to 3282 conditions per place. [2024-06-27 23:06:02,380 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 182 selfloop transitions, 20 changer transitions 0/207 dead transitions. [2024-06-27 23:06:02,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 207 transitions, 2563 flow [2024-06-27 23:06:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:06:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:06:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 23:06:02,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-27 23:06:02,383 INFO L175 Difference]: Start difference. First operand has 106 places, 179 transitions, 1969 flow. Second operand 7 states and 133 transitions. [2024-06-27 23:06:02,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 207 transitions, 2563 flow [2024-06-27 23:06:02,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 207 transitions, 2487 flow, removed 31 selfloop flow, removed 2 redundant places. [2024-06-27 23:06:02,429 INFO L231 Difference]: Finished difference. Result has 111 places, 186 transitions, 2063 flow [2024-06-27 23:06:02,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2063, PETRI_PLACES=111, PETRI_TRANSITIONS=186} [2024-06-27 23:06:02,429 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 67 predicate places. [2024-06-27 23:06:02,429 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 186 transitions, 2063 flow [2024-06-27 23:06:02,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:02,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:02,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:02,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:06:02,430 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:02,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:02,431 INFO L85 PathProgramCache]: Analyzing trace with hash -812296171, now seen corresponding path program 6 times [2024-06-27 23:06:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:02,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188570492] [2024-06-27 23:06:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:02,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:03,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:03,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188570492] [2024-06-27 23:06:03,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188570492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:03,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:03,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669198053] [2024-06-27 23:06:03,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:03,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:03,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:03,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:03,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:03,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 186 transitions, 2063 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:03,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:03,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:03,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:04,352 INFO L124 PetriNetUnfolderBase]: 2242/3453 cut-off events. [2024-06-27 23:06:04,352 INFO L125 PetriNetUnfolderBase]: For 51349/51349 co-relation queries the response was YES. [2024-06-27 23:06:04,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17991 conditions, 3453 events. 2242/3453 cut-off events. For 51349/51349 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 17449 event pairs, 1044 based on Foata normal form. 4/3444 useless extension candidates. Maximal degree in co-relation 17938. Up to 3272 conditions per place. [2024-06-27 23:06:04,371 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 174 selfloop transitions, 25 changer transitions 0/204 dead transitions. [2024-06-27 23:06:04,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 204 transitions, 2530 flow [2024-06-27 23:06:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:06:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:06:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 23:06:04,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2024-06-27 23:06:04,373 INFO L175 Difference]: Start difference. First operand has 111 places, 186 transitions, 2063 flow. Second operand 7 states and 132 transitions. [2024-06-27 23:06:04,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 204 transitions, 2530 flow [2024-06-27 23:06:04,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 204 transitions, 2396 flow, removed 49 selfloop flow, removed 5 redundant places. [2024-06-27 23:06:04,419 INFO L231 Difference]: Finished difference. Result has 113 places, 186 transitions, 1994 flow [2024-06-27 23:06:04,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1994, PETRI_PLACES=113, PETRI_TRANSITIONS=186} [2024-06-27 23:06:04,419 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2024-06-27 23:06:04,419 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 186 transitions, 1994 flow [2024-06-27 23:06:04,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:04,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:04,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:04,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:06:04,420 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:04,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash 246478534, now seen corresponding path program 4 times [2024-06-27 23:06:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:04,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607598317] [2024-06-27 23:06:04,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:04,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:05,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:05,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607598317] [2024-06-27 23:06:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607598317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:05,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890924429] [2024-06-27 23:06:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:05,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:05,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:05,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:05,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 186 transitions, 1994 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:05,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:05,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:05,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:06,055 INFO L124 PetriNetUnfolderBase]: 2229/3436 cut-off events. [2024-06-27 23:06:06,056 INFO L125 PetriNetUnfolderBase]: For 55081/55081 co-relation queries the response was YES. [2024-06-27 23:06:06,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17997 conditions, 3436 events. 2229/3436 cut-off events. For 55081/55081 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 17370 event pairs, 1042 based on Foata normal form. 5/3428 useless extension candidates. Maximal degree in co-relation 17943. Up to 3212 conditions per place. [2024-06-27 23:06:06,079 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 174 selfloop transitions, 32 changer transitions 0/211 dead transitions. [2024-06-27 23:06:06,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 211 transitions, 2517 flow [2024-06-27 23:06:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:06:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:06:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-27 23:06:06,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45182724252491696 [2024-06-27 23:06:06,080 INFO L175 Difference]: Start difference. First operand has 113 places, 186 transitions, 1994 flow. Second operand 7 states and 136 transitions. [2024-06-27 23:06:06,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 211 transitions, 2517 flow [2024-06-27 23:06:06,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 211 transitions, 2387 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-27 23:06:06,132 INFO L231 Difference]: Finished difference. Result has 114 places, 186 transitions, 1941 flow [2024-06-27 23:06:06,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1941, PETRI_PLACES=114, PETRI_TRANSITIONS=186} [2024-06-27 23:06:06,133 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 70 predicate places. [2024-06-27 23:06:06,133 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 186 transitions, 1941 flow [2024-06-27 23:06:06,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:06,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:06,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:06,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:06:06,133 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:06,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1141384462, now seen corresponding path program 1 times [2024-06-27 23:06:06,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:06,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120071053] [2024-06-27 23:06:06,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:06,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:06,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:06,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120071053] [2024-06-27 23:06:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120071053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:06,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:06,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:06:06,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286847630] [2024-06-27 23:06:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:06,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:06:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:06,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:06:06,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:06:06,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:06,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 186 transitions, 1941 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:06,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:06,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:06,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:07,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L801-->L804: 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][40], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 253#(and (or (and (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~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) (<= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~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) (<= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (<= ~z$w_buff1_used~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 161#true, 33#L778true, Black: 128#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$w_buff0~0 1)), Black: 129#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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))) (= ~y~0 0) (= ~z$w_buff0~0 1)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (or (and (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= 0 (+ ~z~0 1)) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 145#true, Black: 196#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 259#true, 109#true, Black: 265#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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))) (= ~z$w_buff0~0 1)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 271#true, Black: 208#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~__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_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (or (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~__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_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 21#L870true, Black: 90#(and (or (and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), 223#true, Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 0) (or (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z~0 0)))) (or (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= |#ghost~multithreaded| 0) (= ~z$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= 0 (+ ~z~0 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 219#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= ~z~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$w_buff1~0 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) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 149#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= 0 (+ ~z~0 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 37#L804true, 172#true, Black: 229#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 166#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (= |#ghost~multithreaded| 0) (and (= 0 ~z$flush_delayed~0) (or (and (= ~__unbuffered_cnt~0 0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0)) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~z$w_buff0~0 1)), Black: 167#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~z$flush_delayed~0) (or (and (= ~__unbuffered_cnt~0 0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0)) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~z$w_buff0~0 1)), 43#$Ultimate##0true, Black: 103#(and (= ~__unbuffered_cnt~0 0) (or (and (= (* 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$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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 239#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), P2Thread1of1ForFork1InUse, Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 58#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-27 23:06:07,156 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-06-27 23:06:07,156 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 23:06:07,156 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 23:06:07,156 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 23:06:07,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L819-->L821: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0][182], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 30#L821true, Black: 253#(and (or (and (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~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) (<= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~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) (<= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (<= ~z$w_buff1_used~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 161#true, 33#L778true, Black: 128#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$w_buff0~0 1)), Black: 129#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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))) (= ~y~0 0) (= ~z$w_buff0~0 1)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (or (and (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= 0 (+ ~z~0 1)) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 145#true, Black: 196#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 259#true, 109#true, Black: 265#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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))) (= ~z$w_buff0~0 1)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 271#true, Black: 208#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~__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_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (or (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~__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_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 21#L870true, 223#true, Black: 90#(and (or (and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 0) (or (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z~0 0)))) (or (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= |#ghost~multithreaded| 0) (= ~z$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 219#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= ~z~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$w_buff1~0 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) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= 0 (+ ~z~0 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 149#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= 0 (+ ~z~0 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 172#true, Black: 229#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 166#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (= |#ghost~multithreaded| 0) (and (= 0 ~z$flush_delayed~0) (or (and (= ~__unbuffered_cnt~0 0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0)) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~z$w_buff0~0 1)), Black: 167#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~z$flush_delayed~0) (or (and (= ~__unbuffered_cnt~0 0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0)) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~z$w_buff0~0 1)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (or (and (= (* 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$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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 10#L801true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 239#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 58#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-27 23:06:07,179 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-27 23:06:07,180 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 23:06:07,180 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 23:06:07,180 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 23:06:07,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L870-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (and (let ((.cse0 (mod v_~z$r_buff1_thd3~0_19 256)) (.cse3 (mod v_~z$r_buff1_thd1~0_19 256)) (.cse2 (mod v_~z$r_buff1_thd2~0_11 256)) (.cse7 (mod v_~z$flush_delayed~0_12 256)) (.cse4 (mod v_~z$r_buff0_thd3~0_21 256)) (.cse5 (mod v_~z$r_buff0_thd0~0_7 256)) (.cse6 (mod v_~z$read_delayed~0_6 256)) (.cse9 (mod v_~z$r_buff1_thd0~0_7 256)) (.cse8 (mod v_~z$r_buff0_thd2~0_13 256)) (.cse1 (mod v_~z$w_buff1_used~0_36 256))) (or (< v_~y~0_9 v_~__unbuffered_p1_EBX~0_7) (< v_~z$w_buff0~0_17 .cse0) (< v_~z$w_buff1~0_16 .cse1) (< (+ (mod v_~weak$$choice2~0_22 256) v_~z$w_buff0~0_17) 0) (< v_~x~0_9 v_~__unbuffered_p0_EBX~0_7) (< (+ v_~__unbuffered_p1_EBX~0_7 v_~z$w_buff0~0_17) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z$w_buff0~0_17) 0) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~z$w_buff0~0_17) 0) (< v_~z$w_buff0~0_17 .cse2) (< v_~z$w_buff1~0_16 .cse3) (< (+ .cse0 v_~z$w_buff0~0_17) 0) (< (+ v_~__unbuffered_cnt~0_12 v_~z$w_buff0~0_17) 0) (< (+ v_~z$w_buff0~0_17 v_~y~0_9) 0) (< v_~z$w_buff0~0_17 v_~z$w_buff1~0_16) (< v_~z$w_buff0~0_17 (mod v_~z$w_buff0_used~0_43 256)) (< v_~z$w_buff0~0_17 .cse4) (< (+ v_~z$w_buff0~0_17 v_~z$w_buff1~0_16) 0) (< (+ .cse5 v_~z$w_buff0~0_17) 0) (< (+ v_~__unbuffered_p0_EBX~0_7 v_~z$w_buff0~0_17) 0) (< (+ v_~__unbuffered_p1_EAX~0_7 v_~z$w_buff0~0_17) 0) (< v_~z$w_buff0~0_17 .cse3) (< v_~z$w_buff0~0_17 .cse6) (< v_~z$w_buff0~0_17 .cse7) (< (+ v_~z~0_24 v_~z$w_buff0~0_17) 0) (< v_~y~0_9 v_~__unbuffered_p2_EAX~0_7) (< (+ .cse3 v_~z$w_buff0~0_17) 0) (< (+ .cse2 v_~z$w_buff0~0_17) 0) (< (+ .cse7 v_~z$w_buff0~0_17) 0) (< (+ .cse4 v_~z$w_buff0~0_17) 0) (< v_~x~0_9 v_~__unbuffered_p1_EAX~0_7) (< v_~z$w_buff0~0_17 .cse8) (< v_~z$w_buff0~0_17 .cse9) (< (+ v_~z$w_buff0~0_17 (mod v_~weak$$choice0~0_8 256)) 0) (< v_~z$w_buff0~0_17 .cse5) (< (+ .cse6 v_~z$w_buff0~0_17) 0) (< (+ v_~z$mem_tmp~0_10 v_~z$w_buff0~0_17) 0) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~z$w_buff0~0_17) 0) (< (+ .cse1 v_~z$w_buff0~0_17) 0) (< (+ v_~z$w_buff0~0_17 v_~x~0_9) 0) (< (+ .cse9 v_~z$w_buff0~0_17) 0) (< (+ v_~z$w_buff0~0_17 .cse8) 0) (< v_~z$w_buff0~0_17 (mod v_~z$r_buff0_thd1~0_22 256)) (< (+ (mod v_~main$tmp_guard1~0_6 256) v_~z$w_buff0~0_17) 0) (< v_~z$w_buff0~0_17 .cse1))) (not (= |v_#ghost~multithreaded_7| 0))) InVars {~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__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_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_36, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_22, ~x~0=v_~x~0_9} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__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_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_36, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_22, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[][155], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 253#(and (or (and (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~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) (<= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~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) (<= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (<= ~z$w_buff1_used~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 161#true, 33#L778true, Black: 128#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$w_buff0~0 1)), Black: 129#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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))) (= ~y~0 0) (= ~z$w_buff0~0 1)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (or (and (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= 0 (+ ~z~0 1)) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 145#true, Black: 196#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 259#true, 109#true, Black: 265#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 139#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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))) (= ~z$w_buff0~0 1)), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 271#true, Black: 208#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~__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_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (or (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~__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_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 223#true, Black: 90#(and (or (and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 0) (or (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z~0 0)))) (or (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= |#ghost~multithreaded| 0) (= ~z$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= 0 (+ ~z~0 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 219#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= ~z~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$w_buff1~0 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) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 149#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= 0 (+ ~z~0 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 172#true, Black: 229#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 166#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (= |#ghost~multithreaded| 0) (and (= 0 ~z$flush_delayed~0) (or (and (= ~__unbuffered_cnt~0 0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0)) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~z$w_buff0~0 1)), 43#$Ultimate##0true, Black: 167#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~z$flush_delayed~0) (or (and (= ~__unbuffered_cnt~0 0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0)) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~z$w_buff0~0 1)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (or (and (= (* 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$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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 10#L801true, 38#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 239#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 58#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-27 23:06:07,182 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-06-27 23:06:07,182 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:06:07,182 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:06:07,182 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:06:07,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L819-->L821: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0][182], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 30#L821true, Black: 253#(and (or (and (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~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) (<= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~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) (<= ~z$r_buff0_thd1~0 1) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (<= ~z$w_buff1_used~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 161#true, Black: 128#(and (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$w_buff0~0 1)), Black: 129#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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))) (= ~y~0 0) (= ~z$w_buff0~0 1)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (or (and (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (<= 0 (+ ~z~0 1)) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 145#true, Black: 196#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (<= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 259#true, 109#true, Black: 265#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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))) (= ~z$w_buff0~0 1)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 271#true, Black: 208#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~__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_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (or (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~__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_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (and (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0)) (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 21#L870true, 223#true, Black: 90#(and (or (and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff0_thd1~0 1) (or (= ~z~0 1) (= ~z~0 0)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 88#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 0) (or (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= ~z~0 0)))) (or (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (= |#ghost~multithreaded| 0) (= ~z$w_buff0_used~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= 0 (+ ~z~0 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 219#(and (or (and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (and (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (and (= ~z~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd1~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~z$w_buff1~0 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) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 23#L781true, Black: 149#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= 0 (+ ~__unbuffered_p0_EAX~0 1)) (<= 0 (+ ~z~0 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 172#true, Black: 229#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 166#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (or (= |#ghost~multithreaded| 0) (and (= 0 ~z$flush_delayed~0) (or (and (= ~__unbuffered_cnt~0 0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0)) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~z$w_buff0~0 1)), Black: 167#(and (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~x~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~z$flush_delayed~0) (or (and (= ~__unbuffered_cnt~0 0) (<= ~z$w_buff0_used~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0)) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (<= 0 (div ~z$w_buff1_used~0 256)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd1~0 1) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (= ~z$mem_tmp~0 0) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)) (<= ~z$w_buff1_used~0 0))) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EAX~0 0))) (= ~z$w_buff0~0 1)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (or (and (= (* 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$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$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$r_buff0_thd1~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (= ~x~0 1) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 10#L801true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 239#(and (or (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_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd0~0 0) (= ~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)) (= |#ghost~multithreaded| 0)) (= ~y~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1)), Black: 120#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 112#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 118#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 58#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (<= ~z$flush_delayed~0 (+ (* (div ~z$flush_delayed~0 256) 256) 1)) (<= ~z$w_buff0_used~0 (+ (* 256 (div ~z$w_buff0_used~0 256)) 1)) (<= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= ~z$r_buff0_thd1~0 (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1)) (<= ~z$r_buff1_thd0~0 (+ (* (div ~z$r_buff1_thd0~0 256) 256) 1)) (<= ~z$r_buff1_thd2~0 (+ (* 256 (div ~z$r_buff1_thd2~0 256)) 1)) (<= ~z$r_buff0_thd2~0 (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1)) (<= ~z$r_buff1_thd3~0 (+ (* 256 (div ~z$r_buff1_thd3~0 256)) 1)) (= ~x~0 1) (<= ~z$r_buff0_thd0~0 (+ (* 256 (div ~z$r_buff0_thd0~0 256)) 1)) (<= ~z$r_buff0_thd3~0 (+ (* 256 (div ~z$r_buff0_thd3~0 256)) 1)) (<= ~z$read_delayed~0 (+ (* 256 (div ~z$read_delayed~0 256)) 1)))) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2024-06-27 23:06:07,235 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-27 23:06:07,235 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 23:06:07,236 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 23:06:07,236 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 23:06:07,505 INFO L124 PetriNetUnfolderBase]: 2641/4055 cut-off events. [2024-06-27 23:06:07,505 INFO L125 PetriNetUnfolderBase]: For 81080/81120 co-relation queries the response was YES. [2024-06-27 23:06:07,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21789 conditions, 4055 events. 2641/4055 cut-off events. For 81080/81120 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 20883 event pairs, 1403 based on Foata normal form. 4/4019 useless extension candidates. Maximal degree in co-relation 21735. Up to 3826 conditions per place. [2024-06-27 23:06:07,532 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 133 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2024-06-27 23:06:07,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 196 transitions, 2271 flow [2024-06-27 23:06:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:06:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:06:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-06-27 23:06:07,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4372093023255814 [2024-06-27 23:06:07,534 INFO L175 Difference]: Start difference. First operand has 114 places, 186 transitions, 1941 flow. Second operand 5 states and 94 transitions. [2024-06-27 23:06:07,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 196 transitions, 2271 flow [2024-06-27 23:06:07,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 196 transitions, 2145 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-27 23:06:07,590 INFO L231 Difference]: Finished difference. Result has 113 places, 189 transitions, 1869 flow [2024-06-27 23:06:07,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1869, PETRI_PLACES=113, PETRI_TRANSITIONS=189} [2024-06-27 23:06:07,591 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2024-06-27 23:06:07,591 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 189 transitions, 1869 flow [2024-06-27 23:06:07,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:07,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:07,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:07,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 23:06:07,591 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:07,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:07,592 INFO L85 PathProgramCache]: Analyzing trace with hash 204108420, now seen corresponding path program 1 times [2024-06-27 23:06:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:07,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507152096] [2024-06-27 23:06:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:07,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:08,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:08,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507152096] [2024-06-27 23:06:08,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507152096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:08,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:08,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650944307] [2024-06-27 23:06:08,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:08,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:09,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:09,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 189 transitions, 1869 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:09,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:09,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:09,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:09,925 INFO L124 PetriNetUnfolderBase]: 2379/3661 cut-off events. [2024-06-27 23:06:09,925 INFO L125 PetriNetUnfolderBase]: For 75384/75406 co-relation queries the response was YES. [2024-06-27 23:06:09,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20377 conditions, 3661 events. 2379/3661 cut-off events. For 75384/75406 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 18752 event pairs, 1021 based on Foata normal form. 6/3635 useless extension candidates. Maximal degree in co-relation 20321. Up to 3315 conditions per place. [2024-06-27 23:06:09,950 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 158 selfloop transitions, 57 changer transitions 0/221 dead transitions. [2024-06-27 23:06:09,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 221 transitions, 2439 flow [2024-06-27 23:06:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-06-27 23:06:09,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48255813953488375 [2024-06-27 23:06:09,952 INFO L175 Difference]: Start difference. First operand has 113 places, 189 transitions, 1869 flow. Second operand 8 states and 166 transitions. [2024-06-27 23:06:09,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 221 transitions, 2439 flow [2024-06-27 23:06:10,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 221 transitions, 2419 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 23:06:10,014 INFO L231 Difference]: Finished difference. Result has 118 places, 192 transitions, 2010 flow [2024-06-27 23:06:10,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2010, PETRI_PLACES=118, PETRI_TRANSITIONS=192} [2024-06-27 23:06:10,015 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 74 predicate places. [2024-06-27 23:06:10,015 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 192 transitions, 2010 flow [2024-06-27 23:06:10,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:10,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:10,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:10,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 23:06:10,015 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:10,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1873568638, now seen corresponding path program 1 times [2024-06-27 23:06:10,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:10,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726156323] [2024-06-27 23:06:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:10,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726156323] [2024-06-27 23:06:10,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726156323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:10,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:10,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686528507] [2024-06-27 23:06:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:10,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:10,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:10,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:10,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:10,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:10,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 192 transitions, 2010 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:10,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:10,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:10,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:11,833 INFO L124 PetriNetUnfolderBase]: 2466/3782 cut-off events. [2024-06-27 23:06:11,833 INFO L125 PetriNetUnfolderBase]: For 83824/83849 co-relation queries the response was YES. [2024-06-27 23:06:11,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21939 conditions, 3782 events. 2466/3782 cut-off events. For 83824/83849 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 19347 event pairs, 944 based on Foata normal form. 8/3763 useless extension candidates. Maximal degree in co-relation 21882. Up to 3401 conditions per place. [2024-06-27 23:06:11,859 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 192 selfloop transitions, 57 changer transitions 0/255 dead transitions. [2024-06-27 23:06:11,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 255 transitions, 2958 flow [2024-06-27 23:06:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:06:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:06:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2024-06-27 23:06:11,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-27 23:06:11,860 INFO L175 Difference]: Start difference. First operand has 118 places, 192 transitions, 2010 flow. Second operand 11 states and 215 transitions. [2024-06-27 23:06:11,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 255 transitions, 2958 flow [2024-06-27 23:06:11,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 255 transitions, 2823 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 23:06:11,930 INFO L231 Difference]: Finished difference. Result has 125 places, 209 transitions, 2188 flow [2024-06-27 23:06:11,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2188, PETRI_PLACES=125, PETRI_TRANSITIONS=209} [2024-06-27 23:06:11,930 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 81 predicate places. [2024-06-27 23:06:11,930 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 209 transitions, 2188 flow [2024-06-27 23:06:11,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:11,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:11,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:11,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 23:06:11,931 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:11,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash -927716516, now seen corresponding path program 2 times [2024-06-27 23:06:11,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:11,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319804288] [2024-06-27 23:06:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:12,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:12,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319804288] [2024-06-27 23:06:12,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319804288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:12,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:12,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136627378] [2024-06-27 23:06:12,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:12,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:12,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:12,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:13,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:13,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 209 transitions, 2188 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:13,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:13,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:13,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:13,883 INFO L124 PetriNetUnfolderBase]: 2532/3900 cut-off events. [2024-06-27 23:06:13,883 INFO L125 PetriNetUnfolderBase]: For 91458/91473 co-relation queries the response was YES. [2024-06-27 23:06:13,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23266 conditions, 3900 events. 2532/3900 cut-off events. For 91458/91473 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20076 event pairs, 957 based on Foata normal form. 10/3895 useless extension candidates. Maximal degree in co-relation 23205. Up to 3495 conditions per place. [2024-06-27 23:06:13,912 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 194 selfloop transitions, 64 changer transitions 0/264 dead transitions. [2024-06-27 23:06:13,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 264 transitions, 3074 flow [2024-06-27 23:06:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:06:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:06:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-27 23:06:13,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625322997416021 [2024-06-27 23:06:13,914 INFO L175 Difference]: Start difference. First operand has 125 places, 209 transitions, 2188 flow. Second operand 9 states and 179 transitions. [2024-06-27 23:06:13,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 264 transitions, 3074 flow [2024-06-27 23:06:13,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 264 transitions, 2894 flow, removed 69 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:13,991 INFO L231 Difference]: Finished difference. Result has 131 places, 230 transitions, 2426 flow [2024-06-27 23:06:13,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2426, PETRI_PLACES=131, PETRI_TRANSITIONS=230} [2024-06-27 23:06:13,991 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 87 predicate places. [2024-06-27 23:06:13,991 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 230 transitions, 2426 flow [2024-06-27 23:06:13,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:13,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:13,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:13,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 23:06:13,992 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:13,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash -917419556, now seen corresponding path program 3 times [2024-06-27 23:06:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:13,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493613645] [2024-06-27 23:06:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:13,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:14,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493613645] [2024-06-27 23:06:14,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493613645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:14,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:14,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:14,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210639540] [2024-06-27 23:06:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:14,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:14,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:14,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:15,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:15,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 230 transitions, 2426 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:15,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:15,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:15,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:15,862 INFO L124 PetriNetUnfolderBase]: 2575/3967 cut-off events. [2024-06-27 23:06:15,862 INFO L125 PetriNetUnfolderBase]: For 98546/98558 co-relation queries the response was YES. [2024-06-27 23:06:15,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24035 conditions, 3967 events. 2575/3967 cut-off events. For 98546/98558 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20430 event pairs, 889 based on Foata normal form. 8/3963 useless extension candidates. Maximal degree in co-relation 23971. Up to 3250 conditions per place. [2024-06-27 23:06:15,890 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 142 selfloop transitions, 131 changer transitions 0/279 dead transitions. [2024-06-27 23:06:15,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 279 transitions, 3408 flow [2024-06-27 23:06:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:06:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:06:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-27 23:06:15,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2024-06-27 23:06:15,891 INFO L175 Difference]: Start difference. First operand has 131 places, 230 transitions, 2426 flow. Second operand 9 states and 186 transitions. [2024-06-27 23:06:15,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 279 transitions, 3408 flow [2024-06-27 23:06:16,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 279 transitions, 3301 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:16,027 INFO L231 Difference]: Finished difference. Result has 137 places, 241 transitions, 2791 flow [2024-06-27 23:06:16,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2319, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2791, PETRI_PLACES=137, PETRI_TRANSITIONS=241} [2024-06-27 23:06:16,027 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 93 predicate places. [2024-06-27 23:06:16,027 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 241 transitions, 2791 flow [2024-06-27 23:06:16,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:16,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:16,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:16,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 23:06:16,028 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:16,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:16,029 INFO L85 PathProgramCache]: Analyzing trace with hash -927596360, now seen corresponding path program 2 times [2024-06-27 23:06:16,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:16,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203240786] [2024-06-27 23:06:16,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:16,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:16,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203240786] [2024-06-27 23:06:16,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203240786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:16,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:16,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:16,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910442163] [2024-06-27 23:06:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:16,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:16,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:16,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:17,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:17,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 241 transitions, 2791 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:17,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:17,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:17,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:18,010 INFO L124 PetriNetUnfolderBase]: 2702/4133 cut-off events. [2024-06-27 23:06:18,011 INFO L125 PetriNetUnfolderBase]: For 120078/120125 co-relation queries the response was YES. [2024-06-27 23:06:18,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26430 conditions, 4133 events. 2702/4133 cut-off events. For 120078/120125 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 21495 event pairs, 966 based on Foata normal form. 8/4099 useless extension candidates. Maximal degree in co-relation 26364. Up to 3511 conditions per place. [2024-06-27 23:06:18,040 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 164 selfloop transitions, 120 changer transitions 0/290 dead transitions. [2024-06-27 23:06:18,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 290 transitions, 3813 flow [2024-06-27 23:06:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:06:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:06:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-27 23:06:18,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2024-06-27 23:06:18,042 INFO L175 Difference]: Start difference. First operand has 137 places, 241 transitions, 2791 flow. Second operand 9 states and 186 transitions. [2024-06-27 23:06:18,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 290 transitions, 3813 flow [2024-06-27 23:06:18,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 290 transitions, 3651 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-27 23:06:18,153 INFO L231 Difference]: Finished difference. Result has 142 places, 254 transitions, 3094 flow [2024-06-27 23:06:18,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2635, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3094, PETRI_PLACES=142, PETRI_TRANSITIONS=254} [2024-06-27 23:06:18,153 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 98 predicate places. [2024-06-27 23:06:18,153 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 254 transitions, 3094 flow [2024-06-27 23:06:18,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:18,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:18,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:18,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 23:06:18,154 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:18,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1797983476, now seen corresponding path program 4 times [2024-06-27 23:06:18,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:18,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681439496] [2024-06-27 23:06:18,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:18,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:20,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:20,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681439496] [2024-06-27 23:06:20,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681439496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:20,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:20,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:06:20,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950143863] [2024-06-27 23:06:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:20,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:06:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:20,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:06:20,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:06:20,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:20,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 254 transitions, 3094 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-27 23:06:20,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:20,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:20,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:21,538 INFO L124 PetriNetUnfolderBase]: 2766/4251 cut-off events. [2024-06-27 23:06:21,538 INFO L125 PetriNetUnfolderBase]: For 121517/121532 co-relation queries the response was YES. [2024-06-27 23:06:21,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27412 conditions, 4251 events. 2766/4251 cut-off events. For 121517/121532 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 22146 event pairs, 1012 based on Foata normal form. 8/4240 useless extension candidates. Maximal degree in co-relation 27344. Up to 3887 conditions per place. [2024-06-27 23:06:21,569 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 254 selfloop transitions, 54 changer transitions 0/314 dead transitions. [2024-06-27 23:06:21,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 314 transitions, 4170 flow [2024-06-27 23:06:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:06:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:06:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-27 23:06:21,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470284237726098 [2024-06-27 23:06:21,570 INFO L175 Difference]: Start difference. First operand has 142 places, 254 transitions, 3094 flow. Second operand 9 states and 173 transitions. [2024-06-27 23:06:21,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 314 transitions, 4170 flow [2024-06-27 23:06:21,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 314 transitions, 4053 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:21,714 INFO L231 Difference]: Finished difference. Result has 149 places, 282 transitions, 3503 flow [2024-06-27 23:06:21,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2977, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3503, PETRI_PLACES=149, PETRI_TRANSITIONS=282} [2024-06-27 23:06:21,715 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 105 predicate places. [2024-06-27 23:06:21,715 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 282 transitions, 3503 flow [2024-06-27 23:06:21,715 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-27 23:06:21,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:21,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:21,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 23:06:21,715 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:21,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:21,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1797863320, now seen corresponding path program 3 times [2024-06-27 23:06:21,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:21,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168746955] [2024-06-27 23:06:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:21,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:23,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:23,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168746955] [2024-06-27 23:06:23,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168746955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:23,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:23,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:23,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703946493] [2024-06-27 23:06:23,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:23,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:23,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:23,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:23,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:23,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:23,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 282 transitions, 3503 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:23,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:23,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:23,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:24,357 INFO L124 PetriNetUnfolderBase]: 2875/4428 cut-off events. [2024-06-27 23:06:24,357 INFO L125 PetriNetUnfolderBase]: For 135053/135076 co-relation queries the response was YES. [2024-06-27 23:06:24,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29156 conditions, 4428 events. 2875/4428 cut-off events. For 135053/135076 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 23456 event pairs, 1045 based on Foata normal form. 8/4414 useless extension candidates. Maximal degree in co-relation 29084. Up to 3864 conditions per place. [2024-06-27 23:06:24,387 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 223 selfloop transitions, 103 changer transitions 0/332 dead transitions. [2024-06-27 23:06:24,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 332 transitions, 4610 flow [2024-06-27 23:06:24,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-27 23:06:24,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 23:06:24,388 INFO L175 Difference]: Start difference. First operand has 149 places, 282 transitions, 3503 flow. Second operand 8 states and 172 transitions. [2024-06-27 23:06:24,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 332 transitions, 4610 flow [2024-06-27 23:06:24,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 332 transitions, 4515 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:24,529 INFO L231 Difference]: Finished difference. Result has 153 places, 297 transitions, 3832 flow [2024-06-27 23:06:24,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3408, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3832, PETRI_PLACES=153, PETRI_TRANSITIONS=297} [2024-06-27 23:06:24,529 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 109 predicate places. [2024-06-27 23:06:24,529 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 297 transitions, 3832 flow [2024-06-27 23:06:24,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:24,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:24,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:24,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 23:06:24,530 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:24,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash -116026596, now seen corresponding path program 5 times [2024-06-27 23:06:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220542275] [2024-06-27 23:06:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220542275] [2024-06-27 23:06:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220542275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:26,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:26,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:26,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117255192] [2024-06-27 23:06:26,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:26,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:26,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:26,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:26,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 297 transitions, 3832 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:26,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:26,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:26,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:27,393 INFO L124 PetriNetUnfolderBase]: 2977/4580 cut-off events. [2024-06-27 23:06:27,393 INFO L125 PetriNetUnfolderBase]: For 147979/148002 co-relation queries the response was YES. [2024-06-27 23:06:27,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30763 conditions, 4580 events. 2977/4580 cut-off events. For 147979/148002 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 24353 event pairs, 1040 based on Foata normal form. 10/4569 useless extension candidates. Maximal degree in co-relation 30691. Up to 4011 conditions per place. [2024-06-27 23:06:27,422 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 240 selfloop transitions, 105 changer transitions 0/351 dead transitions. [2024-06-27 23:06:27,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 351 transitions, 5011 flow [2024-06-27 23:06:27,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-27 23:06:27,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49709302325581395 [2024-06-27 23:06:27,424 INFO L175 Difference]: Start difference. First operand has 153 places, 297 transitions, 3832 flow. Second operand 8 states and 171 transitions. [2024-06-27 23:06:27,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 351 transitions, 5011 flow [2024-06-27 23:06:27,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 351 transitions, 4870 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-27 23:06:27,567 INFO L231 Difference]: Finished difference. Result has 156 places, 312 transitions, 4117 flow [2024-06-27 23:06:27,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3691, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4117, PETRI_PLACES=156, PETRI_TRANSITIONS=312} [2024-06-27 23:06:27,568 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 112 predicate places. [2024-06-27 23:06:27,568 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 312 transitions, 4117 flow [2024-06-27 23:06:27,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:27,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:27,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:27,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 23:06:27,568 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-27 23:06:27,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:27,569 INFO L85 PathProgramCache]: Analyzing trace with hash 204101910, now seen corresponding path program 4 times [2024-06-27 23:06:27,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:27,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668641739] [2024-06-27 23:06:27,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:27,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:29,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:29,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668641739] [2024-06-27 23:06:29,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668641739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:29,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:29,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:29,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490297499] [2024-06-27 23:06:29,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:29,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:29,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:29,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:29,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:29,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 312 transitions, 4117 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:29,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:29,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:29,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:30,099 INFO L124 PetriNetUnfolderBase]: 2979/4579 cut-off events. [2024-06-27 23:06:30,100 INFO L125 PetriNetUnfolderBase]: For 155876/155899 co-relation queries the response was YES. [2024-06-27 23:06:30,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31373 conditions, 4579 events. 2979/4579 cut-off events. For 155876/155899 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 24340 event pairs, 1045 based on Foata normal form. 5/4562 useless extension candidates. Maximal degree in co-relation 31300. Up to 4155 conditions per place. [2024-06-27 23:06:30,138 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 273 selfloop transitions, 72 changer transitions 0/351 dead transitions. [2024-06-27 23:06:30,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 351 transitions, 5070 flow [2024-06-27 23:06:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-27 23:06:30,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48546511627906974 [2024-06-27 23:06:30,139 INFO L175 Difference]: Start difference. First operand has 156 places, 312 transitions, 4117 flow. Second operand 8 states and 167 transitions. [2024-06-27 23:06:30,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 351 transitions, 5070 flow [2024-06-27 23:06:30,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 351 transitions, 4940 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:30,333 INFO L231 Difference]: Finished difference. Result has 161 places, 322 transitions, 4299 flow [2024-06-27 23:06:30,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3987, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4299, PETRI_PLACES=161, PETRI_TRANSITIONS=322} [2024-06-27 23:06:30,333 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 117 predicate places. [2024-06-27 23:06:30,333 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 322 transitions, 4299 flow [2024-06-27 23:06:30,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:30,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:30,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:30,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 23:06:30,334 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:30,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash -111384966, now seen corresponding path program 6 times [2024-06-27 23:06:30,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:30,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781456115] [2024-06-27 23:06:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:30,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:31,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781456115] [2024-06-27 23:06:31,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781456115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:31,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:31,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:31,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532931173] [2024-06-27 23:06:31,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:31,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:31,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:31,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:31,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:31,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 322 transitions, 4299 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:31,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:31,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:31,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:32,800 INFO L124 PetriNetUnfolderBase]: 2983/4588 cut-off events. [2024-06-27 23:06:32,800 INFO L125 PetriNetUnfolderBase]: For 165364/165387 co-relation queries the response was YES. [2024-06-27 23:06:32,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32002 conditions, 4588 events. 2983/4588 cut-off events. For 165364/165387 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 24369 event pairs, 1045 based on Foata normal form. 10/4577 useless extension candidates. Maximal degree in co-relation 31926. Up to 4223 conditions per place. [2024-06-27 23:06:32,837 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 296 selfloop transitions, 52 changer transitions 0/354 dead transitions. [2024-06-27 23:06:32,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 354 transitions, 5184 flow [2024-06-27 23:06:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-27 23:06:32,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738372093023256 [2024-06-27 23:06:32,839 INFO L175 Difference]: Start difference. First operand has 161 places, 322 transitions, 4299 flow. Second operand 8 states and 163 transitions. [2024-06-27 23:06:32,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 354 transitions, 5184 flow [2024-06-27 23:06:33,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 354 transitions, 5065 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:33,046 INFO L231 Difference]: Finished difference. Result has 165 places, 325 transitions, 4352 flow [2024-06-27 23:06:33,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4180, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4352, PETRI_PLACES=165, PETRI_TRANSITIONS=325} [2024-06-27 23:06:33,046 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 121 predicate places. [2024-06-27 23:06:33,046 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 325 transitions, 4352 flow [2024-06-27 23:06:33,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:33,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:33,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:33,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 23:06:33,047 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-27 23:06:33,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 411371882, now seen corresponding path program 7 times [2024-06-27 23:06:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:33,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843799193] [2024-06-27 23:06:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:33,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:34,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:34,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843799193] [2024-06-27 23:06:34,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843799193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:34,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:34,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:34,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765307890] [2024-06-27 23:06:34,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:34,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:34,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:34,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:34,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:34,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:34,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 325 transitions, 4352 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:34,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:34,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:34,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:35,904 INFO L124 PetriNetUnfolderBase]: 3085/4731 cut-off events. [2024-06-27 23:06:35,905 INFO L125 PetriNetUnfolderBase]: For 178985/179008 co-relation queries the response was YES. [2024-06-27 23:06:35,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33287 conditions, 4731 events. 3085/4731 cut-off events. For 178985/179008 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 25222 event pairs, 1169 based on Foata normal form. 6/4710 useless extension candidates. Maximal degree in co-relation 33209. Up to 4333 conditions per place. [2024-06-27 23:06:36,028 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 313 selfloop transitions, 57 changer transitions 0/376 dead transitions. [2024-06-27 23:06:36,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 376 transitions, 5532 flow [2024-06-27 23:06:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 23:06:36,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476744186046512 [2024-06-27 23:06:36,030 INFO L175 Difference]: Start difference. First operand has 165 places, 325 transitions, 4352 flow. Second operand 8 states and 154 transitions. [2024-06-27 23:06:36,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 376 transitions, 5532 flow [2024-06-27 23:06:36,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 376 transitions, 5341 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-06-27 23:06:36,250 INFO L231 Difference]: Finished difference. Result has 168 places, 350 transitions, 4699 flow [2024-06-27 23:06:36,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4161, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4699, PETRI_PLACES=168, PETRI_TRANSITIONS=350} [2024-06-27 23:06:36,251 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 124 predicate places. [2024-06-27 23:06:36,251 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 350 transitions, 4699 flow [2024-06-27 23:06:36,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:36,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:36,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:36,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 23:06:36,251 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-27 23:06:36,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash 411492038, now seen corresponding path program 5 times [2024-06-27 23:06:36,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:36,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199638373] [2024-06-27 23:06:36,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:36,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:37,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:37,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199638373] [2024-06-27 23:06:37,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199638373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:37,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:37,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:37,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747617573] [2024-06-27 23:06:37,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:37,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:37,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:37,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:37,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:37,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:37,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 350 transitions, 4699 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:37,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:37,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:37,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:38,721 INFO L124 PetriNetUnfolderBase]: 3180/4879 cut-off events. [2024-06-27 23:06:38,721 INFO L125 PetriNetUnfolderBase]: For 190638/190664 co-relation queries the response was YES. [2024-06-27 23:06:38,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34561 conditions, 4879 events. 3180/4879 cut-off events. For 190638/190664 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 26171 event pairs, 1189 based on Foata normal form. 6/4856 useless extension candidates. Maximal degree in co-relation 34480. Up to 4289 conditions per place. [2024-06-27 23:06:38,763 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 293 selfloop transitions, 105 changer transitions 0/404 dead transitions. [2024-06-27 23:06:38,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 404 transitions, 6051 flow [2024-06-27 23:06:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-27 23:06:38,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2024-06-27 23:06:38,764 INFO L175 Difference]: Start difference. First operand has 168 places, 350 transitions, 4699 flow. Second operand 8 states and 161 transitions. [2024-06-27 23:06:38,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 404 transitions, 6051 flow [2024-06-27 23:06:39,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 404 transitions, 5950 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 23:06:39,032 INFO L231 Difference]: Finished difference. Result has 173 places, 373 transitions, 5229 flow [2024-06-27 23:06:39,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4598, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5229, PETRI_PLACES=173, PETRI_TRANSITIONS=373} [2024-06-27 23:06:39,032 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 129 predicate places. [2024-06-27 23:06:39,032 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 373 transitions, 5229 flow [2024-06-27 23:06:39,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:39,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:39,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:39,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 23:06:39,033 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:39,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1650322704, now seen corresponding path program 8 times [2024-06-27 23:06:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420115899] [2024-06-27 23:06:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:40,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420115899] [2024-06-27 23:06:40,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420115899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:40,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:40,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:40,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741651242] [2024-06-27 23:06:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:40,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:40,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:40,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:40,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:40,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:40,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 373 transitions, 5229 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:40,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:40,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:40,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:41,625 INFO L124 PetriNetUnfolderBase]: 3258/4987 cut-off events. [2024-06-27 23:06:41,625 INFO L125 PetriNetUnfolderBase]: For 203522/203548 co-relation queries the response was YES. [2024-06-27 23:06:41,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36137 conditions, 4987 events. 3258/4987 cut-off events. For 203522/203548 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26823 event pairs, 1184 based on Foata normal form. 8/4967 useless extension candidates. Maximal degree in co-relation 36053. Up to 4368 conditions per place. [2024-06-27 23:06:41,669 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 296 selfloop transitions, 119 changer transitions 0/421 dead transitions. [2024-06-27 23:06:41,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 421 transitions, 6524 flow [2024-06-27 23:06:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-27 23:06:41,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2024-06-27 23:06:41,670 INFO L175 Difference]: Start difference. First operand has 173 places, 373 transitions, 5229 flow. Second operand 8 states and 161 transitions. [2024-06-27 23:06:41,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 421 transitions, 6524 flow [2024-06-27 23:06:41,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 421 transitions, 6365 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:42,004 INFO L231 Difference]: Finished difference. Result has 178 places, 388 transitions, 5572 flow [2024-06-27 23:06:42,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5070, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5572, PETRI_PLACES=178, PETRI_TRANSITIONS=388} [2024-06-27 23:06:42,004 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 134 predicate places. [2024-06-27 23:06:42,004 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 388 transitions, 5572 flow [2024-06-27 23:06:42,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:42,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:42,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:42,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 23:06:42,005 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-27 23:06:42,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:42,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1736370086, now seen corresponding path program 6 times [2024-06-27 23:06:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:42,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876305527] [2024-06-27 23:06:42,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:43,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:43,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876305527] [2024-06-27 23:06:43,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876305527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:43,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:43,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:06:43,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839423048] [2024-06-27 23:06:43,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:43,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:06:43,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:43,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:06:43,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:06:43,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:43,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 388 transitions, 5572 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-27 23:06:43,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:43,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:43,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:44,438 INFO L124 PetriNetUnfolderBase]: 3319/5090 cut-off events. [2024-06-27 23:06:44,439 INFO L125 PetriNetUnfolderBase]: For 220373/220399 co-relation queries the response was YES. [2024-06-27 23:06:44,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37471 conditions, 5090 events. 3319/5090 cut-off events. For 220373/220399 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 27517 event pairs, 1227 based on Foata normal form. 10/5071 useless extension candidates. Maximal degree in co-relation 37385. Up to 4623 conditions per place. [2024-06-27 23:06:44,488 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 353 selfloop transitions, 70 changer transitions 0/429 dead transitions. [2024-06-27 23:06:44,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 429 transitions, 6800 flow [2024-06-27 23:06:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:06:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:06:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 23:06:44,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4315245478036176 [2024-06-27 23:06:44,489 INFO L175 Difference]: Start difference. First operand has 178 places, 388 transitions, 5572 flow. Second operand 9 states and 167 transitions. [2024-06-27 23:06:44,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 429 transitions, 6800 flow [2024-06-27 23:06:44,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 429 transitions, 6581 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-27 23:06:44,835 INFO L231 Difference]: Finished difference. Result has 182 places, 400 transitions, 5754 flow [2024-06-27 23:06:44,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5353, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5754, PETRI_PLACES=182, PETRI_TRANSITIONS=400} [2024-06-27 23:06:44,836 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 138 predicate places. [2024-06-27 23:06:44,836 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 400 transitions, 5754 flow [2024-06-27 23:06:44,836 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-27 23:06:44,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:44,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:44,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 23:06:44,836 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:44,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1654964520, now seen corresponding path program 7 times [2024-06-27 23:06:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:44,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528327905] [2024-06-27 23:06:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:46,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:46,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528327905] [2024-06-27 23:06:46,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528327905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:46,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:46,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:46,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726070120] [2024-06-27 23:06:46,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:46,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:46,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:46,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:46,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:46,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 400 transitions, 5754 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:46,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:46,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:46,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:47,430 INFO L124 PetriNetUnfolderBase]: 3369/5165 cut-off events. [2024-06-27 23:06:47,430 INFO L125 PetriNetUnfolderBase]: For 232592/232623 co-relation queries the response was YES. [2024-06-27 23:06:47,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38591 conditions, 5165 events. 3369/5165 cut-off events. For 232592/232623 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 28014 event pairs, 1222 based on Foata normal form. 8/5144 useless extension candidates. Maximal degree in co-relation 38504. Up to 4628 conditions per place. [2024-06-27 23:06:47,478 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 346 selfloop transitions, 90 changer transitions 0/442 dead transitions. [2024-06-27 23:06:47,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 442 transitions, 7013 flow [2024-06-27 23:06:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-27 23:06:47,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-27 23:06:47,479 INFO L175 Difference]: Start difference. First operand has 182 places, 400 transitions, 5754 flow. Second operand 8 states and 160 transitions. [2024-06-27 23:06:47,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 442 transitions, 7013 flow [2024-06-27 23:06:47,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 442 transitions, 6803 flow, removed 45 selfloop flow, removed 7 redundant places. [2024-06-27 23:06:47,871 INFO L231 Difference]: Finished difference. Result has 183 places, 409 transitions, 5945 flow [2024-06-27 23:06:47,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5544, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5945, PETRI_PLACES=183, PETRI_TRANSITIONS=409} [2024-06-27 23:06:47,872 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 139 predicate places. [2024-06-27 23:06:47,872 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 409 transitions, 5945 flow [2024-06-27 23:06:47,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:47,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:47,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:47,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 23:06:47,872 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:47,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1654964334, now seen corresponding path program 9 times [2024-06-27 23:06:47,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:47,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944425671] [2024-06-27 23:06:47,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:47,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:49,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:49,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944425671] [2024-06-27 23:06:49,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944425671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:49,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:49,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776555408] [2024-06-27 23:06:49,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:49,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:49,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:49,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:49,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:49,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 409 transitions, 5945 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:49,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:49,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:49,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:50,275 INFO L124 PetriNetUnfolderBase]: 3419/5235 cut-off events. [2024-06-27 23:06:50,275 INFO L125 PetriNetUnfolderBase]: For 245857/245888 co-relation queries the response was YES. [2024-06-27 23:06:50,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39511 conditions, 5235 events. 3419/5235 cut-off events. For 245857/245888 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 28412 event pairs, 1233 based on Foata normal form. 10/5217 useless extension candidates. Maximal degree in co-relation 39424. Up to 4844 conditions per place. [2024-06-27 23:06:50,327 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 381 selfloop transitions, 54 changer transitions 0/441 dead transitions. [2024-06-27 23:06:50,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 441 transitions, 7087 flow [2024-06-27 23:06:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-27 23:06:50,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44476744186046513 [2024-06-27 23:06:50,328 INFO L175 Difference]: Start difference. First operand has 183 places, 409 transitions, 5945 flow. Second operand 8 states and 153 transitions. [2024-06-27 23:06:50,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 441 transitions, 7087 flow [2024-06-27 23:06:50,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 441 transitions, 6826 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-06-27 23:06:50,718 INFO L231 Difference]: Finished difference. Result has 185 places, 418 transitions, 5998 flow [2024-06-27 23:06:50,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5684, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5998, PETRI_PLACES=185, PETRI_TRANSITIONS=418} [2024-06-27 23:06:50,719 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 141 predicate places. [2024-06-27 23:06:50,719 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 418 transitions, 5998 flow [2024-06-27 23:06:50,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:50,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:50,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:50,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 23:06:50,719 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:50,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash 775734806, now seen corresponding path program 8 times [2024-06-27 23:06:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:50,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397763767] [2024-06-27 23:06:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:51,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:51,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397763767] [2024-06-27 23:06:51,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397763767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:51,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:51,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:06:51,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645804617] [2024-06-27 23:06:51,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:51,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:06:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:51,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:06:51,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:06:52,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:52,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 418 transitions, 5998 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-27 23:06:52,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:52,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:52,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:53,134 INFO L124 PetriNetUnfolderBase]: 3469/5313 cut-off events. [2024-06-27 23:06:53,134 INFO L125 PetriNetUnfolderBase]: For 258229/258257 co-relation queries the response was YES. [2024-06-27 23:06:53,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40284 conditions, 5313 events. 3469/5313 cut-off events. For 258229/258257 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 28867 event pairs, 1256 based on Foata normal form. 8/5294 useless extension candidates. Maximal degree in co-relation 40196. Up to 4970 conditions per place. [2024-06-27 23:06:53,190 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 418 selfloop transitions, 28 changer transitions 0/452 dead transitions. [2024-06-27 23:06:53,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 452 transitions, 7227 flow [2024-06-27 23:06:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:06:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:06:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 23:06:53,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4134366925064599 [2024-06-27 23:06:53,191 INFO L175 Difference]: Start difference. First operand has 185 places, 418 transitions, 5998 flow. Second operand 9 states and 160 transitions. [2024-06-27 23:06:53,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 452 transitions, 7227 flow [2024-06-27 23:06:53,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 452 transitions, 7051 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-27 23:06:53,670 INFO L231 Difference]: Finished difference. Result has 189 places, 429 transitions, 6143 flow [2024-06-27 23:06:53,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5822, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6143, PETRI_PLACES=189, PETRI_TRANSITIONS=429} [2024-06-27 23:06:53,670 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 145 predicate places. [2024-06-27 23:06:53,671 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 429 transitions, 6143 flow [2024-06-27 23:06:53,671 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-27 23:06:53,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:53,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:53,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 23:06:53,671 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:53,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash -949105868, now seen corresponding path program 10 times [2024-06-27 23:06:53,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:53,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331934764] [2024-06-27 23:06:53,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:54,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:54,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331934764] [2024-06-27 23:06:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331934764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:54,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:54,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:54,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924663925] [2024-06-27 23:06:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:54,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:54,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:55,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:55,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 429 transitions, 6143 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:55,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:55,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:55,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:56,156 INFO L124 PetriNetUnfolderBase]: 3447/5283 cut-off events. [2024-06-27 23:06:56,156 INFO L125 PetriNetUnfolderBase]: For 264284/264312 co-relation queries the response was YES. [2024-06-27 23:06:56,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39971 conditions, 5283 events. 3447/5283 cut-off events. For 264284/264312 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 28687 event pairs, 1250 based on Foata normal form. 8/5264 useless extension candidates. Maximal degree in co-relation 39881. Up to 4930 conditions per place. [2024-06-27 23:06:56,204 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 412 selfloop transitions, 34 changer transitions 0/452 dead transitions. [2024-06-27 23:06:56,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 452 transitions, 7151 flow [2024-06-27 23:06:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 23:06:56,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2024-06-27 23:06:56,205 INFO L175 Difference]: Start difference. First operand has 189 places, 429 transitions, 6143 flow. Second operand 8 states and 150 transitions. [2024-06-27 23:06:56,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 452 transitions, 7151 flow [2024-06-27 23:06:56,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 452 transitions, 6905 flow, removed 99 selfloop flow, removed 7 redundant places. [2024-06-27 23:06:56,654 INFO L231 Difference]: Finished difference. Result has 190 places, 429 transitions, 5981 flow [2024-06-27 23:06:56,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5897, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5981, PETRI_PLACES=190, PETRI_TRANSITIONS=429} [2024-06-27 23:06:56,655 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 146 predicate places. [2024-06-27 23:06:56,655 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 429 transitions, 5981 flow [2024-06-27 23:06:56,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:56,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:56,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:56,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 23:06:56,655 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:56,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1767544284, now seen corresponding path program 9 times [2024-06-27 23:06:56,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:56,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985888891] [2024-06-27 23:06:56,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:56,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:06:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985888891] [2024-06-27 23:06:58,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985888891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:58,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:58,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831142862] [2024-06-27 23:06:58,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:58,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:58,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:58,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:58,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:58,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 429 transitions, 5981 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:58,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:58,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:58,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:59,295 INFO L124 PetriNetUnfolderBase]: 3513/5382 cut-off events. [2024-06-27 23:06:59,295 INFO L125 PetriNetUnfolderBase]: For 278372/278400 co-relation queries the response was YES. [2024-06-27 23:06:59,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40838 conditions, 5382 events. 3513/5382 cut-off events. For 278372/278400 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29386 event pairs, 1247 based on Foata normal form. 8/5363 useless extension candidates. Maximal degree in co-relation 40748. Up to 4869 conditions per place. [2024-06-27 23:06:59,349 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 398 selfloop transitions, 69 changer transitions 0/473 dead transitions. [2024-06-27 23:06:59,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 473 transitions, 7534 flow [2024-06-27 23:06:59,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-27 23:06:59,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563953488372093 [2024-06-27 23:06:59,350 INFO L175 Difference]: Start difference. First operand has 190 places, 429 transitions, 5981 flow. Second operand 8 states and 157 transitions. [2024-06-27 23:06:59,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 473 transitions, 7534 flow [2024-06-27 23:06:59,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 473 transitions, 7253 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-06-27 23:06:59,749 INFO L231 Difference]: Finished difference. Result has 191 places, 441 transitions, 6170 flow [2024-06-27 23:06:59,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5700, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6170, PETRI_PLACES=191, PETRI_TRANSITIONS=441} [2024-06-27 23:06:59,749 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 147 predicate places. [2024-06-27 23:06:59,749 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 441 transitions, 6170 flow [2024-06-27 23:06:59,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:06:59,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:59,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:59,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 23:06:59,750 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:59,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash -949099172, now seen corresponding path program 10 times [2024-06-27 23:06:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84058500] [2024-06-27 23:06:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84058500] [2024-06-27 23:07:00,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84058500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:00,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:00,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:07:00,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966341972] [2024-06-27 23:07:00,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:00,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:07:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:00,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:07:00,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:07:01,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:01,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 441 transitions, 6170 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:01,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:01,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:01,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:02,070 INFO L124 PetriNetUnfolderBase]: 3491/5353 cut-off events. [2024-06-27 23:07:02,071 INFO L125 PetriNetUnfolderBase]: For 287037/287065 co-relation queries the response was YES. [2024-06-27 23:07:02,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40750 conditions, 5353 events. 3491/5353 cut-off events. For 287037/287065 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 29193 event pairs, 1251 based on Foata normal form. 8/5334 useless extension candidates. Maximal degree in co-relation 40659. Up to 4980 conditions per place. [2024-06-27 23:07:02,122 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 422 selfloop transitions, 39 changer transitions 0/467 dead transitions. [2024-06-27 23:07:02,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 467 transitions, 7232 flow [2024-06-27 23:07:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:07:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:07:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 23:07:02,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-27 23:07:02,123 INFO L175 Difference]: Start difference. First operand has 191 places, 441 transitions, 6170 flow. Second operand 8 states and 152 transitions. [2024-06-27 23:07:02,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 467 transitions, 7232 flow [2024-06-27 23:07:02,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 467 transitions, 6966 flow, removed 89 selfloop flow, removed 5 redundant places. [2024-06-27 23:07:02,624 INFO L231 Difference]: Finished difference. Result has 195 places, 443 transitions, 6032 flow [2024-06-27 23:07:02,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5904, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6032, PETRI_PLACES=195, PETRI_TRANSITIONS=443} [2024-06-27 23:07:02,624 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places. [2024-06-27 23:07:02,624 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 443 transitions, 6032 flow [2024-06-27 23:07:02,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:02,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:02,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:02,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 23:07:02,625 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:02,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:02,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1758955734, now seen corresponding path program 1 times [2024-06-27 23:07:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:02,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221633061] [2024-06-27 23:07:02,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:04,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221633061] [2024-06-27 23:07:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221633061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:07:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633587851] [2024-06-27 23:07:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:04,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:07:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:04,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:07:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:07:04,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-27 23:07:04,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 443 transitions, 6032 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:04,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:04,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-27 23:07:04,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:05,542 INFO L124 PetriNetUnfolderBase]: 4115/6191 cut-off events. [2024-06-27 23:07:05,542 INFO L125 PetriNetUnfolderBase]: For 331408/331426 co-relation queries the response was YES. [2024-06-27 23:07:05,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46229 conditions, 6191 events. 4115/6191 cut-off events. For 331408/331426 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 32729 event pairs, 1550 based on Foata normal form. 4/6170 useless extension candidates. Maximal degree in co-relation 46136. Up to 5904 conditions per place. [2024-06-27 23:07:05,596 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 446 selfloop transitions, 21 changer transitions 0/472 dead transitions. [2024-06-27 23:07:05,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 472 transitions, 7169 flow [2024-06-27 23:07:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:07:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:07:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 23:07:05,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3953488372093023 [2024-06-27 23:07:05,597 INFO L175 Difference]: Start difference. First operand has 195 places, 443 transitions, 6032 flow. Second operand 9 states and 153 transitions. [2024-06-27 23:07:05,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 472 transitions, 7169 flow [2024-06-27 23:07:06,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 472 transitions, 7002 flow, removed 52 selfloop flow, removed 5 redundant places. [2024-06-27 23:07:06,061 INFO L231 Difference]: Finished difference. Result has 200 places, 449 transitions, 6016 flow [2024-06-27 23:07:06,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5869, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6016, PETRI_PLACES=200, PETRI_TRANSITIONS=449} [2024-06-27 23:07:06,062 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 156 predicate places. [2024-06-27 23:07:06,062 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 449 transitions, 6016 flow [2024-06-27 23:07:06,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:06,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:06,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:06,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 23:07:06,062 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:06,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash -980279314, now seen corresponding path program 1 times [2024-06-27 23:07:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521971106] [2024-06-27 23:07:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:06,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:06,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521971106] [2024-06-27 23:07:06,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521971106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:06,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:06,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:07:06,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988607884] [2024-06-27 23:07:06,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:06,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:07:06,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:07:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:07:06,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:06,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 449 transitions, 6016 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:06,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:06,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:06,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:08,176 INFO L124 PetriNetUnfolderBase]: 3702/5755 cut-off events. [2024-06-27 23:07:08,176 INFO L125 PetriNetUnfolderBase]: For 335761/335884 co-relation queries the response was YES. [2024-06-27 23:07:08,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42790 conditions, 5755 events. 3702/5755 cut-off events. For 335761/335884 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 31991 event pairs, 1584 based on Foata normal form. 34/5755 useless extension candidates. Maximal degree in co-relation 42695. Up to 5167 conditions per place. [2024-06-27 23:07:08,229 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 330 selfloop transitions, 13 changer transitions 0/462 dead transitions. [2024-06-27 23:07:08,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 462 transitions, 6768 flow [2024-06-27 23:07:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:07:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:07:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-27 23:07:08,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4263565891472868 [2024-06-27 23:07:08,231 INFO L175 Difference]: Start difference. First operand has 200 places, 449 transitions, 6016 flow. Second operand 6 states and 110 transitions. [2024-06-27 23:07:08,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 462 transitions, 6768 flow [2024-06-27 23:07:08,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 462 transitions, 6671 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-27 23:07:08,645 INFO L231 Difference]: Finished difference. Result has 200 places, 452 transitions, 5985 flow [2024-06-27 23:07:08,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5919, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5985, PETRI_PLACES=200, PETRI_TRANSITIONS=452} [2024-06-27 23:07:08,646 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 156 predicate places. [2024-06-27 23:07:08,646 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 452 transitions, 5985 flow [2024-06-27 23:07:08,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:08,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:08,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:08,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 23:07:08,647 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-27 23:07:08,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:08,647 INFO L85 PathProgramCache]: Analyzing trace with hash 959092709, now seen corresponding path program 1 times [2024-06-27 23:07:08,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:08,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317635160] [2024-06-27 23:07:08,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:08,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:10,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317635160] [2024-06-27 23:07:10,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317635160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:10,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:10,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:07:10,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475239451] [2024-06-27 23:07:10,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:10,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:07:10,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:10,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:07:10,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:07:10,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:10,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 452 transitions, 5985 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-27 23:07:10,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:10,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:10,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:11,881 INFO L124 PetriNetUnfolderBase]: 3925/6003 cut-off events. [2024-06-27 23:07:11,881 INFO L125 PetriNetUnfolderBase]: For 364026/364054 co-relation queries the response was YES. [2024-06-27 23:07:11,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46454 conditions, 6003 events. 3925/6003 cut-off events. For 364026/364054 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 33278 event pairs, 1225 based on Foata normal form. 12/5979 useless extension candidates. Maximal degree in co-relation 46358. Up to 4704 conditions per place. [2024-06-27 23:07:11,945 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 325 selfloop transitions, 182 changer transitions 0/514 dead transitions. [2024-06-27 23:07:11,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 514 transitions, 7801 flow [2024-06-27 23:07:11,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2024-06-27 23:07:11,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48604651162790696 [2024-06-27 23:07:11,946 INFO L175 Difference]: Start difference. First operand has 200 places, 452 transitions, 5985 flow. Second operand 10 states and 209 transitions. [2024-06-27 23:07:11,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 514 transitions, 7801 flow [2024-06-27 23:07:12,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 514 transitions, 7763 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 23:07:12,427 INFO L231 Difference]: Finished difference. Result has 206 places, 461 transitions, 6490 flow [2024-06-27 23:07:12,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5947, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6490, PETRI_PLACES=206, PETRI_TRANSITIONS=461} [2024-06-27 23:07:12,428 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 162 predicate places. [2024-06-27 23:07:12,428 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 461 transitions, 6490 flow [2024-06-27 23:07:12,428 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-27 23:07:12,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:12,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:12,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 23:07:12,429 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-27 23:07:12,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:12,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2048913283, now seen corresponding path program 2 times [2024-06-27 23:07:12,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:12,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263291444] [2024-06-27 23:07:12,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:12,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:13,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:13,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263291444] [2024-06-27 23:07:13,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263291444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:13,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:13,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307413084] [2024-06-27 23:07:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:13,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:13,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:13,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:13,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:13,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:13,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 461 transitions, 6490 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:13,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:13,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:13,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:15,170 INFO L124 PetriNetUnfolderBase]: 4311/6586 cut-off events. [2024-06-27 23:07:15,170 INFO L125 PetriNetUnfolderBase]: For 434569/434598 co-relation queries the response was YES. [2024-06-27 23:07:15,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53360 conditions, 6586 events. 4311/6586 cut-off events. For 434569/434598 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 37198 event pairs, 1141 based on Foata normal form. 16/6563 useless extension candidates. Maximal degree in co-relation 53263. Up to 5502 conditions per place. [2024-06-27 23:07:15,246 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 385 selfloop transitions, 140 changer transitions 0/532 dead transitions. [2024-06-27 23:07:15,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 532 transitions, 8423 flow [2024-06-27 23:07:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:07:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:07:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 238 transitions. [2024-06-27 23:07:15,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46124031007751937 [2024-06-27 23:07:15,248 INFO L175 Difference]: Start difference. First operand has 206 places, 461 transitions, 6490 flow. Second operand 12 states and 238 transitions. [2024-06-27 23:07:15,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 532 transitions, 8423 flow [2024-06-27 23:07:15,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 532 transitions, 8192 flow, removed 58 selfloop flow, removed 5 redundant places. [2024-06-27 23:07:15,855 INFO L231 Difference]: Finished difference. Result has 214 places, 480 transitions, 6978 flow [2024-06-27 23:07:15,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6307, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6978, PETRI_PLACES=214, PETRI_TRANSITIONS=480} [2024-06-27 23:07:15,856 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 170 predicate places. [2024-06-27 23:07:15,856 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 480 transitions, 6978 flow [2024-06-27 23:07:15,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:15,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:15,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:15,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 23:07:15,857 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:15,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1305560159, now seen corresponding path program 3 times [2024-06-27 23:07:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:15,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109988650] [2024-06-27 23:07:15,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:15,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:17,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:17,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109988650] [2024-06-27 23:07:17,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109988650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:17,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:17,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316440309] [2024-06-27 23:07:17,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:17,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:17,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:17,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:17,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:17,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:17,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 480 transitions, 6978 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:17,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:17,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:17,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:18,773 INFO L124 PetriNetUnfolderBase]: 4414/6757 cut-off events. [2024-06-27 23:07:18,773 INFO L125 PetriNetUnfolderBase]: For 454551/454586 co-relation queries the response was YES. [2024-06-27 23:07:18,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55305 conditions, 6757 events. 4414/6757 cut-off events. For 454551/454586 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 38554 event pairs, 1259 based on Foata normal form. 22/6742 useless extension candidates. Maximal degree in co-relation 55205. Up to 5960 conditions per place. [2024-06-27 23:07:18,849 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 410 selfloop transitions, 113 changer transitions 0/530 dead transitions. [2024-06-27 23:07:18,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 530 transitions, 8468 flow [2024-06-27 23:07:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-27 23:07:18,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4604651162790698 [2024-06-27 23:07:18,851 INFO L175 Difference]: Start difference. First operand has 214 places, 480 transitions, 6978 flow. Second operand 10 states and 198 transitions. [2024-06-27 23:07:18,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 530 transitions, 8468 flow [2024-06-27 23:07:19,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 530 transitions, 8124 flow, removed 109 selfloop flow, removed 7 redundant places. [2024-06-27 23:07:19,577 INFO L231 Difference]: Finished difference. Result has 217 places, 492 transitions, 7172 flow [2024-06-27 23:07:19,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6726, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7172, PETRI_PLACES=217, PETRI_TRANSITIONS=492} [2024-06-27 23:07:19,577 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 173 predicate places. [2024-06-27 23:07:19,577 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 492 transitions, 7172 flow [2024-06-27 23:07:19,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:19,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:19,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:19,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 23:07:19,578 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:19,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:19,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1624771499, now seen corresponding path program 4 times [2024-06-27 23:07:19,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:19,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71779830] [2024-06-27 23:07:19,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:19,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:20,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:20,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71779830] [2024-06-27 23:07:20,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71779830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:20,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:20,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:20,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132994545] [2024-06-27 23:07:20,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:20,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:20,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:20,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:20,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:20,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:20,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 492 transitions, 7172 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:20,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:20,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:20,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:22,575 INFO L124 PetriNetUnfolderBase]: 4773/7314 cut-off events. [2024-06-27 23:07:22,576 INFO L125 PetriNetUnfolderBase]: For 506394/506444 co-relation queries the response was YES. [2024-06-27 23:07:22,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60397 conditions, 7314 events. 4773/7314 cut-off events. For 506394/506444 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 42611 event pairs, 1017 based on Foata normal form. 12/7280 useless extension candidates. Maximal degree in co-relation 60295. Up to 4442 conditions per place. [2024-06-27 23:07:22,665 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 224 selfloop transitions, 341 changer transitions 0/572 dead transitions. [2024-06-27 23:07:22,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 572 transitions, 9494 flow [2024-06-27 23:07:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2024-06-27 23:07:22,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 23:07:22,667 INFO L175 Difference]: Start difference. First operand has 217 places, 492 transitions, 7172 flow. Second operand 10 states and 215 transitions. [2024-06-27 23:07:22,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 572 transitions, 9494 flow [2024-06-27 23:07:23,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 572 transitions, 9229 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-27 23:07:23,459 INFO L231 Difference]: Finished difference. Result has 221 places, 521 transitions, 8223 flow [2024-06-27 23:07:23,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6907, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=315, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8223, PETRI_PLACES=221, PETRI_TRANSITIONS=521} [2024-06-27 23:07:23,459 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 177 predicate places. [2024-06-27 23:07:23,460 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 521 transitions, 8223 flow [2024-06-27 23:07:23,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:23,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:23,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:23,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 23:07:23,460 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:23,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:23,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1614041159, now seen corresponding path program 5 times [2024-06-27 23:07:23,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:23,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470548448] [2024-06-27 23:07:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470548448] [2024-06-27 23:07:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470548448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:24,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:24,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:24,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310180030] [2024-06-27 23:07:24,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:24,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:24,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:24,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:24,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:24,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 521 transitions, 8223 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:24,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:24,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:24,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:26,501 INFO L124 PetriNetUnfolderBase]: 4741/7270 cut-off events. [2024-06-27 23:07:26,501 INFO L125 PetriNetUnfolderBase]: For 524487/524537 co-relation queries the response was YES. [2024-06-27 23:07:26,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61995 conditions, 7270 events. 4741/7270 cut-off events. For 524487/524537 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 42371 event pairs, 1011 based on Foata normal form. 14/7238 useless extension candidates. Maximal degree in co-relation 61891. Up to 4422 conditions per place. [2024-06-27 23:07:26,580 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 231 selfloop transitions, 333 changer transitions 0/571 dead transitions. [2024-06-27 23:07:26,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 571 transitions, 9904 flow [2024-06-27 23:07:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2024-06-27 23:07:26,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 23:07:26,581 INFO L175 Difference]: Start difference. First operand has 221 places, 521 transitions, 8223 flow. Second operand 10 states and 215 transitions. [2024-06-27 23:07:26,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 571 transitions, 9904 flow [2024-06-27 23:07:27,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 571 transitions, 9625 flow, removed 81 selfloop flow, removed 4 redundant places. [2024-06-27 23:07:27,281 INFO L231 Difference]: Finished difference. Result has 227 places, 521 transitions, 8635 flow [2024-06-27 23:07:27,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7956, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=333, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8635, PETRI_PLACES=227, PETRI_TRANSITIONS=521} [2024-06-27 23:07:27,282 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 183 predicate places. [2024-06-27 23:07:27,282 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 521 transitions, 8635 flow [2024-06-27 23:07:27,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:27,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:27,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:27,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 23:07:27,283 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:27,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:27,283 INFO L85 PathProgramCache]: Analyzing trace with hash 694424833, now seen corresponding path program 6 times [2024-06-27 23:07:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:27,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334504592] [2024-06-27 23:07:27,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:29,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:29,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334504592] [2024-06-27 23:07:29,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334504592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:29,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:29,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:07:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555103954] [2024-06-27 23:07:29,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:29,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:07:29,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:29,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:07:29,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:07:29,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:29,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 521 transitions, 8635 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-27 23:07:29,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:29,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:29,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:31,024 INFO L124 PetriNetUnfolderBase]: 4697/7211 cut-off events. [2024-06-27 23:07:31,024 INFO L125 PetriNetUnfolderBase]: For 518620/518664 co-relation queries the response was YES. [2024-06-27 23:07:31,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61165 conditions, 7211 events. 4697/7211 cut-off events. For 518620/518664 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 41929 event pairs, 1469 based on Foata normal form. 17/7187 useless extension candidates. Maximal degree in co-relation 61059. Up to 6479 conditions per place. [2024-06-27 23:07:31,107 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 478 selfloop transitions, 74 changer transitions 0/559 dead transitions. [2024-06-27 23:07:31,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 559 transitions, 9947 flow [2024-06-27 23:07:31,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-27 23:07:31,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44651162790697674 [2024-06-27 23:07:31,109 INFO L175 Difference]: Start difference. First operand has 227 places, 521 transitions, 8635 flow. Second operand 10 states and 192 transitions. [2024-06-27 23:07:31,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 559 transitions, 9947 flow [2024-06-27 23:07:31,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 559 transitions, 9347 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-27 23:07:31,979 INFO L231 Difference]: Finished difference. Result has 229 places, 521 transitions, 8208 flow [2024-06-27 23:07:31,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8039, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8208, PETRI_PLACES=229, PETRI_TRANSITIONS=521} [2024-06-27 23:07:31,979 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 185 predicate places. [2024-06-27 23:07:31,979 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 521 transitions, 8208 flow [2024-06-27 23:07:31,980 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-27 23:07:31,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:31,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:31,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 23:07:31,980 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:31,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1694357291, now seen corresponding path program 7 times [2024-06-27 23:07:31,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:31,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923880910] [2024-06-27 23:07:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:34,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923880910] [2024-06-27 23:07:34,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923880910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:34,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:34,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:34,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285583402] [2024-06-27 23:07:34,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:34,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:34,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:34,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:34,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:34,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:34,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 521 transitions, 8208 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:34,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:34,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:34,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:36,356 INFO L124 PetriNetUnfolderBase]: 4664/7168 cut-off events. [2024-06-27 23:07:36,356 INFO L125 PetriNetUnfolderBase]: For 524435/524475 co-relation queries the response was YES. [2024-06-27 23:07:36,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59427 conditions, 7168 events. 4664/7168 cut-off events. For 524435/524475 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 41713 event pairs, 1376 based on Foata normal form. 16/7139 useless extension candidates. Maximal degree in co-relation 59320. Up to 5582 conditions per place. [2024-06-27 23:07:36,434 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 364 selfloop transitions, 203 changer transitions 0/574 dead transitions. [2024-06-27 23:07:36,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 574 transitions, 9910 flow [2024-06-27 23:07:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:07:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:07:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2024-06-27 23:07:36,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142118863049095 [2024-06-27 23:07:36,436 INFO L175 Difference]: Start difference. First operand has 229 places, 521 transitions, 8208 flow. Second operand 9 states and 199 transitions. [2024-06-27 23:07:36,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 574 transitions, 9910 flow [2024-06-27 23:07:37,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 574 transitions, 9683 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-06-27 23:07:37,126 INFO L231 Difference]: Finished difference. Result has 231 places, 521 transitions, 8404 flow [2024-06-27 23:07:37,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7981, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8404, PETRI_PLACES=231, PETRI_TRANSITIONS=521} [2024-06-27 23:07:37,127 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 187 predicate places. [2024-06-27 23:07:37,127 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 521 transitions, 8404 flow [2024-06-27 23:07:37,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:37,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:37,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:37,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 23:07:37,128 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:37,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2032192811, now seen corresponding path program 8 times [2024-06-27 23:07:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915251853] [2024-06-27 23:07:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915251853] [2024-06-27 23:07:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915251853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:38,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:38,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844087892] [2024-06-27 23:07:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:38,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:38,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:38,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:38,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:38,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 521 transitions, 8404 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:38,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:38,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:38,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:40,594 INFO L124 PetriNetUnfolderBase]: 4915/7548 cut-off events. [2024-06-27 23:07:40,594 INFO L125 PetriNetUnfolderBase]: For 573287/573327 co-relation queries the response was YES. [2024-06-27 23:07:40,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63837 conditions, 7548 events. 4915/7548 cut-off events. For 573287/573327 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 44420 event pairs, 1503 based on Foata normal form. 14/7514 useless extension candidates. Maximal degree in co-relation 63730. Up to 6515 conditions per place. [2024-06-27 23:07:40,683 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 460 selfloop transitions, 118 changer transitions 0/585 dead transitions. [2024-06-27 23:07:40,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 585 transitions, 10635 flow [2024-06-27 23:07:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions. [2024-06-27 23:07:40,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790697674418605 [2024-06-27 23:07:40,686 INFO L175 Difference]: Start difference. First operand has 231 places, 521 transitions, 8404 flow. Second operand 10 states and 206 transitions. [2024-06-27 23:07:40,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 585 transitions, 10635 flow [2024-06-27 23:07:41,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 585 transitions, 10142 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-27 23:07:41,573 INFO L231 Difference]: Finished difference. Result has 234 places, 539 transitions, 8605 flow [2024-06-27 23:07:41,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7945, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8605, PETRI_PLACES=234, PETRI_TRANSITIONS=539} [2024-06-27 23:07:41,574 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 190 predicate places. [2024-06-27 23:07:41,574 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 539 transitions, 8605 flow [2024-06-27 23:07:41,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:41,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:41,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:41,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 23:07:41,574 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:41,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:41,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1699934997, now seen corresponding path program 1 times [2024-06-27 23:07:41,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:41,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869563008] [2024-06-27 23:07:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:42,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-27 23:07:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:42,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869563008] [2024-06-27 23:07:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869563008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:42,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:42,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782261703] [2024-06-27 23:07:42,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:42,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:42,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:42,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:42,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:42,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-27 23:07:42,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 539 transitions, 8605 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:07:42,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:42,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-27 23:07:42,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:44,825 INFO L124 PetriNetUnfolderBase]: 5745/8566 cut-off events. [2024-06-27 23:07:44,825 INFO L125 PetriNetUnfolderBase]: For 617658/617674 co-relation queries the response was YES. [2024-06-27 23:07:44,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71332 conditions, 8566 events. 5745/8566 cut-off events. For 617658/617674 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 47829 event pairs, 1764 based on Foata normal form. 4/8543 useless extension candidates. Maximal degree in co-relation 71222. Up to 8031 conditions per place. [2024-06-27 23:07:44,930 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 502 selfloop transitions, 84 changer transitions 0/591 dead transitions. [2024-06-27 23:07:44,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 591 transitions, 10201 flow [2024-06-27 23:07:44,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:07:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:07:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-27 23:07:44,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2024-06-27 23:07:44,931 INFO L175 Difference]: Start difference. First operand has 234 places, 539 transitions, 8605 flow. Second operand 8 states and 164 transitions. [2024-06-27 23:07:44,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 591 transitions, 10201 flow [2024-06-27 23:07:45,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 591 transitions, 10004 flow, removed 60 selfloop flow, removed 5 redundant places. [2024-06-27 23:07:45,862 INFO L231 Difference]: Finished difference. Result has 239 places, 560 transitions, 8888 flow [2024-06-27 23:07:45,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8412, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8888, PETRI_PLACES=239, PETRI_TRANSITIONS=560} [2024-06-27 23:07:45,862 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 195 predicate places. [2024-06-27 23:07:45,862 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 560 transitions, 8888 flow [2024-06-27 23:07:45,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:07:45,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:45,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:45,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 23:07:45,863 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:45,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash 244905165, now seen corresponding path program 9 times [2024-06-27 23:07:45,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:45,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008114744] [2024-06-27 23:07:45,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:47,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:47,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008114744] [2024-06-27 23:07:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008114744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:47,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:47,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110636395] [2024-06-27 23:07:47,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:47,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:47,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:47,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:47,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 560 transitions, 8888 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:47,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:47,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:47,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:49,799 INFO L124 PetriNetUnfolderBase]: 4991/7668 cut-off events. [2024-06-27 23:07:49,800 INFO L125 PetriNetUnfolderBase]: For 599858/599896 co-relation queries the response was YES. [2024-06-27 23:07:49,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65131 conditions, 7668 events. 4991/7668 cut-off events. For 599858/599896 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 45199 event pairs, 1486 based on Foata normal form. 32/7652 useless extension candidates. Maximal degree in co-relation 65018. Up to 6908 conditions per place. [2024-06-27 23:07:49,884 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 499 selfloop transitions, 87 changer transitions 0/594 dead transitions. [2024-06-27 23:07:49,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 594 transitions, 10263 flow [2024-06-27 23:07:49,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:07:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:07:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-27 23:07:49,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780361757105943 [2024-06-27 23:07:49,885 INFO L175 Difference]: Start difference. First operand has 239 places, 560 transitions, 8888 flow. Second operand 9 states and 185 transitions. [2024-06-27 23:07:49,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 594 transitions, 10263 flow [2024-06-27 23:07:50,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 594 transitions, 10079 flow, removed 48 selfloop flow, removed 3 redundant places. [2024-06-27 23:07:50,868 INFO L231 Difference]: Finished difference. Result has 245 places, 560 transitions, 8902 flow [2024-06-27 23:07:50,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8712, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8902, PETRI_PLACES=245, PETRI_TRANSITIONS=560} [2024-06-27 23:07:50,869 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 201 predicate places. [2024-06-27 23:07:50,869 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 560 transitions, 8902 flow [2024-06-27 23:07:50,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:50,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:50,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:50,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 23:07:50,870 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-27 23:07:50,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:50,870 INFO L85 PathProgramCache]: Analyzing trace with hash 842034433, now seen corresponding path program 10 times [2024-06-27 23:07:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:50,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856435515] [2024-06-27 23:07:50,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:50,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:52,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:52,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856435515] [2024-06-27 23:07:52,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856435515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:52,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:52,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:52,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297271117] [2024-06-27 23:07:52,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:52,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:52,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:52,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:52,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:52,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 560 transitions, 8902 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:52,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:52,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:52,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:54,532 INFO L124 PetriNetUnfolderBase]: 4906/7545 cut-off events. [2024-06-27 23:07:54,532 INFO L125 PetriNetUnfolderBase]: For 597299/597321 co-relation queries the response was YES. [2024-06-27 23:07:54,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63552 conditions, 7545 events. 4906/7545 cut-off events. For 597299/597321 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 44444 event pairs, 1453 based on Foata normal form. 16/7515 useless extension candidates. Maximal degree in co-relation 63438. Up to 6525 conditions per place. [2024-06-27 23:07:54,625 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 464 selfloop transitions, 128 changer transitions 0/600 dead transitions. [2024-06-27 23:07:54,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 600 transitions, 10531 flow [2024-06-27 23:07:54,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2024-06-27 23:07:54,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697674418604651 [2024-06-27 23:07:54,627 INFO L175 Difference]: Start difference. First operand has 245 places, 560 transitions, 8902 flow. Second operand 10 states and 202 transitions. [2024-06-27 23:07:54,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 600 transitions, 10531 flow [2024-06-27 23:07:55,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 600 transitions, 10297 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-27 23:07:55,679 INFO L231 Difference]: Finished difference. Result has 247 places, 560 transitions, 8937 flow [2024-06-27 23:07:55,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8668, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8937, PETRI_PLACES=247, PETRI_TRANSITIONS=560} [2024-06-27 23:07:55,679 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 203 predicate places. [2024-06-27 23:07:55,679 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 560 transitions, 8937 flow [2024-06-27 23:07:55,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:55,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:55,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:55,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 23:07:55,680 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:55,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash 311795171, now seen corresponding path program 1 times [2024-06-27 23:07:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:55,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326655145] [2024-06-27 23:07:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:55,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:07:56,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:56,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326655145] [2024-06-27 23:07:56,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326655145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:56,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:56,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:07:56,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179818526] [2024-06-27 23:07:56,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:56,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:07:56,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:07:56,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:07:56,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:56,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 560 transitions, 8937 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:56,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:56,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:56,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:58,102 INFO L124 PetriNetUnfolderBase]: 5164/7867 cut-off events. [2024-06-27 23:07:58,102 INFO L125 PetriNetUnfolderBase]: For 617836/618101 co-relation queries the response was YES. [2024-06-27 23:07:58,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65844 conditions, 7867 events. 5164/7867 cut-off events. For 617836/618101 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 45409 event pairs, 1755 based on Foata normal form. 58/7815 useless extension candidates. Maximal degree in co-relation 65728. Up to 7166 conditions per place. [2024-06-27 23:07:58,201 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 439 selfloop transitions, 25 changer transitions 0/584 dead transitions. [2024-06-27 23:07:58,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 584 transitions, 10115 flow [2024-06-27 23:07:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:07:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:07:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 23:07:58,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518272425249167 [2024-06-27 23:07:58,201 INFO L175 Difference]: Start difference. First operand has 247 places, 560 transitions, 8937 flow. Second operand 7 states and 134 transitions. [2024-06-27 23:07:58,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 584 transitions, 10115 flow [2024-06-27 23:07:59,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 584 transitions, 9844 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-27 23:07:59,413 INFO L231 Difference]: Finished difference. Result has 247 places, 566 transitions, 8789 flow [2024-06-27 23:07:59,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8666, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8789, PETRI_PLACES=247, PETRI_TRANSITIONS=566} [2024-06-27 23:07:59,414 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 203 predicate places. [2024-06-27 23:07:59,414 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 566 transitions, 8789 flow [2024-06-27 23:07:59,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:07:59,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:59,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:59,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 23:07:59,415 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:59,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:59,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2140049021, now seen corresponding path program 11 times [2024-06-27 23:07:59,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:59,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776703081] [2024-06-27 23:07:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:01,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776703081] [2024-06-27 23:08:01,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776703081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:01,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:01,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:08:01,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898619954] [2024-06-27 23:08:01,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:01,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:08:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:08:01,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:08:01,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:01,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 566 transitions, 8789 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-27 23:08:01,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:01,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:01,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:03,335 INFO L124 PetriNetUnfolderBase]: 5008/7706 cut-off events. [2024-06-27 23:08:03,335 INFO L125 PetriNetUnfolderBase]: For 633104/633159 co-relation queries the response was YES. [2024-06-27 23:08:03,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64390 conditions, 7706 events. 5008/7706 cut-off events. For 633104/633159 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 45685 event pairs, 1714 based on Foata normal form. 17/7661 useless extension candidates. Maximal degree in co-relation 64273. Up to 6906 conditions per place. [2024-06-27 23:08:03,415 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 525 selfloop transitions, 72 changer transitions 0/607 dead transitions. [2024-06-27 23:08:03,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 607 transitions, 10261 flow [2024-06-27 23:08:03,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:08:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:08:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-27 23:08:03,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255813953488372 [2024-06-27 23:08:03,416 INFO L175 Difference]: Start difference. First operand has 247 places, 566 transitions, 8789 flow. Second operand 10 states and 183 transitions. [2024-06-27 23:08:03,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 607 transitions, 10261 flow [2024-06-27 23:08:04,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 607 transitions, 10168 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 23:08:04,518 INFO L231 Difference]: Finished difference. Result has 254 places, 575 transitions, 8990 flow [2024-06-27 23:08:04,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8696, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8990, PETRI_PLACES=254, PETRI_TRANSITIONS=575} [2024-06-27 23:08:04,519 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 210 predicate places. [2024-06-27 23:08:04,519 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 575 transitions, 8990 flow [2024-06-27 23:08:04,519 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-27 23:08:04,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:04,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:04,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 23:08:04,519 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:04,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash -128653393, now seen corresponding path program 12 times [2024-06-27 23:08:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:04,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380564977] [2024-06-27 23:08:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:04,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:06,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:06,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380564977] [2024-06-27 23:08:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380564977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034560877] [2024-06-27 23:08:06,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:06,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:06,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:06,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:06,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:06,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 575 transitions, 8990 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:06,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:06,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:06,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:08,612 INFO L124 PetriNetUnfolderBase]: 5375/8261 cut-off events. [2024-06-27 23:08:08,613 INFO L125 PetriNetUnfolderBase]: For 675977/676035 co-relation queries the response was YES. [2024-06-27 23:08:08,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68929 conditions, 8261 events. 5375/8261 cut-off events. For 675977/676035 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 49710 event pairs, 1676 based on Foata normal form. 30/8218 useless extension candidates. Maximal degree in co-relation 68810. Up to 6250 conditions per place. [2024-06-27 23:08:08,714 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 417 selfloop transitions, 232 changer transitions 0/659 dead transitions. [2024-06-27 23:08:08,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 659 transitions, 11567 flow [2024-06-27 23:08:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-27 23:08:08,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909560723514212 [2024-06-27 23:08:08,716 INFO L175 Difference]: Start difference. First operand has 254 places, 575 transitions, 8990 flow. Second operand 9 states and 190 transitions. [2024-06-27 23:08:08,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 659 transitions, 11567 flow [2024-06-27 23:08:10,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 659 transitions, 11442 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 23:08:10,021 INFO L231 Difference]: Finished difference. Result has 258 places, 608 transitions, 10030 flow [2024-06-27 23:08:10,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8865, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10030, PETRI_PLACES=258, PETRI_TRANSITIONS=608} [2024-06-27 23:08:10,021 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 214 predicate places. [2024-06-27 23:08:10,021 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 608 transitions, 10030 flow [2024-06-27 23:08:10,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:10,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:10,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:10,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 23:08:10,022 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:10,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash -128647813, now seen corresponding path program 13 times [2024-06-27 23:08:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:10,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698090309] [2024-06-27 23:08:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:12,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698090309] [2024-06-27 23:08:12,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698090309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:12,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:12,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030424782] [2024-06-27 23:08:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:12,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:12,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:12,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:12,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:12,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:12,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 608 transitions, 10030 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:12,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:12,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:12,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:14,063 INFO L124 PetriNetUnfolderBase]: 5343/8217 cut-off events. [2024-06-27 23:08:14,064 INFO L125 PetriNetUnfolderBase]: For 683303/683345 co-relation queries the response was YES. [2024-06-27 23:08:14,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69974 conditions, 8217 events. 5343/8217 cut-off events. For 683303/683345 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 49400 event pairs, 1670 based on Foata normal form. 12/8156 useless extension candidates. Maximal degree in co-relation 69852. Up to 6230 conditions per place. [2024-06-27 23:08:14,158 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 409 selfloop transitions, 237 changer transitions 0/656 dead transitions. [2024-06-27 23:08:14,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 656 transitions, 11890 flow [2024-06-27 23:08:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-27 23:08:14,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2024-06-27 23:08:14,160 INFO L175 Difference]: Start difference. First operand has 258 places, 608 transitions, 10030 flow. Second operand 9 states and 186 transitions. [2024-06-27 23:08:14,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 656 transitions, 11890 flow [2024-06-27 23:08:15,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 656 transitions, 11414 flow, removed 88 selfloop flow, removed 5 redundant places. [2024-06-27 23:08:15,455 INFO L231 Difference]: Finished difference. Result has 262 places, 608 transitions, 10048 flow [2024-06-27 23:08:15,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9554, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10048, PETRI_PLACES=262, PETRI_TRANSITIONS=608} [2024-06-27 23:08:15,456 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 218 predicate places. [2024-06-27 23:08:15,456 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 608 transitions, 10048 flow [2024-06-27 23:08:15,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:15,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:15,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:15,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 23:08:15,456 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:15,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash 15444527, now seen corresponding path program 14 times [2024-06-27 23:08:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:15,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544888200] [2024-06-27 23:08:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:15,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:16,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:16,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544888200] [2024-06-27 23:08:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544888200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:16,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:16,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:16,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637486363] [2024-06-27 23:08:16,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:16,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:16,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:17,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:17,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 608 transitions, 10048 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:17,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:17,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:17,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:18,997 INFO L124 PetriNetUnfolderBase]: 5462/8412 cut-off events. [2024-06-27 23:08:18,997 INFO L125 PetriNetUnfolderBase]: For 721987/722029 co-relation queries the response was YES. [2024-06-27 23:08:19,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71545 conditions, 8412 events. 5462/8412 cut-off events. For 721987/722029 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 51030 event pairs, 1881 based on Foata normal form. 16/8355 useless extension candidates. Maximal degree in co-relation 71422. Up to 7567 conditions per place. [2024-06-27 23:08:19,102 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 556 selfloop transitions, 81 changer transitions 0/647 dead transitions. [2024-06-27 23:08:19,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 647 transitions, 11723 flow [2024-06-27 23:08:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-27 23:08:19,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2024-06-27 23:08:19,103 INFO L175 Difference]: Start difference. First operand has 262 places, 608 transitions, 10048 flow. Second operand 9 states and 174 transitions. [2024-06-27 23:08:19,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 647 transitions, 11723 flow [2024-06-27 23:08:20,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 647 transitions, 11207 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 23:08:20,152 INFO L231 Difference]: Finished difference. Result has 263 places, 617 transitions, 9979 flow [2024-06-27 23:08:20,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9550, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9979, PETRI_PLACES=263, PETRI_TRANSITIONS=617} [2024-06-27 23:08:20,152 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 219 predicate places. [2024-06-27 23:08:20,152 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 617 transitions, 9979 flow [2024-06-27 23:08:20,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:20,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:20,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:20,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 23:08:20,153 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:20,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 15237137, now seen corresponding path program 15 times [2024-06-27 23:08:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450010003] [2024-06-27 23:08:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:21,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450010003] [2024-06-27 23:08:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450010003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:21,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674217047] [2024-06-27 23:08:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:21,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:21,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:21,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:22,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:22,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 617 transitions, 9979 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:22,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:22,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:22,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:24,267 INFO L124 PetriNetUnfolderBase]: 5585/8596 cut-off events. [2024-06-27 23:08:24,268 INFO L125 PetriNetUnfolderBase]: For 745723/745781 co-relation queries the response was YES. [2024-06-27 23:08:24,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73017 conditions, 8596 events. 5585/8596 cut-off events. For 745723/745781 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 52333 event pairs, 1810 based on Foata normal form. 25/8542 useless extension candidates. Maximal degree in co-relation 72893. Up to 7590 conditions per place. [2024-06-27 23:08:24,378 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 555 selfloop transitions, 122 changer transitions 0/687 dead transitions. [2024-06-27 23:08:24,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 687 transitions, 12584 flow [2024-06-27 23:08:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-27 23:08:24,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625322997416021 [2024-06-27 23:08:24,380 INFO L175 Difference]: Start difference. First operand has 263 places, 617 transitions, 9979 flow. Second operand 9 states and 179 transitions. [2024-06-27 23:08:24,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 687 transitions, 12584 flow [2024-06-27 23:08:25,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 687 transitions, 12057 flow, removed 128 selfloop flow, removed 9 redundant places. [2024-06-27 23:08:25,774 INFO L231 Difference]: Finished difference. Result has 264 places, 651 transitions, 10613 flow [2024-06-27 23:08:25,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9576, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10613, PETRI_PLACES=264, PETRI_TRANSITIONS=651} [2024-06-27 23:08:25,774 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 220 predicate places. [2024-06-27 23:08:25,775 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 651 transitions, 10613 flow [2024-06-27 23:08:25,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:25,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:25,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:25,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 23:08:25,775 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-27 23:08:25,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 15242717, now seen corresponding path program 16 times [2024-06-27 23:08:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343349784] [2024-06-27 23:08:25,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:27,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:27,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343349784] [2024-06-27 23:08:27,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343349784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:27,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:27,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950861623] [2024-06-27 23:08:27,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:27,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:27,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:27,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:27,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 651 transitions, 10613 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:27,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:27,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:27,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:29,833 INFO L124 PetriNetUnfolderBase]: 5552/8557 cut-off events. [2024-06-27 23:08:29,833 INFO L125 PetriNetUnfolderBase]: For 746878/746920 co-relation queries the response was YES. [2024-06-27 23:08:29,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73007 conditions, 8557 events. 5552/8557 cut-off events. For 746878/746920 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 52157 event pairs, 1824 based on Foata normal form. 8/8488 useless extension candidates. Maximal degree in co-relation 72883. Up to 7556 conditions per place. [2024-06-27 23:08:29,925 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 560 selfloop transitions, 118 changer transitions 0/688 dead transitions. [2024-06-27 23:08:29,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 688 transitions, 12223 flow [2024-06-27 23:08:29,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-27 23:08:29,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599483204134367 [2024-06-27 23:08:29,928 INFO L175 Difference]: Start difference. First operand has 264 places, 651 transitions, 10613 flow. Second operand 9 states and 178 transitions. [2024-06-27 23:08:29,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 688 transitions, 12223 flow [2024-06-27 23:08:31,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 688 transitions, 11876 flow, removed 122 selfloop flow, removed 5 redundant places. [2024-06-27 23:08:31,196 INFO L231 Difference]: Finished difference. Result has 268 places, 652 transitions, 10527 flow [2024-06-27 23:08:31,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10268, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10527, PETRI_PLACES=268, PETRI_TRANSITIONS=652} [2024-06-27 23:08:31,196 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 224 predicate places. [2024-06-27 23:08:31,196 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 652 transitions, 10527 flow [2024-06-27 23:08:31,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:31,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:31,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:31,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 23:08:31,197 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:31,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash -140634161, now seen corresponding path program 1 times [2024-06-27 23:08:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775112603] [2024-06-27 23:08:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775112603] [2024-06-27 23:08:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775112603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:32,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:08:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123508444] [2024-06-27 23:08:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:32,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:08:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:32,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:08:32,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:08:32,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:32,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 652 transitions, 10527 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:32,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:32,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:32,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:34,116 INFO L124 PetriNetUnfolderBase]: 5956/8985 cut-off events. [2024-06-27 23:08:34,117 INFO L125 PetriNetUnfolderBase]: For 786437/786941 co-relation queries the response was YES. [2024-06-27 23:08:34,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76064 conditions, 8985 events. 5956/8985 cut-off events. For 786437/786941 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 52728 event pairs, 2173 based on Foata normal form. 172/8978 useless extension candidates. Maximal degree in co-relation 75938. Up to 8265 conditions per place. [2024-06-27 23:08:34,226 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 526 selfloop transitions, 31 changer transitions 0/681 dead transitions. [2024-06-27 23:08:34,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 681 transitions, 12072 flow [2024-06-27 23:08:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:08:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:08:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 23:08:34,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2024-06-27 23:08:34,227 INFO L175 Difference]: Start difference. First operand has 268 places, 652 transitions, 10527 flow. Second operand 7 states and 132 transitions. [2024-06-27 23:08:34,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 681 transitions, 12072 flow [2024-06-27 23:08:35,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 681 transitions, 11873 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-27 23:08:35,492 INFO L231 Difference]: Finished difference. Result has 271 places, 667 transitions, 10570 flow [2024-06-27 23:08:35,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10328, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10570, PETRI_PLACES=271, PETRI_TRANSITIONS=667} [2024-06-27 23:08:35,493 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 227 predicate places. [2024-06-27 23:08:35,493 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 667 transitions, 10570 flow [2024-06-27 23:08:35,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:35,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:35,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:35,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 23:08:35,493 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:35,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1667104623, now seen corresponding path program 2 times [2024-06-27 23:08:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:35,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69479948] [2024-06-27 23:08:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:36,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:36,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69479948] [2024-06-27 23:08:36,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69479948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:36,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:36,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:08:36,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289115646] [2024-06-27 23:08:36,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:36,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:08:36,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:36,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:08:36,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:08:36,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:36,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 667 transitions, 10570 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:36,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:36,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:36,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:38,169 INFO L124 PetriNetUnfolderBase]: 5951/8984 cut-off events. [2024-06-27 23:08:38,169 INFO L125 PetriNetUnfolderBase]: For 804790/805292 co-relation queries the response was YES. [2024-06-27 23:08:38,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76298 conditions, 8984 events. 5951/8984 cut-off events. For 804790/805292 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 52761 event pairs, 2157 based on Foata normal form. 172/8985 useless extension candidates. Maximal degree in co-relation 76168. Up to 8275 conditions per place. [2024-06-27 23:08:38,292 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 531 selfloop transitions, 24 changer transitions 0/679 dead transitions. [2024-06-27 23:08:38,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 679 transitions, 11852 flow [2024-06-27 23:08:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:08:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:08:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-27 23:08:38,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44573643410852715 [2024-06-27 23:08:38,293 INFO L175 Difference]: Start difference. First operand has 271 places, 667 transitions, 10570 flow. Second operand 6 states and 115 transitions. [2024-06-27 23:08:38,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 679 transitions, 11852 flow [2024-06-27 23:08:39,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 679 transitions, 11799 flow, removed 25 selfloop flow, removed 1 redundant places. [2024-06-27 23:08:39,820 INFO L231 Difference]: Finished difference. Result has 276 places, 667 transitions, 10575 flow [2024-06-27 23:08:39,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10517, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10575, PETRI_PLACES=276, PETRI_TRANSITIONS=667} [2024-06-27 23:08:39,821 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 232 predicate places. [2024-06-27 23:08:39,821 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 667 transitions, 10575 flow [2024-06-27 23:08:39,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:39,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:39,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:39,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 23:08:39,821 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-27 23:08:39,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1040702941, now seen corresponding path program 17 times [2024-06-27 23:08:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960288606] [2024-06-27 23:08:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:41,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:41,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960288606] [2024-06-27 23:08:41,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960288606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:41,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:41,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:41,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104260708] [2024-06-27 23:08:41,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:41,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:41,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:41,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:41,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:41,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:41,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 667 transitions, 10575 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:41,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:41,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:41,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:43,953 INFO L124 PetriNetUnfolderBase]: 6013/9231 cut-off events. [2024-06-27 23:08:43,953 INFO L125 PetriNetUnfolderBase]: For 912792/912831 co-relation queries the response was YES. [2024-06-27 23:08:44,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82334 conditions, 9231 events. 6013/9231 cut-off events. For 912792/912831 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 56581 event pairs, 1990 based on Foata normal form. 16/9170 useless extension candidates. Maximal degree in co-relation 82201. Up to 7929 conditions per place. [2024-06-27 23:08:44,060 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 630 selfloop transitions, 93 changer transitions 0/735 dead transitions. [2024-06-27 23:08:44,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 735 transitions, 13550 flow [2024-06-27 23:08:44,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-06-27 23:08:44,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46770025839793283 [2024-06-27 23:08:44,061 INFO L175 Difference]: Start difference. First operand has 276 places, 667 transitions, 10575 flow. Second operand 9 states and 181 transitions. [2024-06-27 23:08:44,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 735 transitions, 13550 flow [2024-06-27 23:08:45,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 735 transitions, 13511 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 23:08:45,624 INFO L231 Difference]: Finished difference. Result has 281 places, 694 transitions, 11530 flow [2024-06-27 23:08:45,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10536, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11530, PETRI_PLACES=281, PETRI_TRANSITIONS=694} [2024-06-27 23:08:45,624 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 237 predicate places. [2024-06-27 23:08:45,624 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 694 transitions, 11530 flow [2024-06-27 23:08:45,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:45,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:45,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:45,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 23:08:45,625 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-27 23:08:45,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1040697361, now seen corresponding path program 18 times [2024-06-27 23:08:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832083808] [2024-06-27 23:08:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:47,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832083808] [2024-06-27 23:08:47,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832083808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:47,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:47,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:47,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388304984] [2024-06-27 23:08:47,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:47,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:47,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:47,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:47,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:47,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:47,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 694 transitions, 11530 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:47,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:47,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:47,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:49,818 INFO L124 PetriNetUnfolderBase]: 5964/9164 cut-off events. [2024-06-27 23:08:49,818 INFO L125 PetriNetUnfolderBase]: For 912562/912601 co-relation queries the response was YES. [2024-06-27 23:08:49,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81633 conditions, 9164 events. 5964/9164 cut-off events. For 912562/912601 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 56226 event pairs, 1951 based on Foata normal form. 18/9105 useless extension candidates. Maximal degree in co-relation 81499. Up to 7897 conditions per place. [2024-06-27 23:08:49,947 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 619 selfloop transitions, 99 changer transitions 0/730 dead transitions. [2024-06-27 23:08:49,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 730 transitions, 13444 flow [2024-06-27 23:08:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-27 23:08:49,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573643410852713 [2024-06-27 23:08:49,950 INFO L175 Difference]: Start difference. First operand has 281 places, 694 transitions, 11530 flow. Second operand 9 states and 177 transitions. [2024-06-27 23:08:49,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 730 transitions, 13444 flow [2024-06-27 23:08:51,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 730 transitions, 13090 flow, removed 159 selfloop flow, removed 4 redundant places. [2024-06-27 23:08:51,720 INFO L231 Difference]: Finished difference. Result has 286 places, 694 transitions, 11390 flow [2024-06-27 23:08:51,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11176, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11390, PETRI_PLACES=286, PETRI_TRANSITIONS=694} [2024-06-27 23:08:51,721 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 242 predicate places. [2024-06-27 23:08:51,721 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 694 transitions, 11390 flow [2024-06-27 23:08:51,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:51,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:51,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:51,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 23:08:51,722 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:51,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:51,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1040904751, now seen corresponding path program 19 times [2024-06-27 23:08:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:51,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243510259] [2024-06-27 23:08:51,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:53,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:53,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243510259] [2024-06-27 23:08:53,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243510259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:53,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:53,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:53,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629585224] [2024-06-27 23:08:53,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:53,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:53,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:53,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:53,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:53,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:53,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 694 transitions, 11390 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:53,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:53,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:53,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:55,582 INFO L124 PetriNetUnfolderBase]: 5968/9174 cut-off events. [2024-06-27 23:08:55,582 INFO L125 PetriNetUnfolderBase]: For 910661/910700 co-relation queries the response was YES. [2024-06-27 23:08:55,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80998 conditions, 9174 events. 5968/9174 cut-off events. For 910661/910700 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 56503 event pairs, 2066 based on Foata normal form. 16/9107 useless extension candidates. Maximal degree in co-relation 80862. Up to 8386 conditions per place. [2024-06-27 23:08:55,699 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 671 selfloop transitions, 50 changer transitions 0/733 dead transitions. [2024-06-27 23:08:55,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 733 transitions, 13286 flow [2024-06-27 23:08:55,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-27 23:08:55,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-27 23:08:55,700 INFO L175 Difference]: Start difference. First operand has 286 places, 694 transitions, 11390 flow. Second operand 9 states and 171 transitions. [2024-06-27 23:08:55,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 733 transitions, 13286 flow [2024-06-27 23:08:57,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 733 transitions, 13034 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-27 23:08:57,116 INFO L231 Difference]: Finished difference. Result has 288 places, 703 transitions, 11548 flow [2024-06-27 23:08:57,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11177, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11548, PETRI_PLACES=288, PETRI_TRANSITIONS=703} [2024-06-27 23:08:57,117 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 244 predicate places. [2024-06-27 23:08:57,117 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 703 transitions, 11548 flow [2024-06-27 23:08:57,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:57,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:57,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:57,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 23:08:57,117 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-27 23:08:57,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1297405261, now seen corresponding path program 20 times [2024-06-27 23:08:57,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:57,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33389125] [2024-06-27 23:08:57,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:57,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:08:58,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:58,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33389125] [2024-06-27 23:08:58,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33389125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:58,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:58,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:58,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466540823] [2024-06-27 23:08:58,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:58,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:58,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:58,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:58,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:58,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:58,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 703 transitions, 11548 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:08:58,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:58,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:58,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:00,876 INFO L124 PetriNetUnfolderBase]: 5924/9111 cut-off events. [2024-06-27 23:09:00,876 INFO L125 PetriNetUnfolderBase]: For 899307/899346 co-relation queries the response was YES. [2024-06-27 23:09:00,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79339 conditions, 9111 events. 5924/9111 cut-off events. For 899307/899346 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 56094 event pairs, 2056 based on Foata normal form. 16/9044 useless extension candidates. Maximal degree in co-relation 79202. Up to 8351 conditions per place. [2024-06-27 23:09:01,005 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 681 selfloop transitions, 39 changer transitions 0/732 dead transitions. [2024-06-27 23:09:01,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 732 transitions, 13163 flow [2024-06-27 23:09:01,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:09:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:09:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 23:09:01,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43669250645994834 [2024-06-27 23:09:01,007 INFO L175 Difference]: Start difference. First operand has 288 places, 703 transitions, 11548 flow. Second operand 9 states and 169 transitions. [2024-06-27 23:09:01,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 732 transitions, 13163 flow [2024-06-27 23:09:02,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 732 transitions, 12871 flow, removed 102 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:02,666 INFO L231 Difference]: Finished difference. Result has 290 places, 703 transitions, 11350 flow [2024-06-27 23:09:02,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11256, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11350, PETRI_PLACES=290, PETRI_TRANSITIONS=703} [2024-06-27 23:09:02,666 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 246 predicate places. [2024-06-27 23:09:02,667 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 703 transitions, 11350 flow [2024-06-27 23:09:02,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:02,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:02,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:02,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 23:09:02,667 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:02,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1306936397, now seen corresponding path program 2 times [2024-06-27 23:09:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:02,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812496266] [2024-06-27 23:09:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:03,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-27 23:09:03,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:03,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812496266] [2024-06-27 23:09:03,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812496266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:03,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:03,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:03,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910824606] [2024-06-27 23:09:03,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:03,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:03,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:03,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:03,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-27 23:09:03,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 703 transitions, 11350 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:09:03,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:03,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-27 23:09:03,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:06,213 INFO L124 PetriNetUnfolderBase]: 7083/10547 cut-off events. [2024-06-27 23:09:06,213 INFO L125 PetriNetUnfolderBase]: For 887336/887347 co-relation queries the response was YES. [2024-06-27 23:09:06,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87909 conditions, 10547 events. 7083/10547 cut-off events. For 887336/887347 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 61214 event pairs, 2669 based on Foata normal form. 2/10523 useless extension candidates. Maximal degree in co-relation 87771. Up to 10154 conditions per place. [2024-06-27 23:09:06,360 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 701 selfloop transitions, 31 changer transitions 0/741 dead transitions. [2024-06-27 23:09:06,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 741 transitions, 13227 flow [2024-06-27 23:09:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:09:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:09:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 23:09:06,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4108527131782946 [2024-06-27 23:09:06,362 INFO L175 Difference]: Start difference. First operand has 290 places, 703 transitions, 11350 flow. Second operand 9 states and 159 transitions. [2024-06-27 23:09:06,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 741 transitions, 13227 flow [2024-06-27 23:09:08,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 741 transitions, 13014 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-27 23:09:08,137 INFO L231 Difference]: Finished difference. Result has 291 places, 715 transitions, 11490 flow [2024-06-27 23:09:08,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11155, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11490, PETRI_PLACES=291, PETRI_TRANSITIONS=715} [2024-06-27 23:09:08,137 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 247 predicate places. [2024-06-27 23:09:08,138 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 715 transitions, 11490 flow [2024-06-27 23:09:08,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:09:08,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:08,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:08,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 23:09:08,138 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:08,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash -323901903, now seen corresponding path program 3 times [2024-06-27 23:09:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:08,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325143653] [2024-06-27 23:09:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:08,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:09:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:08,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325143653] [2024-06-27 23:09:08,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325143653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:08,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:08,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:09:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84529542] [2024-06-27 23:09:08,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:08,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:09:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:08,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:09:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:09:08,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:08,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 715 transitions, 11490 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:08,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:08,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:08,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:10,930 INFO L124 PetriNetUnfolderBase]: 6376/9616 cut-off events. [2024-06-27 23:09:10,930 INFO L125 PetriNetUnfolderBase]: For 921636/922144 co-relation queries the response was YES. [2024-06-27 23:09:11,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82416 conditions, 9616 events. 6376/9616 cut-off events. For 921636/922144 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 57234 event pairs, 2323 based on Foata normal form. 148/9569 useless extension candidates. Maximal degree in co-relation 82276. Up to 8916 conditions per place. [2024-06-27 23:09:11,067 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 586 selfloop transitions, 13 changer transitions 0/723 dead transitions. [2024-06-27 23:09:11,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 723 transitions, 12726 flow [2024-06-27 23:09:11,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:09:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:09:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-27 23:09:11,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-27 23:09:11,068 INFO L175 Difference]: Start difference. First operand has 291 places, 715 transitions, 11490 flow. Second operand 6 states and 108 transitions. [2024-06-27 23:09:11,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 723 transitions, 12726 flow [2024-06-27 23:09:12,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 723 transitions, 12612 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-27 23:09:12,941 INFO L231 Difference]: Finished difference. Result has 292 places, 715 transitions, 11408 flow [2024-06-27 23:09:12,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11376, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11408, PETRI_PLACES=292, PETRI_TRANSITIONS=715} [2024-06-27 23:09:12,941 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 248 predicate places. [2024-06-27 23:09:12,942 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 715 transitions, 11408 flow [2024-06-27 23:09:12,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:12,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:12,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:12,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 23:09:12,942 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:12,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash 727251693, now seen corresponding path program 1 times [2024-06-27 23:09:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:12,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324966551] [2024-06-27 23:09:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:09:13,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:13,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324966551] [2024-06-27 23:09:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324966551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:09:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184987698] [2024-06-27 23:09:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:13,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:09:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:13,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:09:13,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:09:13,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-27 23:09:13,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 715 transitions, 11408 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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-27 23:09:13,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:13,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-27 23:09:13,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:16,345 INFO L124 PetriNetUnfolderBase]: 7266/10740 cut-off events. [2024-06-27 23:09:16,345 INFO L125 PetriNetUnfolderBase]: For 893756/893756 co-relation queries the response was YES. [2024-06-27 23:09:16,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89301 conditions, 10740 events. 7266/10740 cut-off events. For 893756/893756 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 61401 event pairs, 2789 based on Foata normal form. 1/10739 useless extension candidates. Maximal degree in co-relation 89160. Up to 10521 conditions per place. [2024-06-27 23:09:16,465 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 712 selfloop transitions, 18 changer transitions 0/733 dead transitions. [2024-06-27 23:09:16,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 733 transitions, 13130 flow [2024-06-27 23:09:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:09:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:09:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-27 23:09:16,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40310077519379844 [2024-06-27 23:09:16,466 INFO L175 Difference]: Start difference. First operand has 292 places, 715 transitions, 11408 flow. Second operand 6 states and 104 transitions. [2024-06-27 23:09:16,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 733 transitions, 13130 flow [2024-06-27 23:09:18,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 733 transitions, 13087 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 23:09:18,233 INFO L231 Difference]: Finished difference. Result has 293 places, 721 transitions, 11475 flow [2024-06-27 23:09:18,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11365, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11475, PETRI_PLACES=293, PETRI_TRANSITIONS=721} [2024-06-27 23:09:18,233 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 249 predicate places. [2024-06-27 23:09:18,234 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 721 transitions, 11475 flow [2024-06-27 23:09:18,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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-27 23:09:18,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:18,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:18,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 23:09:18,234 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:18,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash -278920159, now seen corresponding path program 2 times [2024-06-27 23:09:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:18,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158184803] [2024-06-27 23:09:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:18,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:19,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-27 23:09:19,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158184803] [2024-06-27 23:09:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158184803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:19,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:09:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907150784] [2024-06-27 23:09:19,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:19,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:09:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:09:19,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:09:19,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-27 23:09:19,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 721 transitions, 11475 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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-27 23:09:19,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:19,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-27 23:09:19,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:21,533 INFO L124 PetriNetUnfolderBase]: 7263/10737 cut-off events. [2024-06-27 23:09:21,533 INFO L125 PetriNetUnfolderBase]: For 915087/915090 co-relation queries the response was YES. [2024-06-27 23:09:21,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89932 conditions, 10737 events. 7263/10737 cut-off events. For 915087/915090 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 61441 event pairs, 2792 based on Foata normal form. 3/10737 useless extension candidates. Maximal degree in co-relation 89789. Up to 10518 conditions per place. [2024-06-27 23:09:21,664 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 708 selfloop transitions, 18 changer transitions 0/729 dead transitions. [2024-06-27 23:09:21,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 729 transitions, 12965 flow [2024-06-27 23:09:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:09:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:09:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-27 23:09:21,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875968992248062 [2024-06-27 23:09:21,665 INFO L175 Difference]: Start difference. First operand has 293 places, 721 transitions, 11475 flow. Second operand 6 states and 100 transitions. [2024-06-27 23:09:21,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 729 transitions, 12965 flow [2024-06-27 23:09:23,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 729 transitions, 12940 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 23:09:23,508 INFO L231 Difference]: Finished difference. Result has 297 places, 721 transitions, 11494 flow [2024-06-27 23:09:23,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11450, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11494, PETRI_PLACES=297, PETRI_TRANSITIONS=721} [2024-06-27 23:09:23,508 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 253 predicate places. [2024-06-27 23:09:23,509 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 721 transitions, 11494 flow [2024-06-27 23:09:23,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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-27 23:09:23,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:23,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:23,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 23:09:23,509 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:23,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1924486635, now seen corresponding path program 1 times [2024-06-27 23:09:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:23,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430195322] [2024-06-27 23:09:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:23,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:09:24,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:24,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430195322] [2024-06-27 23:09:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430195322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839696436] [2024-06-27 23:09:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:24,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:24,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:24,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 721 transitions, 11494 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:24,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:24,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:24,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:26,991 INFO L124 PetriNetUnfolderBase]: 6099/9345 cut-off events. [2024-06-27 23:09:26,991 INFO L125 PetriNetUnfolderBase]: For 1008399/1008434 co-relation queries the response was YES. [2024-06-27 23:09:27,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83258 conditions, 9345 events. 6099/9345 cut-off events. For 1008399/1008434 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 57753 event pairs, 1642 based on Foata normal form. 8/9245 useless extension candidates. Maximal degree in co-relation 83111. Up to 8286 conditions per place. [2024-06-27 23:09:27,119 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 628 selfloop transitions, 135 changer transitions 0/778 dead transitions. [2024-06-27 23:09:27,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 778 transitions, 13665 flow [2024-06-27 23:09:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:09:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:09:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2024-06-27 23:09:27,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47357293868921774 [2024-06-27 23:09:27,120 INFO L175 Difference]: Start difference. First operand has 297 places, 721 transitions, 11494 flow. Second operand 11 states and 224 transitions. [2024-06-27 23:09:27,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 778 transitions, 13665 flow [2024-06-27 23:09:29,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 778 transitions, 13627 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 23:09:29,170 INFO L231 Difference]: Finished difference. Result has 306 places, 727 transitions, 11868 flow [2024-06-27 23:09:29,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11456, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11868, PETRI_PLACES=306, PETRI_TRANSITIONS=727} [2024-06-27 23:09:29,171 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 262 predicate places. [2024-06-27 23:09:29,171 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 727 transitions, 11868 flow [2024-06-27 23:09:29,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:29,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:29,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:29,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 23:09:29,171 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:29,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1032852997, now seen corresponding path program 2 times [2024-06-27 23:09:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:29,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062246186] [2024-06-27 23:09:29,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:29,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:09:30,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:30,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062246186] [2024-06-27 23:09:30,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062246186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:30,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:30,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011630651] [2024-06-27 23:09:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:30,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:30,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:30,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:30,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 727 transitions, 11868 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:30,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:30,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:30,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:32,809 INFO L124 PetriNetUnfolderBase]: 6072/9322 cut-off events. [2024-06-27 23:09:32,809 INFO L125 PetriNetUnfolderBase]: For 1001067/1001092 co-relation queries the response was YES. [2024-06-27 23:09:32,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83372 conditions, 9322 events. 6072/9322 cut-off events. For 1001067/1001092 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 57592 event pairs, 1680 based on Foata normal form. 8/9241 useless extension candidates. Maximal degree in co-relation 83223. Up to 8317 conditions per place. [2024-06-27 23:09:32,952 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 629 selfloop transitions, 131 changer transitions 0/775 dead transitions. [2024-06-27 23:09:32,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 775 transitions, 13689 flow [2024-06-27 23:09:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:09:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:09:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 219 transitions. [2024-06-27 23:09:32,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630021141649049 [2024-06-27 23:09:32,953 INFO L175 Difference]: Start difference. First operand has 306 places, 727 transitions, 11868 flow. Second operand 11 states and 219 transitions. [2024-06-27 23:09:32,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 775 transitions, 13689 flow [2024-06-27 23:09:35,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 775 transitions, 13426 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:35,159 INFO L231 Difference]: Finished difference. Result has 310 places, 729 transitions, 11939 flow [2024-06-27 23:09:35,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11629, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11939, PETRI_PLACES=310, PETRI_TRANSITIONS=729} [2024-06-27 23:09:35,160 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 266 predicate places. [2024-06-27 23:09:35,160 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 729 transitions, 11939 flow [2024-06-27 23:09:35,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:35,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:35,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:35,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 23:09:35,161 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:35,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash -751647809, now seen corresponding path program 3 times [2024-06-27 23:09:35,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:35,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085938709] [2024-06-27 23:09:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:35,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:35,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-27 23:09:35,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:35,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085938709] [2024-06-27 23:09:35,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085938709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:35,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:35,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:35,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267719617] [2024-06-27 23:09:35,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:35,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:35,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:35,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:35,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:36,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-27 23:09:36,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 729 transitions, 11939 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:36,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:36,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-27 23:09:36,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:38,306 INFO L124 PetriNetUnfolderBase]: 5452/8741 cut-off events. [2024-06-27 23:09:38,307 INFO L125 PetriNetUnfolderBase]: For 1165215/1165526 co-relation queries the response was YES. [2024-06-27 23:09:38,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82080 conditions, 8741 events. 5452/8741 cut-off events. For 1165215/1165526 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 58109 event pairs, 1385 based on Foata normal form. 31/8618 useless extension candidates. Maximal degree in co-relation 81929. Up to 6529 conditions per place. [2024-06-27 23:09:38,444 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 435 selfloop transitions, 126 changer transitions 0/786 dead transitions. [2024-06-27 23:09:38,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 786 transitions, 13920 flow [2024-06-27 23:09:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:09:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:09:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 229 transitions. [2024-06-27 23:09:38,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325581395348837 [2024-06-27 23:09:38,445 INFO L175 Difference]: Start difference. First operand has 310 places, 729 transitions, 11939 flow. Second operand 10 states and 229 transitions. [2024-06-27 23:09:38,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 786 transitions, 13920 flow [2024-06-27 23:09:41,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 786 transitions, 13640 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-27 23:09:41,305 INFO L231 Difference]: Finished difference. Result has 313 places, 739 transitions, 12235 flow [2024-06-27 23:09:41,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11659, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12235, PETRI_PLACES=313, PETRI_TRANSITIONS=739} [2024-06-27 23:09:41,305 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 269 predicate places. [2024-06-27 23:09:41,305 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 739 transitions, 12235 flow [2024-06-27 23:09:41,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:41,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:41,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:41,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 23:09:41,306 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:41,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1928359829, now seen corresponding path program 4 times [2024-06-27 23:09:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897792137] [2024-06-27 23:09:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:09:44,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:44,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897792137] [2024-06-27 23:09:44,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897792137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:44,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:44,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:09:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428924320] [2024-06-27 23:09:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:44,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:09:44,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:44,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:09:44,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:09:44,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:44,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 739 transitions, 12235 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:44,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:44,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:44,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:47,529 INFO L124 PetriNetUnfolderBase]: 6302/9698 cut-off events. [2024-06-27 23:09:47,529 INFO L125 PetriNetUnfolderBase]: For 1090154/1090175 co-relation queries the response was YES. [2024-06-27 23:09:47,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88241 conditions, 9698 events. 6302/9698 cut-off events. For 1090154/1090175 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 60587 event pairs, 1743 based on Foata normal form. 12/9634 useless extension candidates. Maximal degree in co-relation 88087. Up to 8657 conditions per place. [2024-06-27 23:09:47,673 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 676 selfloop transitions, 135 changer transitions 0/826 dead transitions. [2024-06-27 23:09:47,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 826 transitions, 15037 flow [2024-06-27 23:09:47,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 23:09:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 23:09:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 250 transitions. [2024-06-27 23:09:47,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4472271914132379 [2024-06-27 23:09:47,674 INFO L175 Difference]: Start difference. First operand has 313 places, 739 transitions, 12235 flow. Second operand 13 states and 250 transitions. [2024-06-27 23:09:47,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 826 transitions, 15037 flow [2024-06-27 23:09:50,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 826 transitions, 14686 flow, removed 140 selfloop flow, removed 6 redundant places. [2024-06-27 23:09:50,079 INFO L231 Difference]: Finished difference. Result has 323 places, 773 transitions, 12912 flow [2024-06-27 23:09:50,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12047, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12912, PETRI_PLACES=323, PETRI_TRANSITIONS=773} [2024-06-27 23:09:50,080 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 279 predicate places. [2024-06-27 23:09:50,080 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 773 transitions, 12912 flow [2024-06-27 23:09:50,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:09:50,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:50,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:50,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 23:09:50,080 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-27 23:09:50,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1508919439, now seen corresponding path program 5 times [2024-06-27 23:09:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:50,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477971737] [2024-06-27 23:09:50,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:09:52,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:52,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477971737] [2024-06-27 23:09:52,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477971737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:52,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:52,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 23:09:52,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176143484] [2024-06-27 23:09:52,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:52,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 23:09:52,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 23:09:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 23:09:53,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:53,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 773 transitions, 12912 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-27 23:09:53,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:53,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:53,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:56,416 INFO L124 PetriNetUnfolderBase]: 6391/9842 cut-off events. [2024-06-27 23:09:56,416 INFO L125 PetriNetUnfolderBase]: For 1066804/1066825 co-relation queries the response was YES. [2024-06-27 23:09:56,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89540 conditions, 9842 events. 6391/9842 cut-off events. For 1066804/1066825 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 61783 event pairs, 1784 based on Foata normal form. 14/9780 useless extension candidates. Maximal degree in co-relation 89383. Up to 8892 conditions per place. [2024-06-27 23:09:56,574 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 693 selfloop transitions, 136 changer transitions 0/844 dead transitions. [2024-06-27 23:09:56,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 844 transitions, 15248 flow [2024-06-27 23:09:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 23:09:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 23:09:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 246 transitions. [2024-06-27 23:09:56,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4400715563506261 [2024-06-27 23:09:56,575 INFO L175 Difference]: Start difference. First operand has 323 places, 773 transitions, 12912 flow. Second operand 13 states and 246 transitions. [2024-06-27 23:09:56,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 844 transitions, 15248 flow [2024-06-27 23:09:58,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 844 transitions, 14986 flow, removed 57 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:58,713 INFO L231 Difference]: Finished difference. Result has 329 places, 796 transitions, 13405 flow [2024-06-27 23:09:58,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12689, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=13405, PETRI_PLACES=329, PETRI_TRANSITIONS=796} [2024-06-27 23:09:58,713 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 285 predicate places. [2024-06-27 23:09:58,713 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 796 transitions, 13405 flow [2024-06-27 23:09:58,714 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-27 23:09:58,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:58,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:58,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 23:09:58,714 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-27 23:09:58,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash -444431763, now seen corresponding path program 6 times [2024-06-27 23:09:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:58,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861121066] [2024-06-27 23:09:58,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:58,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:01,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-27 23:10:01,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:01,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861121066] [2024-06-27 23:10:01,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861121066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:01,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:01,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:10:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688164736] [2024-06-27 23:10:01,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:01,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:10:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:01,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:10:01,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:10:02,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:02,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 796 transitions, 13405 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:02,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:02,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:02,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:04,918 INFO L124 PetriNetUnfolderBase]: 6373/9817 cut-off events. [2024-06-27 23:10:04,918 INFO L125 PetriNetUnfolderBase]: For 1070583/1070602 co-relation queries the response was YES. [2024-06-27 23:10:05,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89109 conditions, 9817 events. 6373/9817 cut-off events. For 1070583/1070602 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 61578 event pairs, 1783 based on Foata normal form. 12/9753 useless extension candidates. Maximal degree in co-relation 88950. Up to 8866 conditions per place. [2024-06-27 23:10:05,086 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 685 selfloop transitions, 135 changer transitions 0/835 dead transitions. [2024-06-27 23:10:05,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 835 transitions, 15230 flow [2024-06-27 23:10:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:10:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:10:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-27 23:10:05,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4503171247357294 [2024-06-27 23:10:05,088 INFO L175 Difference]: Start difference. First operand has 329 places, 796 transitions, 13405 flow. Second operand 11 states and 213 transitions. [2024-06-27 23:10:05,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 835 transitions, 15230 flow [2024-06-27 23:10:07,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 835 transitions, 14856 flow, removed 70 selfloop flow, removed 8 redundant places. [2024-06-27 23:10:07,889 INFO L231 Difference]: Finished difference. Result has 332 places, 796 transitions, 13318 flow [2024-06-27 23:10:07,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=13031, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13318, PETRI_PLACES=332, PETRI_TRANSITIONS=796} [2024-06-27 23:10:07,890 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 288 predicate places. [2024-06-27 23:10:07,890 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 796 transitions, 13318 flow [2024-06-27 23:10:07,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:07,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:07,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:07,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 23:10:07,890 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-27 23:10:07,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:07,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1785532173, now seen corresponding path program 7 times [2024-06-27 23:10:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:07,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208790575] [2024-06-27 23:10:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:07,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:11,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-27 23:10:11,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:11,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208790575] [2024-06-27 23:10:11,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208790575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:11,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:11,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:10:11,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885739364] [2024-06-27 23:10:11,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:11,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:10:11,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:11,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:10:11,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:10:11,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:11,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 796 transitions, 13318 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:11,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:11,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:11,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:14,760 INFO L124 PetriNetUnfolderBase]: 6394/9768 cut-off events. [2024-06-27 23:10:14,760 INFO L125 PetriNetUnfolderBase]: For 1095085/1095107 co-relation queries the response was YES. [2024-06-27 23:10:14,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89552 conditions, 9768 events. 6394/9768 cut-off events. For 1095085/1095107 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 60191 event pairs, 1469 based on Foata normal form. 12/9729 useless extension candidates. Maximal degree in co-relation 89392. Up to 8736 conditions per place. [2024-06-27 23:10:14,881 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 693 selfloop transitions, 184 changer transitions 0/892 dead transitions. [2024-06-27 23:10:14,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 892 transitions, 16124 flow [2024-06-27 23:10:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:10:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:10:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2024-06-27 23:10:14,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4503171247357294 [2024-06-27 23:10:14,882 INFO L175 Difference]: Start difference. First operand has 332 places, 796 transitions, 13318 flow. Second operand 11 states and 213 transitions. [2024-06-27 23:10:14,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 892 transitions, 16124 flow [2024-06-27 23:10:17,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 892 transitions, 15841 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-27 23:10:17,367 INFO L231 Difference]: Finished difference. Result has 337 places, 851 transitions, 14461 flow [2024-06-27 23:10:17,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=13039, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14461, PETRI_PLACES=337, PETRI_TRANSITIONS=851} [2024-06-27 23:10:17,368 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 293 predicate places. [2024-06-27 23:10:17,368 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 851 transitions, 14461 flow [2024-06-27 23:10:17,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:17,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:17,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:17,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 23:10:17,369 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:17,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1404106109, now seen corresponding path program 1 times [2024-06-27 23:10:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:17,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892091159] [2024-06-27 23:10:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:17,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:10:18,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:18,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892091159] [2024-06-27 23:10:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892091159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:18,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:18,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:10:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948823369] [2024-06-27 23:10:18,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:18,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:10:18,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:18,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:10:18,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:10:18,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:18,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 851 transitions, 14461 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:18,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:18,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:18,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:20,946 INFO L124 PetriNetUnfolderBase]: 6873/10437 cut-off events. [2024-06-27 23:10:20,946 INFO L125 PetriNetUnfolderBase]: For 1156076/1156643 co-relation queries the response was YES. [2024-06-27 23:10:21,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94371 conditions, 10437 events. 6873/10437 cut-off events. For 1156076/1156643 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 64047 event pairs, 1974 based on Foata normal form. 233/10505 useless extension candidates. Maximal degree in co-relation 94207. Up to 9296 conditions per place. [2024-06-27 23:10:21,094 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 615 selfloop transitions, 92 changer transitions 0/883 dead transitions. [2024-06-27 23:10:21,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 883 transitions, 16231 flow [2024-06-27 23:10:21,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:10:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:10:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-27 23:10:21,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49169435215946844 [2024-06-27 23:10:21,095 INFO L175 Difference]: Start difference. First operand has 337 places, 851 transitions, 14461 flow. Second operand 7 states and 148 transitions. [2024-06-27 23:10:21,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 883 transitions, 16231 flow [2024-06-27 23:10:23,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 883 transitions, 16094 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-06-27 23:10:23,352 INFO L231 Difference]: Finished difference. Result has 340 places, 857 transitions, 14612 flow [2024-06-27 23:10:23,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14332, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14612, PETRI_PLACES=340, PETRI_TRANSITIONS=857} [2024-06-27 23:10:23,352 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 296 predicate places. [2024-06-27 23:10:23,353 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 857 transitions, 14612 flow [2024-06-27 23:10:23,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:23,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:23,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:23,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 23:10:23,353 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-27 23:10:23,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:23,354 INFO L85 PathProgramCache]: Analyzing trace with hash 49472537, now seen corresponding path program 8 times [2024-06-27 23:10:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167037061] [2024-06-27 23:10:23,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:10:25,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:25,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167037061] [2024-06-27 23:10:25,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167037061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:25,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:25,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:10:25,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883191767] [2024-06-27 23:10:25,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:25,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:10:25,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:25,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:10:25,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:10:26,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:26,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 857 transitions, 14612 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:26,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:26,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:26,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:29,187 INFO L124 PetriNetUnfolderBase]: 6611/10185 cut-off events. [2024-06-27 23:10:29,187 INFO L125 PetriNetUnfolderBase]: For 1178650/1178691 co-relation queries the response was YES. [2024-06-27 23:10:29,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93648 conditions, 10185 events. 6611/10185 cut-off events. For 1178650/1178691 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 64427 event pairs, 1766 based on Foata normal form. 8/10109 useless extension candidates. Maximal degree in co-relation 93483. Up to 9199 conditions per place. [2024-06-27 23:10:29,338 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 819 selfloop transitions, 111 changer transitions 0/947 dead transitions. [2024-06-27 23:10:29,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 947 transitions, 17587 flow [2024-06-27 23:10:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:10:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:10:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 234 transitions. [2024-06-27 23:10:29,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-27 23:10:29,340 INFO L175 Difference]: Start difference. First operand has 340 places, 857 transitions, 14612 flow. Second operand 12 states and 234 transitions. [2024-06-27 23:10:29,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 947 transitions, 17587 flow [2024-06-27 23:10:32,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 947 transitions, 17472 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 23:10:32,088 INFO L231 Difference]: Finished difference. Result has 352 places, 894 transitions, 15385 flow [2024-06-27 23:10:32,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14500, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=857, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15385, PETRI_PLACES=352, PETRI_TRANSITIONS=894} [2024-06-27 23:10:32,089 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 308 predicate places. [2024-06-27 23:10:32,089 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 894 transitions, 15385 flow [2024-06-27 23:10:32,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:32,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:32,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:32,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 23:10:32,089 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:32,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:32,090 INFO L85 PathProgramCache]: Analyzing trace with hash 49532987, now seen corresponding path program 9 times [2024-06-27 23:10:32,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:32,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047360322] [2024-06-27 23:10:32,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:10:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047360322] [2024-06-27 23:10:34,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047360322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:34,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:34,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:10:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642492978] [2024-06-27 23:10:34,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:34,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:10:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:34,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:10:34,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:10:34,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:34,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 894 transitions, 15385 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:34,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:34,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:38,369 INFO L124 PetriNetUnfolderBase]: 6694/10318 cut-off events. [2024-06-27 23:10:38,369 INFO L125 PetriNetUnfolderBase]: For 1217413/1217454 co-relation queries the response was YES. [2024-06-27 23:10:38,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96070 conditions, 10318 events. 6694/10318 cut-off events. For 1217413/1217454 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 65501 event pairs, 1811 based on Foata normal form. 10/10245 useless extension candidates. Maximal degree in co-relation 95900. Up to 9457 conditions per place. [2024-06-27 23:10:38,513 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 842 selfloop transitions, 103 changer transitions 0/962 dead transitions. [2024-06-27 23:10:38,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 962 transitions, 18023 flow [2024-06-27 23:10:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:10:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:10:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2024-06-27 23:10:38,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44573643410852715 [2024-06-27 23:10:38,514 INFO L175 Difference]: Start difference. First operand has 352 places, 894 transitions, 15385 flow. Second operand 12 states and 230 transitions. [2024-06-27 23:10:38,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 962 transitions, 18023 flow [2024-06-27 23:10:41,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 962 transitions, 17806 flow, removed 57 selfloop flow, removed 6 redundant places. [2024-06-27 23:10:41,829 INFO L231 Difference]: Finished difference. Result has 358 places, 914 transitions, 15862 flow [2024-06-27 23:10:41,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=15200, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=803, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15862, PETRI_PLACES=358, PETRI_TRANSITIONS=914} [2024-06-27 23:10:41,830 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 314 predicate places. [2024-06-27 23:10:41,830 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 914 transitions, 15862 flow [2024-06-27 23:10:41,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:41,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:41,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:41,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 23:10:41,830 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:41,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash 52329497, now seen corresponding path program 10 times [2024-06-27 23:10:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670693408] [2024-06-27 23:10:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:10:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670693408] [2024-06-27 23:10:44,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670693408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:44,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:44,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:10:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576659143] [2024-06-27 23:10:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:44,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:10:44,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:44,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:10:44,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:10:45,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:45,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 914 transitions, 15862 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:45,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:45,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:45,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:48,350 INFO L124 PetriNetUnfolderBase]: 6676/10295 cut-off events. [2024-06-27 23:10:48,350 INFO L125 PetriNetUnfolderBase]: For 1222429/1222470 co-relation queries the response was YES. [2024-06-27 23:10:48,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95744 conditions, 10295 events. 6676/10295 cut-off events. For 1222429/1222470 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 65368 event pairs, 1802 based on Foata normal form. 10/10221 useless extension candidates. Maximal degree in co-relation 95572. Up to 9431 conditions per place. [2024-06-27 23:10:48,496 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 837 selfloop transitions, 101 changer transitions 0/955 dead transitions. [2024-06-27 23:10:48,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 955 transitions, 18013 flow [2024-06-27 23:10:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:10:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:10:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-27 23:10:48,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4376321353065539 [2024-06-27 23:10:48,497 INFO L175 Difference]: Start difference. First operand has 358 places, 914 transitions, 15862 flow. Second operand 11 states and 207 transitions. [2024-06-27 23:10:48,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 955 transitions, 18013 flow [2024-06-27 23:10:51,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 955 transitions, 17684 flow, removed 69 selfloop flow, removed 9 redundant places. [2024-06-27 23:10:51,434 INFO L231 Difference]: Finished difference. Result has 360 places, 914 transitions, 15754 flow [2024-06-27 23:10:51,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=15533, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15754, PETRI_PLACES=360, PETRI_TRANSITIONS=914} [2024-06-27 23:10:51,434 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 316 predicate places. [2024-06-27 23:10:51,435 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 914 transitions, 15754 flow [2024-06-27 23:10:51,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:51,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:51,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:51,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 23:10:51,435 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:51,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash 167620667, now seen corresponding path program 11 times [2024-06-27 23:10:51,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:51,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792988634] [2024-06-27 23:10:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:51,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:10:54,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:54,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792988634] [2024-06-27 23:10:54,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792988634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:54,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:54,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:10:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853187903] [2024-06-27 23:10:54,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:54,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:10:54,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:54,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:10:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:10:54,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:54,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 914 transitions, 15754 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:10:54,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:54,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:54,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:57,664 INFO L124 PetriNetUnfolderBase]: 6703/10341 cut-off events. [2024-06-27 23:10:57,664 INFO L125 PetriNetUnfolderBase]: For 1245654/1245700 co-relation queries the response was YES. [2024-06-27 23:10:57,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96197 conditions, 10341 events. 6703/10341 cut-off events. For 1245654/1245700 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 65834 event pairs, 1743 based on Foata normal form. 8/10259 useless extension candidates. Maximal degree in co-relation 96023. Up to 9301 conditions per place. [2024-06-27 23:10:57,808 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 776 selfloop transitions, 176 changer transitions 0/969 dead transitions. [2024-06-27 23:10:57,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 969 transitions, 18153 flow [2024-06-27 23:10:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:10:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:10:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-27 23:10:57,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44820295983086683 [2024-06-27 23:10:57,809 INFO L175 Difference]: Start difference. First operand has 360 places, 914 transitions, 15754 flow. Second operand 11 states and 212 transitions. [2024-06-27 23:10:57,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 969 transitions, 18153 flow [2024-06-27 23:11:00,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 969 transitions, 17944 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-27 23:11:00,609 INFO L231 Difference]: Finished difference. Result has 363 places, 921 transitions, 16034 flow [2024-06-27 23:11:00,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=15545, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16034, PETRI_PLACES=363, PETRI_TRANSITIONS=921} [2024-06-27 23:11:00,610 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 319 predicate places. [2024-06-27 23:11:00,610 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 921 transitions, 16034 flow [2024-06-27 23:11:00,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:00,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:00,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:00,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 23:11:00,610 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:00,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1537370775, now seen corresponding path program 1 times [2024-06-27 23:11:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782326648] [2024-06-27 23:11:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:00,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:11:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782326648] [2024-06-27 23:11:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782326648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:11:02,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408431311] [2024-06-27 23:11:02,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:02,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:11:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:02,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:11:02,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:11:02,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-27 23:11:02,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 921 transitions, 16034 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:02,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:02,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-27 23:11:02,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:05,860 INFO L124 PetriNetUnfolderBase]: 7892/11797 cut-off events. [2024-06-27 23:11:05,860 INFO L125 PetriNetUnfolderBase]: For 1305040/1305082 co-relation queries the response was YES. [2024-06-27 23:11:06,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107286 conditions, 11797 events. 7892/11797 cut-off events. For 1305040/1305082 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 70862 event pairs, 2094 based on Foata normal form. 4/11759 useless extension candidates. Maximal degree in co-relation 107110. Up to 11113 conditions per place. [2024-06-27 23:11:06,075 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 853 selfloop transitions, 112 changer transitions 0/978 dead transitions. [2024-06-27 23:11:06,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 978 transitions, 18586 flow [2024-06-27 23:11:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:11:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:11:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-27 23:11:06,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-27 23:11:06,077 INFO L175 Difference]: Start difference. First operand has 363 places, 921 transitions, 16034 flow. Second operand 10 states and 190 transitions. [2024-06-27 23:11:06,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 978 transitions, 18586 flow [2024-06-27 23:11:09,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 978 transitions, 18195 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-27 23:11:09,776 INFO L231 Difference]: Finished difference. Result has 366 places, 942 transitions, 16336 flow [2024-06-27 23:11:09,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=15643, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=809, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16336, PETRI_PLACES=366, PETRI_TRANSITIONS=942} [2024-06-27 23:11:09,777 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 322 predicate places. [2024-06-27 23:11:09,777 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 942 transitions, 16336 flow [2024-06-27 23:11:09,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:09,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:09,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:09,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 23:11:09,778 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:09,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:09,778 INFO L85 PathProgramCache]: Analyzing trace with hash 339939929, now seen corresponding path program 1 times [2024-06-27 23:11:09,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:09,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129132532] [2024-06-27 23:11:09,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:09,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:11:11,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:11,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129132532] [2024-06-27 23:11:11,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129132532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:11,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:11,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:11:11,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503251069] [2024-06-27 23:11:11,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:11,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:11:11,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:11,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:11:11,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:11:11,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-27 23:11:11,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 942 transitions, 16336 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:11,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:11,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-27 23:11:11,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:15,167 INFO L124 PetriNetUnfolderBase]: 7914/11828 cut-off events. [2024-06-27 23:11:15,167 INFO L125 PetriNetUnfolderBase]: For 1345056/1345102 co-relation queries the response was YES. [2024-06-27 23:11:15,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108223 conditions, 11828 events. 7914/11828 cut-off events. For 1345056/1345102 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 71134 event pairs, 2072 based on Foata normal form. 6/11787 useless extension candidates. Maximal degree in co-relation 108046. Up to 11175 conditions per place. [2024-06-27 23:11:15,339 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 873 selfloop transitions, 93 changer transitions 0/979 dead transitions. [2024-06-27 23:11:15,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 979 transitions, 18544 flow [2024-06-27 23:11:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:11:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:11:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-27 23:11:15,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43953488372093025 [2024-06-27 23:11:15,341 INFO L175 Difference]: Start difference. First operand has 366 places, 942 transitions, 16336 flow. Second operand 10 states and 189 transitions. [2024-06-27 23:11:15,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 979 transitions, 18544 flow [2024-06-27 23:11:18,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 979 transitions, 18293 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-27 23:11:18,890 INFO L231 Difference]: Finished difference. Result has 368 places, 944 transitions, 16349 flow [2024-06-27 23:11:18,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=16085, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=849, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16349, PETRI_PLACES=368, PETRI_TRANSITIONS=944} [2024-06-27 23:11:18,890 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 324 predicate places. [2024-06-27 23:11:18,890 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 944 transitions, 16349 flow [2024-06-27 23:11:18,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:18,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:18,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:18,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 23:11:18,891 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:18,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash 333259801, now seen corresponding path program 12 times [2024-06-27 23:11:18,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:18,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725417163] [2024-06-27 23:11:18,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:11:21,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:21,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725417163] [2024-06-27 23:11:21,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725417163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:21,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:11:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259061829] [2024-06-27 23:11:21,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:21,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:11:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:11:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:11:21,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-27 23:11:21,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 944 transitions, 16349 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:21,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:21,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-27 23:11:21,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:25,552 INFO L124 PetriNetUnfolderBase]: 7927/11847 cut-off events. [2024-06-27 23:11:25,552 INFO L125 PetriNetUnfolderBase]: For 1373484/1373530 co-relation queries the response was YES. [2024-06-27 23:11:25,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108856 conditions, 11847 events. 7927/11847 cut-off events. For 1373484/1373530 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 71212 event pairs, 2158 based on Foata normal form. 8/11814 useless extension candidates. Maximal degree in co-relation 108678. Up to 11349 conditions per place. [2024-06-27 23:11:25,727 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 907 selfloop transitions, 66 changer transitions 0/986 dead transitions. [2024-06-27 23:11:25,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 986 transitions, 18615 flow [2024-06-27 23:11:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:11:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:11:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-27 23:11:25,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43488372093023253 [2024-06-27 23:11:25,729 INFO L175 Difference]: Start difference. First operand has 368 places, 944 transitions, 16349 flow. Second operand 10 states and 187 transitions. [2024-06-27 23:11:25,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 986 transitions, 18615 flow [2024-06-27 23:11:29,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 986 transitions, 18382 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-27 23:11:29,251 INFO L231 Difference]: Finished difference. Result has 372 places, 949 transitions, 16382 flow [2024-06-27 23:11:29,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=16116, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=878, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16382, PETRI_PLACES=372, PETRI_TRANSITIONS=949} [2024-06-27 23:11:29,252 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 328 predicate places. [2024-06-27 23:11:29,252 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 949 transitions, 16382 flow [2024-06-27 23:11:29,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:29,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:29,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:29,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 23:11:29,252 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:29,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:29,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1151883101, now seen corresponding path program 2 times [2024-06-27 23:11:29,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:29,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197563648] [2024-06-27 23:11:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:31,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-27 23:11:31,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197563648] [2024-06-27 23:11:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197563648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:31,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:31,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:11:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049626790] [2024-06-27 23:11:31,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:31,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:11:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:11:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:11:31,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-27 23:11:31,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 949 transitions, 16382 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:31,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:31,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-27 23:11:31,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:35,095 INFO L124 PetriNetUnfolderBase]: 7909/11820 cut-off events. [2024-06-27 23:11:35,095 INFO L125 PetriNetUnfolderBase]: For 1394249/1394295 co-relation queries the response was YES. [2024-06-27 23:11:35,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108782 conditions, 11820 events. 7909/11820 cut-off events. For 1394249/1394295 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 71018 event pairs, 2047 based on Foata normal form. 5/11783 useless extension candidates. Maximal degree in co-relation 108603. Up to 11014 conditions per place. [2024-06-27 23:11:35,254 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 826 selfloop transitions, 154 changer transitions 0/993 dead transitions. [2024-06-27 23:11:35,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 993 transitions, 18698 flow [2024-06-27 23:11:35,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-27 23:11:35,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2024-06-27 23:11:35,256 INFO L175 Difference]: Start difference. First operand has 372 places, 949 transitions, 16382 flow. Second operand 9 states and 186 transitions. [2024-06-27 23:11:35,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 993 transitions, 18698 flow [2024-06-27 23:11:38,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 993 transitions, 18453 flow, removed 62 selfloop flow, removed 7 redundant places. [2024-06-27 23:11:38,970 INFO L231 Difference]: Finished difference. Result has 375 places, 956 transitions, 16603 flow [2024-06-27 23:11:38,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=16137, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=801, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16603, PETRI_PLACES=375, PETRI_TRANSITIONS=956} [2024-06-27 23:11:38,971 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 331 predicate places. [2024-06-27 23:11:38,971 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 956 transitions, 16603 flow [2024-06-27 23:11:38,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:38,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:38,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:38,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 23:11:38,971 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:38,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1023613193, now seen corresponding path program 1 times [2024-06-27 23:11:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:38,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172618164] [2024-06-27 23:11:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:11:41,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172618164] [2024-06-27 23:11:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172618164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:41,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:41,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:11:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436235811] [2024-06-27 23:11:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:41,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:11:41,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:41,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:11:41,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:11:41,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:11:41,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 956 transitions, 16603 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:41,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:41,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:11:41,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:44,746 INFO L124 PetriNetUnfolderBase]: 7319/11146 cut-off events. [2024-06-27 23:11:44,746 INFO L125 PetriNetUnfolderBase]: For 1477955/1478444 co-relation queries the response was YES. [2024-06-27 23:11:44,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104381 conditions, 11146 events. 7319/11146 cut-off events. For 1477955/1478444 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 69676 event pairs, 2128 based on Foata normal form. 176/11167 useless extension candidates. Maximal degree in co-relation 104200. Up to 9916 conditions per place. [2024-06-27 23:11:44,930 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 723 selfloop transitions, 83 changer transitions 0/1015 dead transitions. [2024-06-27 23:11:44,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1015 transitions, 19353 flow [2024-06-27 23:11:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:11:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:11:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2024-06-27 23:11:44,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4941860465116279 [2024-06-27 23:11:44,931 INFO L175 Difference]: Start difference. First operand has 375 places, 956 transitions, 16603 flow. Second operand 8 states and 170 transitions. [2024-06-27 23:11:44,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1015 transitions, 19353 flow [2024-06-27 23:11:47,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 1015 transitions, 18961 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-27 23:11:47,946 INFO L231 Difference]: Finished difference. Result has 377 places, 982 transitions, 16706 flow [2024-06-27 23:11:47,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=16211, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=956, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16706, PETRI_PLACES=377, PETRI_TRANSITIONS=982} [2024-06-27 23:11:47,946 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 333 predicate places. [2024-06-27 23:11:47,946 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 982 transitions, 16706 flow [2024-06-27 23:11:47,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:47,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:47,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:47,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 23:11:47,947 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:47,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:47,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1955544702, now seen corresponding path program 1 times [2024-06-27 23:11:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:47,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538656486] [2024-06-27 23:11:47,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:11:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:49,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538656486] [2024-06-27 23:11:49,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538656486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:49,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:11:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104320028] [2024-06-27 23:11:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:49,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:11:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:49,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:11:49,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:11:49,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:11:49,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 982 transitions, 16706 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:49,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:49,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:11:49,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:53,162 INFO L124 PetriNetUnfolderBase]: 7184/11067 cut-off events. [2024-06-27 23:11:53,163 INFO L125 PetriNetUnfolderBase]: For 1619296/1619321 co-relation queries the response was YES. [2024-06-27 23:11:53,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108888 conditions, 11067 events. 7184/11067 cut-off events. For 1619296/1619321 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 70919 event pairs, 1589 based on Foata normal form. 20/11007 useless extension candidates. Maximal degree in co-relation 108704. Up to 8839 conditions per place. [2024-06-27 23:11:53,355 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 818 selfloop transitions, 215 changer transitions 0/1053 dead transitions. [2024-06-27 23:11:53,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 1053 transitions, 19635 flow [2024-06-27 23:11:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:11:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:11:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 252 transitions. [2024-06-27 23:11:53,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2024-06-27 23:11:53,357 INFO L175 Difference]: Start difference. First operand has 377 places, 982 transitions, 16706 flow. Second operand 12 states and 252 transitions. [2024-06-27 23:11:53,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 1053 transitions, 19635 flow [2024-06-27 23:11:57,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1053 transitions, 19587 flow, removed 24 selfloop flow, removed 0 redundant places. [2024-06-27 23:11:57,303 INFO L231 Difference]: Finished difference. Result has 389 places, 984 transitions, 17202 flow [2024-06-27 23:11:57,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=16658, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17202, PETRI_PLACES=389, PETRI_TRANSITIONS=984} [2024-06-27 23:11:57,303 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 345 predicate places. [2024-06-27 23:11:57,303 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 984 transitions, 17202 flow [2024-06-27 23:11:57,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:57,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:57,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:57,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 23:11:57,304 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:57,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1075358825, now seen corresponding path program 2 times [2024-06-27 23:11:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217318909] [2024-06-27 23:11:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:57,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:11:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217318909] [2024-06-27 23:11:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217318909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:58,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:11:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509483899] [2024-06-27 23:11:58,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:58,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:11:58,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:11:58,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:11:58,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:11:58,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 984 transitions, 17202 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:11:58,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:58,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:11:58,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:02,340 INFO L124 PetriNetUnfolderBase]: 7517/11487 cut-off events. [2024-06-27 23:12:02,340 INFO L125 PetriNetUnfolderBase]: For 1647676/1648170 co-relation queries the response was YES. [2024-06-27 23:12:02,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111076 conditions, 11487 events. 7517/11487 cut-off events. For 1647676/1648170 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 72458 event pairs, 2270 based on Foata normal form. 183/11512 useless extension candidates. Maximal degree in co-relation 110889. Up to 10335 conditions per place. [2024-06-27 23:12:02,536 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 740 selfloop transitions, 63 changer transitions 0/1012 dead transitions. [2024-06-27 23:12:02,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 1012 transitions, 19170 flow [2024-06-27 23:12:02,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-27 23:12:02,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4850498338870432 [2024-06-27 23:12:02,537 INFO L175 Difference]: Start difference. First operand has 389 places, 984 transitions, 17202 flow. Second operand 7 states and 146 transitions. [2024-06-27 23:12:02,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 1012 transitions, 19170 flow [2024-06-27 23:12:06,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 1012 transitions, 18925 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-27 23:12:06,114 INFO L231 Difference]: Finished difference. Result has 391 places, 985 transitions, 17147 flow [2024-06-27 23:12:06,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=16959, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=984, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=17147, PETRI_PLACES=391, PETRI_TRANSITIONS=985} [2024-06-27 23:12:06,115 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 347 predicate places. [2024-06-27 23:12:06,115 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 985 transitions, 17147 flow [2024-06-27 23:12:06,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:06,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:06,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:06,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 23:12:06,115 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:06,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:06,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1187746080, now seen corresponding path program 2 times [2024-06-27 23:12:06,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:06,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207459992] [2024-06-27 23:12:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:06,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:12:09,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:09,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207459992] [2024-06-27 23:12:09,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207459992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:09,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:09,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 23:12:09,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116391704] [2024-06-27 23:12:09,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:09,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 23:12:09,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:09,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 23:12:09,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 23:12:10,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:12:10,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 985 transitions, 17147 flow. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:12:10,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:10,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:12:10,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:14,968 INFO L124 PetriNetUnfolderBase]: 7464/11552 cut-off events. [2024-06-27 23:12:14,968 INFO L125 PetriNetUnfolderBase]: For 1780136/1780185 co-relation queries the response was YES.