./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 15:27:59,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:27:59,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:27:59,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:27:59,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:27:59,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:27:59,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:27:59,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:27:59,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:27:59,481 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:27:59,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:27:59,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:27:59,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:27:59,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:27:59,483 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:27:59,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:27:59,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:27:59,484 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:27:59,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:27:59,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:27:59,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:27:59,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:27:59,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:27:59,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:27:59,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:27:59,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:27:59,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:27:59,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:27:59,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:27:59,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:27:59,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:27:59,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:27:59,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:27:59,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:27:59,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:27:59,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:27:59,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:27:59,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:27:59,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:27:59,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:27:59,503 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:27:59,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:27:59,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:27:59,504 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 15:27:59,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:27:59,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:27:59,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:27:59,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:27:59,788 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:27:59,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2024-06-14 15:28:00,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:28:01,184 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:28:01,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2024-06-14 15:28:01,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fff38c7/5771c6b7239a4f91aa75b047adcea0e8/FLAGf8fb5ae8a [2024-06-14 15:28:01,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fff38c7/5771c6b7239a4f91aa75b047adcea0e8 [2024-06-14 15:28:01,218 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:28:01,219 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:28:01,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_tso.oepc.yml/witness.yml [2024-06-14 15:28:01,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:28:01,452 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:28:01,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:28:01,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:28:01,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:28:01,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:28:01" (1/2) ... [2024-06-14 15:28:01,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa1e74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:28:01, skipping insertion in model container [2024-06-14 15:28:01,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:28:01" (1/2) ... [2024-06-14 15:28:01,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2340bf8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:28:01, skipping insertion in model container [2024-06-14 15:28:01,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:28:01" (2/2) ... [2024-06-14 15:28:01,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa1e74f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:01, skipping insertion in model container [2024-06-14 15:28:01,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:28:01" (2/2) ... [2024-06-14 15:28:01,463 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:28:01,551 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:28:01,552 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 15:28:01,553 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 15:28:01,554 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 15:28:01,554 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:28:01,554 INFO L106 edCorrectnessWitness]: ghost_update [L821-L821] multithreaded = 1; [2024-06-14 15:28:01,602 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:28:01,959 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:28:01,973 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:28:02,455 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:28:02,498 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:28:02,499 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02 WrapperNode [2024-06-14 15:28:02,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:28:02,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:28:02,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:28:02,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:28:02,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:02,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:02,844 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2024-06-14 15:28:02,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:28:02,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:28:02,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:28:02,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:28:02,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:02,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:02,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:02,952 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 15:28:02,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:02,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:03,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:03,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:03,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:03,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:03,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:28:03,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:28:03,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:28:03,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:28:03,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (1/1) ... [2024-06-14 15:28:03,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:28:03,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:28:03,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 15:28:03,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 15:28:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:28:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:28:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:28:03,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:28:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:28:03,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:28:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 15:28:03,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 15:28:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:28:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:28:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:28:03,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:28:03,163 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:28:03,277 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:28:03,279 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:28:04,772 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:28:04,774 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:28:05,156 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:28:05,157 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:28:05,158 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:28:05 BoogieIcfgContainer [2024-06-14 15:28:05,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:28:05,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:28:05,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:28:05,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:28:05,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:28:01" (1/4) ... [2024-06-14 15:28:05,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7932d270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:28:05, skipping insertion in model container [2024-06-14 15:28:05,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:28:01" (2/4) ... [2024-06-14 15:28:05,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7932d270 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:28:05, skipping insertion in model container [2024-06-14 15:28:05,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:28:02" (3/4) ... [2024-06-14 15:28:05,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7932d270 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:28:05, skipping insertion in model container [2024-06-14 15:28:05,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:28:05" (4/4) ... [2024-06-14 15:28:05,170 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2024-06-14 15:28:05,186 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:28:05,187 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 15:28:05,187 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:28:05,336 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:28:05,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 15:28:05,446 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-14 15:28:05,447 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:28:05,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:28:05,451 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 15:28:05,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-14 15:28:05,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:28:05,476 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;@605af50e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:28:05,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 15:28:05,488 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:28:05,489 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:28:05,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:28:05,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:05,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:28:05,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:05,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1322398027, now seen corresponding path program 1 times [2024-06-14 15:28:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:05,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653884604] [2024-06-14 15:28:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:12,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:12,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653884604] [2024-06-14 15:28:12,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653884604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:12,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:12,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:28:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944728203] [2024-06-14 15:28:12,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:12,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:28:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:12,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:28:12,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:28:12,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:28:12,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:12,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:12,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:28:12,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:13,861 INFO L124 PetriNetUnfolderBase]: 1156/1826 cut-off events. [2024-06-14 15:28:13,862 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-14 15:28:13,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 1826 events. 1156/1826 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8844 event pairs, 805 based on Foata normal form. 1/1790 useless extension candidates. Maximal degree in co-relation 3640. Up to 1740 conditions per place. [2024-06-14 15:28:13,879 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-14 15:28:13,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 173 flow [2024-06-14 15:28:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:28:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:28:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-14 15:28:13,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2024-06-14 15:28:13,892 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 70 transitions. [2024-06-14 15:28:13,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 173 flow [2024-06-14 15:28:13,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 15:28:13,897 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-14 15:28:13,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-14 15:28:13,902 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-14 15:28:13,902 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-14 15:28:13,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:13,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:13,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:13,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:28:13,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:13,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash 485861844, now seen corresponding path program 1 times [2024-06-14 15:28:13,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:13,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476979193] [2024-06-14 15:28:13,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:13,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:18,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:18,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476979193] [2024-06-14 15:28:18,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476979193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:18,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:18,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:28:18,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143603821] [2024-06-14 15:28:18,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:18,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:28:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:18,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:28:18,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:28:18,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:28:18,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:18,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:18,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:28:18,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:19,803 INFO L124 PetriNetUnfolderBase]: 1357/2071 cut-off events. [2024-06-14 15:28:19,804 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2024-06-14 15:28:19,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4740 conditions, 2071 events. 1357/2071 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9673 event pairs, 840 based on Foata normal form. 3/2071 useless extension candidates. Maximal degree in co-relation 4725. Up to 2013 conditions per place. [2024-06-14 15:28:19,820 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 41 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-14 15:28:19,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 242 flow [2024-06-14 15:28:19,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:28:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:28:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-06-14 15:28:19,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304878048780488 [2024-06-14 15:28:19,825 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 87 transitions. [2024-06-14 15:28:19,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 242 flow [2024-06-14 15:28:19,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:28:19,829 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-14 15:28:19,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-14 15:28:19,830 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-14 15:28:19,830 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-14 15:28:19,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:19,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:19,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:19,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:28:19,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:19,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2118150516, now seen corresponding path program 1 times [2024-06-14 15:28:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:19,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423173380] [2024-06-14 15:28:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:19,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:24,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423173380] [2024-06-14 15:28:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423173380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:24,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:24,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:28:24,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587538734] [2024-06-14 15:28:24,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:24,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:28:24,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:24,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:28:24,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:28:24,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:28:24,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:24,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:24,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:28:24,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:25,426 INFO L124 PetriNetUnfolderBase]: 1345/2055 cut-off events. [2024-06-14 15:28:25,426 INFO L125 PetriNetUnfolderBase]: For 1116/1116 co-relation queries the response was YES. [2024-06-14 15:28:25,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5229 conditions, 2055 events. 1345/2055 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9597 event pairs, 592 based on Foata normal form. 6/2058 useless extension candidates. Maximal degree in co-relation 5212. Up to 1965 conditions per place. [2024-06-14 15:28:25,439 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 49 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2024-06-14 15:28:25,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 324 flow [2024-06-14 15:28:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:28:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:28:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-14 15:28:25,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219512195121951 [2024-06-14 15:28:25,444 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 107 transitions. [2024-06-14 15:28:25,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 324 flow [2024-06-14 15:28:25,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 310 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 15:28:25,449 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 172 flow [2024-06-14 15:28:25,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-06-14 15:28:25,450 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-06-14 15:28:25,450 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 172 flow [2024-06-14 15:28:25,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:25,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:25,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:25,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:28:25,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:25,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash 271901579, now seen corresponding path program 1 times [2024-06-14 15:28:25,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603697127] [2024-06-14 15:28:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:30,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603697127] [2024-06-14 15:28:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603697127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:30,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:30,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:28:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151578619] [2024-06-14 15:28:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:30,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:28:30,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:30,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:28:30,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:28:31,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:28:31,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:31,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:31,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:28:31,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:32,149 INFO L124 PetriNetUnfolderBase]: 1336/2038 cut-off events. [2024-06-14 15:28:32,150 INFO L125 PetriNetUnfolderBase]: For 2056/2056 co-relation queries the response was YES. [2024-06-14 15:28:32,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5696 conditions, 2038 events. 1336/2038 cut-off events. For 2056/2056 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9456 event pairs, 450 based on Foata normal form. 6/2041 useless extension candidates. Maximal degree in co-relation 5678. Up to 1920 conditions per place. [2024-06-14 15:28:32,162 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 53 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-14 15:28:32,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 378 flow [2024-06-14 15:28:32,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:28:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:28:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-14 15:28:32,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2024-06-14 15:28:32,165 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 172 flow. Second operand 6 states and 122 transitions. [2024-06-14 15:28:32,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 378 flow [2024-06-14 15:28:32,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 354 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:28:32,168 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 191 flow [2024-06-14 15:28:32,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-06-14 15:28:32,169 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-14 15:28:32,170 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 191 flow [2024-06-14 15:28:32,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:32,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:32,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:32,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:28:32,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:32,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:32,171 INFO L85 PathProgramCache]: Analyzing trace with hash -714505217, now seen corresponding path program 1 times [2024-06-14 15:28:32,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403867364] [2024-06-14 15:28:32,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:32,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:40,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:40,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403867364] [2024-06-14 15:28:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403867364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:40,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:40,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:28:40,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198228705] [2024-06-14 15:28:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:40,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:28:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:40,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:28:40,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:28:40,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:28:40,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:40,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:40,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:28:40,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:41,029 INFO L124 PetriNetUnfolderBase]: 1124/1817 cut-off events. [2024-06-14 15:28:41,029 INFO L125 PetriNetUnfolderBase]: For 2652/2652 co-relation queries the response was YES. [2024-06-14 15:28:41,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5289 conditions, 1817 events. 1124/1817 cut-off events. For 2652/2652 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8842 event pairs, 527 based on Foata normal form. 2/1816 useless extension candidates. Maximal degree in co-relation 5270. Up to 1682 conditions per place. [2024-06-14 15:28:41,049 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 43 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2024-06-14 15:28:41,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 337 flow [2024-06-14 15:28:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:28:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:28:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-14 15:28:41,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:28:41,051 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 191 flow. Second operand 5 states and 90 transitions. [2024-06-14 15:28:41,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 337 flow [2024-06-14 15:28:41,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 304 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 15:28:41,064 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 204 flow [2024-06-14 15:28:41,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-14 15:28:41,067 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2024-06-14 15:28:41,068 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 204 flow [2024-06-14 15:28:41,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:41,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:41,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:41,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:28:41,070 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-14 15:28:41,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:41,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478068, now seen corresponding path program 1 times [2024-06-14 15:28:41,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:41,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417608020] [2024-06-14 15:28:41,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:48,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:48,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417608020] [2024-06-14 15:28:48,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417608020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:48,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:48,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:28:48,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271364856] [2024-06-14 15:28:48,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:48,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:28:48,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:48,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:28:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:28:48,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:28:48,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:48,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:48,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:28:48,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:49,645 INFO L124 PetriNetUnfolderBase]: 1342/2047 cut-off events. [2024-06-14 15:28:49,646 INFO L125 PetriNetUnfolderBase]: For 4400/4400 co-relation queries the response was YES. [2024-06-14 15:28:49,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6518 conditions, 2047 events. 1342/2047 cut-off events. For 4400/4400 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9486 event pairs, 626 based on Foata normal form. 2/2046 useless extension candidates. Maximal degree in co-relation 6497. Up to 1980 conditions per place. [2024-06-14 15:28:49,659 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 51 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2024-06-14 15:28:49,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 394 flow [2024-06-14 15:28:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:28:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:28:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-14 15:28:49,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-14 15:28:49,661 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 204 flow. Second operand 6 states and 104 transitions. [2024-06-14 15:28:49,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 394 flow [2024-06-14 15:28:49,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 372 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 15:28:49,666 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 238 flow [2024-06-14 15:28:49,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-06-14 15:28:49,669 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-14 15:28:49,669 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 238 flow [2024-06-14 15:28:49,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:49,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:49,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:49,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:28:49,671 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:49,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash 436388652, now seen corresponding path program 2 times [2024-06-14 15:28:49,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114293318] [2024-06-14 15:28:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:58,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114293318] [2024-06-14 15:28:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114293318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:58,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:58,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:28:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580917903] [2024-06-14 15:28:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:58,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:28:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:28:58,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:28:58,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:28:58,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:58,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:58,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:28:58,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:59,384 INFO L124 PetriNetUnfolderBase]: 1337/2040 cut-off events. [2024-06-14 15:28:59,384 INFO L125 PetriNetUnfolderBase]: For 5863/5863 co-relation queries the response was YES. [2024-06-14 15:28:59,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6991 conditions, 2040 events. 1337/2040 cut-off events. For 5863/5863 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9462 event pairs, 620 based on Foata normal form. 2/2039 useless extension candidates. Maximal degree in co-relation 6969. Up to 1955 conditions per place. [2024-06-14 15:28:59,395 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 52 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2024-06-14 15:28:59,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 458 flow [2024-06-14 15:28:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:28:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:28:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-14 15:28:59,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-14 15:28:59,396 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 238 flow. Second operand 7 states and 120 transitions. [2024-06-14 15:28:59,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 458 flow [2024-06-14 15:28:59,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 426 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 15:28:59,401 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 280 flow [2024-06-14 15:28:59,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=280, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-06-14 15:28:59,401 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2024-06-14 15:28:59,402 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 280 flow [2024-06-14 15:28:59,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:59,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:59,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:59,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:28:59,403 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:59,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:59,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1608094034, now seen corresponding path program 1 times [2024-06-14 15:28:59,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:59,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118519382] [2024-06-14 15:28:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:59,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:08,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:08,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118519382] [2024-06-14 15:29:08,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118519382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:08,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:08,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:29:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741290207] [2024-06-14 15:29:08,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:08,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:29:08,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:08,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:29:08,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:29:08,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:08,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 280 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 15:29:08,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:08,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:08,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:09,618 INFO L124 PetriNetUnfolderBase]: 1377/2170 cut-off events. [2024-06-14 15:29:09,619 INFO L125 PetriNetUnfolderBase]: For 7623/7623 co-relation queries the response was YES. [2024-06-14 15:29:09,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7694 conditions, 2170 events. 1377/2170 cut-off events. For 7623/7623 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10329 event pairs, 625 based on Foata normal form. 2/2169 useless extension candidates. Maximal degree in co-relation 7671. Up to 2033 conditions per place. [2024-06-14 15:29:09,633 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 58 selfloop transitions, 14 changer transitions 0/76 dead transitions. [2024-06-14 15:29:09,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 511 flow [2024-06-14 15:29:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:29:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:29:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-14 15:29:09,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-14 15:29:09,636 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 280 flow. Second operand 7 states and 116 transitions. [2024-06-14 15:29:09,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 511 flow [2024-06-14 15:29:09,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 458 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 15:29:09,642 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 314 flow [2024-06-14 15:29:09,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2024-06-14 15:29:09,642 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2024-06-14 15:29:09,643 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 314 flow [2024-06-14 15:29:09,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 15:29:09,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:09,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:09,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:29:09,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:09,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash -414428582, now seen corresponding path program 1 times [2024-06-14 15:29:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184454205] [2024-06-14 15:29:09,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:09,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:17,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:17,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184454205] [2024-06-14 15:29:17,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184454205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:17,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:17,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:29:17,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968745506] [2024-06-14 15:29:17,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:17,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:29:17,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:29:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:29:17,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:17,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 314 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 15:29:17,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:17,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:17,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:18,588 INFO L124 PetriNetUnfolderBase]: 1555/2361 cut-off events. [2024-06-14 15:29:18,588 INFO L125 PetriNetUnfolderBase]: For 11273/11283 co-relation queries the response was YES. [2024-06-14 15:29:18,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9235 conditions, 2361 events. 1555/2361 cut-off events. For 11273/11283 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11143 event pairs, 576 based on Foata normal form. 4/2362 useless extension candidates. Maximal degree in co-relation 9210. Up to 2248 conditions per place. [2024-06-14 15:29:18,606 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 67 selfloop transitions, 17 changer transitions 0/89 dead transitions. [2024-06-14 15:29:18,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 89 transitions, 588 flow [2024-06-14 15:29:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:29:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:29:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-14 15:29:18,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-14 15:29:18,610 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 314 flow. Second operand 7 states and 124 transitions. [2024-06-14 15:29:18,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 89 transitions, 588 flow [2024-06-14 15:29:18,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 548 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 15:29:18,616 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 368 flow [2024-06-14 15:29:18,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2024-06-14 15:29:18,617 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2024-06-14 15:29:18,617 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 368 flow [2024-06-14 15:29:18,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 15:29:18,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:18,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:18,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:29:18,618 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:18,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:18,618 INFO L85 PathProgramCache]: Analyzing trace with hash -414308612, now seen corresponding path program 2 times [2024-06-14 15:29:18,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:18,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346538609] [2024-06-14 15:29:18,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:18,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:26,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:26,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346538609] [2024-06-14 15:29:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346538609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:26,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:29:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503432917] [2024-06-14 15:29:26,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:26,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:29:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:26,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:29:26,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:29:26,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:26,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 368 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 15:29:26,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:26,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:26,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:27,773 INFO L124 PetriNetUnfolderBase]: 1669/2527 cut-off events. [2024-06-14 15:29:27,773 INFO L125 PetriNetUnfolderBase]: For 15386/15396 co-relation queries the response was YES. [2024-06-14 15:29:27,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10817 conditions, 2527 events. 1669/2527 cut-off events. For 15386/15396 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11991 event pairs, 557 based on Foata normal form. 18/2542 useless extension candidates. Maximal degree in co-relation 10790. Up to 2297 conditions per place. [2024-06-14 15:29:27,785 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2024-06-14 15:29:27,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 98 transitions, 746 flow [2024-06-14 15:29:27,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:29:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:29:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-14 15:29:27,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-14 15:29:27,788 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 368 flow. Second operand 7 states and 128 transitions. [2024-06-14 15:29:27,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 98 transitions, 746 flow [2024-06-14 15:29:27,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 704 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-14 15:29:27,796 INFO L231 Difference]: Finished difference. Result has 69 places, 71 transitions, 484 flow [2024-06-14 15:29:27,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=484, PETRI_PLACES=69, PETRI_TRANSITIONS=71} [2024-06-14 15:29:27,797 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-06-14 15:29:27,797 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 484 flow [2024-06-14 15:29:27,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 15:29:27,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:27,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:27,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:29:27,798 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:27,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash 33568348, now seen corresponding path program 3 times [2024-06-14 15:29:27,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:27,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416021785] [2024-06-14 15:29:27,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:27,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:35,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:35,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416021785] [2024-06-14 15:29:35,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416021785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:35,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:35,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:29:35,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887918052] [2024-06-14 15:29:35,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:35,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:29:35,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:35,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:29:35,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:29:35,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:35,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 484 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 15:29:35,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:35,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:35,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:36,956 INFO L124 PetriNetUnfolderBase]: 1687/2555 cut-off events. [2024-06-14 15:29:36,956 INFO L125 PetriNetUnfolderBase]: For 19641/19641 co-relation queries the response was YES. [2024-06-14 15:29:36,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11913 conditions, 2555 events. 1687/2555 cut-off events. For 19641/19641 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12164 event pairs, 500 based on Foata normal form. 8/2560 useless extension candidates. Maximal degree in co-relation 11884. Up to 2208 conditions per place. [2024-06-14 15:29:36,974 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 70 selfloop transitions, 38 changer transitions 0/113 dead transitions. [2024-06-14 15:29:36,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 113 transitions, 972 flow [2024-06-14 15:29:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:29:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:29:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 15:29:36,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-14 15:29:36,978 INFO L175 Difference]: Start difference. First operand has 69 places, 71 transitions, 484 flow. Second operand 8 states and 149 transitions. [2024-06-14 15:29:36,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 113 transitions, 972 flow [2024-06-14 15:29:36,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 113 transitions, 926 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-14 15:29:36,993 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 638 flow [2024-06-14 15:29:36,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=638, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2024-06-14 15:29:36,994 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2024-06-14 15:29:36,994 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 638 flow [2024-06-14 15:29:36,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-14 15:29:36,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:36,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:36,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:29:36,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:36,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:36,995 INFO L85 PathProgramCache]: Analyzing trace with hash 33814612, now seen corresponding path program 1 times [2024-06-14 15:29:36,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:36,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470160750] [2024-06-14 15:29:36,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:36,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:46,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470160750] [2024-06-14 15:29:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470160750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:46,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:46,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:29:46,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758202705] [2024-06-14 15:29:46,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:46,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:29:46,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:46,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:29:46,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:29:46,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:46,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 638 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-14 15:29:46,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:46,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:46,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:47,364 INFO L124 PetriNetUnfolderBase]: 1573/2453 cut-off events. [2024-06-14 15:29:47,364 INFO L125 PetriNetUnfolderBase]: For 20157/20157 co-relation queries the response was YES. [2024-06-14 15:29:47,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11741 conditions, 2453 events. 1573/2453 cut-off events. For 20157/20157 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11740 event pairs, 480 based on Foata normal form. 4/2454 useless extension candidates. Maximal degree in co-relation 11709. Up to 2302 conditions per place. [2024-06-14 15:29:47,378 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 85 selfloop transitions, 16 changer transitions 0/105 dead transitions. [2024-06-14 15:29:47,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 105 transitions, 932 flow [2024-06-14 15:29:47,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:29:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:29:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-14 15:29:47,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-14 15:29:47,382 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 638 flow. Second operand 8 states and 131 transitions. [2024-06-14 15:29:47,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 105 transitions, 932 flow [2024-06-14 15:29:47,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 826 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-14 15:29:47,399 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 607 flow [2024-06-14 15:29:47,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=607, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2024-06-14 15:29:47,399 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-06-14 15:29:47,400 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 607 flow [2024-06-14 15:29:47,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-14 15:29:47,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:47,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:47,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:29:47,400 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:47,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash -295611301, now seen corresponding path program 1 times [2024-06-14 15:29:47,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:47,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039807988] [2024-06-14 15:29:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:58,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-14 15:29:58,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039807988] [2024-06-14 15:29:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039807988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:58,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:29:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926464173] [2024-06-14 15:29:58,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:58,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:29:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:58,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:29:58,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:29:58,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:58,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:58,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:58,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:58,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:59,953 INFO L124 PetriNetUnfolderBase]: 1567/2445 cut-off events. [2024-06-14 15:29:59,954 INFO L125 PetriNetUnfolderBase]: For 20150/20150 co-relation queries the response was YES. [2024-06-14 15:29:59,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11367 conditions, 2445 events. 1567/2445 cut-off events. For 20150/20150 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11639 event pairs, 490 based on Foata normal form. 2/2444 useless extension candidates. Maximal degree in co-relation 11334. Up to 2333 conditions per place. [2024-06-14 15:29:59,965 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 81 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2024-06-14 15:29:59,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 829 flow [2024-06-14 15:29:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:29:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:29:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-06-14 15:29:59,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-14 15:29:59,966 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 607 flow. Second operand 5 states and 83 transitions. [2024-06-14 15:29:59,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 829 flow [2024-06-14 15:29:59,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 774 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:29:59,983 INFO L231 Difference]: Finished difference. Result has 77 places, 84 transitions, 602 flow [2024-06-14 15:29:59,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=602, PETRI_PLACES=77, PETRI_TRANSITIONS=84} [2024-06-14 15:29:59,984 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2024-06-14 15:29:59,984 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 84 transitions, 602 flow [2024-06-14 15:29:59,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:59,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:59,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:59,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:29:59,985 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:59,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:59,985 INFO L85 PathProgramCache]: Analyzing trace with hash -159299651, now seen corresponding path program 1 times [2024-06-14 15:29:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:59,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502295922] [2024-06-14 15:29:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:07,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502295922] [2024-06-14 15:30:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502295922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:07,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:07,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:07,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487556421] [2024-06-14 15:30:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:07,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:07,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:07,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:07,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:08,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:30:08,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 602 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-14 15:30:08,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:08,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:30:08,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:09,191 INFO L124 PetriNetUnfolderBase]: 1688/2557 cut-off events. [2024-06-14 15:30:09,192 INFO L125 PetriNetUnfolderBase]: For 26392/26392 co-relation queries the response was YES. [2024-06-14 15:30:09,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12888 conditions, 2557 events. 1688/2557 cut-off events. For 26392/26392 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12130 event pairs, 483 based on Foata normal form. 2/2556 useless extension candidates. Maximal degree in co-relation 12854. Up to 2435 conditions per place. [2024-06-14 15:30:09,204 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 89 selfloop transitions, 19 changer transitions 0/113 dead transitions. [2024-06-14 15:30:09,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 113 transitions, 932 flow [2024-06-14 15:30:09,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-14 15:30:09,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-14 15:30:09,207 INFO L175 Difference]: Start difference. First operand has 77 places, 84 transitions, 602 flow. Second operand 7 states and 124 transitions. [2024-06-14 15:30:09,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 113 transitions, 932 flow [2024-06-14 15:30:09,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 113 transitions, 904 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 15:30:09,221 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 676 flow [2024-06-14 15:30:09,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=676, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2024-06-14 15:30:09,221 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2024-06-14 15:30:09,222 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 676 flow [2024-06-14 15:30:09,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-14 15:30:09,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:09,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:09,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:30:09,222 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:09,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash 41341533, now seen corresponding path program 1 times [2024-06-14 15:30:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:09,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333507915] [2024-06-14 15:30:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:17,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:17,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333507915] [2024-06-14 15:30:17,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333507915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:17,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:17,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23188229] [2024-06-14 15:30:17,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:17,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:17,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:17,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:17,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:30:17,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 676 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:30:17,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:17,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:30:17,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:18,358 INFO L124 PetriNetUnfolderBase]: 1785/2663 cut-off events. [2024-06-14 15:30:18,359 INFO L125 PetriNetUnfolderBase]: For 28795/28795 co-relation queries the response was YES. [2024-06-14 15:30:18,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13294 conditions, 2663 events. 1785/2663 cut-off events. For 28795/28795 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12089 event pairs, 491 based on Foata normal form. 6/2666 useless extension candidates. Maximal degree in co-relation 13259. Up to 2435 conditions per place. [2024-06-14 15:30:18,372 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 89 selfloop transitions, 35 changer transitions 0/127 dead transitions. [2024-06-14 15:30:18,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 127 transitions, 1099 flow [2024-06-14 15:30:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:30:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:30:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-14 15:30:18,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-14 15:30:18,375 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 676 flow. Second operand 8 states and 135 transitions. [2024-06-14 15:30:18,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 127 transitions, 1099 flow [2024-06-14 15:30:18,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 127 transitions, 1003 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-14 15:30:18,392 INFO L231 Difference]: Finished difference. Result has 85 places, 97 transitions, 768 flow [2024-06-14 15:30:18,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=768, PETRI_PLACES=85, PETRI_TRANSITIONS=97} [2024-06-14 15:30:18,393 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2024-06-14 15:30:18,393 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 97 transitions, 768 flow [2024-06-14 15:30:18,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:30:18,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:18,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:18,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:30:18,394 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-14 15:30:18,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash -810108461, now seen corresponding path program 2 times [2024-06-14 15:30:18,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:18,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022595998] [2024-06-14 15:30:18,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:27,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022595998] [2024-06-14 15:30:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022595998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:27,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:27,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:27,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873721144] [2024-06-14 15:30:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:27,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:27,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:27,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:27,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:30:27,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 97 transitions, 768 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:30:27,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:27,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:30:27,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:28,831 INFO L124 PetriNetUnfolderBase]: 1807/2695 cut-off events. [2024-06-14 15:30:28,831 INFO L125 PetriNetUnfolderBase]: For 31979/31979 co-relation queries the response was YES. [2024-06-14 15:30:28,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13861 conditions, 2695 events. 1807/2695 cut-off events. For 31979/31979 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12196 event pairs, 496 based on Foata normal form. 2/2694 useless extension candidates. Maximal degree in co-relation 13824. Up to 2595 conditions per place. [2024-06-14 15:30:28,846 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 104 selfloop transitions, 31 changer transitions 0/138 dead transitions. [2024-06-14 15:30:28,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 1211 flow [2024-06-14 15:30:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:30:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:30:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-14 15:30:28,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875338753387534 [2024-06-14 15:30:28,850 INFO L175 Difference]: Start difference. First operand has 85 places, 97 transitions, 768 flow. Second operand 9 states and 143 transitions. [2024-06-14 15:30:28,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 1211 flow [2024-06-14 15:30:28,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 138 transitions, 1155 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 15:30:28,872 INFO L231 Difference]: Finished difference. Result has 91 places, 108 transitions, 899 flow [2024-06-14 15:30:28,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=899, PETRI_PLACES=91, PETRI_TRANSITIONS=108} [2024-06-14 15:30:28,873 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2024-06-14 15:30:28,873 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 108 transitions, 899 flow [2024-06-14 15:30:28,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:30:28,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:28,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:28,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:30:28,874 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:28,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash -809841551, now seen corresponding path program 3 times [2024-06-14 15:30:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:28,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884417622] [2024-06-14 15:30:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:37,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:37,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884417622] [2024-06-14 15:30:37,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884417622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:37,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:37,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064229514] [2024-06-14 15:30:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:37,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:37,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:37,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:30:37,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 108 transitions, 899 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:30:37,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:37,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:30:37,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:38,590 INFO L124 PetriNetUnfolderBase]: 1818/2711 cut-off events. [2024-06-14 15:30:38,590 INFO L125 PetriNetUnfolderBase]: For 35706/35706 co-relation queries the response was YES. [2024-06-14 15:30:38,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14414 conditions, 2711 events. 1818/2711 cut-off events. For 35706/35706 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12266 event pairs, 496 based on Foata normal form. 2/2710 useless extension candidates. Maximal degree in co-relation 14374. Up to 2573 conditions per place. [2024-06-14 15:30:38,612 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 105 selfloop transitions, 43 changer transitions 0/151 dead transitions. [2024-06-14 15:30:38,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 151 transitions, 1443 flow [2024-06-14 15:30:38,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:30:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:30:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-06-14 15:30:38,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 15:30:38,617 INFO L175 Difference]: Start difference. First operand has 91 places, 108 transitions, 899 flow. Second operand 10 states and 160 transitions. [2024-06-14 15:30:38,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 151 transitions, 1443 flow [2024-06-14 15:30:38,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 151 transitions, 1383 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-14 15:30:38,646 INFO L231 Difference]: Finished difference. Result has 98 places, 115 transitions, 1053 flow [2024-06-14 15:30:38,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1053, PETRI_PLACES=98, PETRI_TRANSITIONS=115} [2024-06-14 15:30:38,647 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-14 15:30:38,648 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 115 transitions, 1053 flow [2024-06-14 15:30:38,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:30:38,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:38,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:38,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:30:38,649 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:38,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash 185232063, now seen corresponding path program 4 times [2024-06-14 15:30:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756413383] [2024-06-14 15:30:38,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:45,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756413383] [2024-06-14 15:30:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756413383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:45,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:45,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798709933] [2024-06-14 15:30:45,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:45,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:45,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:45,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:45,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:30:45,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 115 transitions, 1053 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:30:45,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:45,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:30:45,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:46,994 INFO L124 PetriNetUnfolderBase]: 1807/2696 cut-off events. [2024-06-14 15:30:46,994 INFO L125 PetriNetUnfolderBase]: For 38787/38802 co-relation queries the response was YES. [2024-06-14 15:30:47,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14541 conditions, 2696 events. 1807/2696 cut-off events. For 38787/38802 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12206 event pairs, 503 based on Foata normal form. 12/2703 useless extension candidates. Maximal degree in co-relation 14499. Up to 2594 conditions per place. [2024-06-14 15:30:47,009 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 106 selfloop transitions, 29 changer transitions 0/138 dead transitions. [2024-06-14 15:30:47,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 138 transitions, 1381 flow [2024-06-14 15:30:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:30:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:30:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-14 15:30:47,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 15:30:47,013 INFO L175 Difference]: Start difference. First operand has 98 places, 115 transitions, 1053 flow. Second operand 8 states and 128 transitions. [2024-06-14 15:30:47,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 138 transitions, 1381 flow [2024-06-14 15:30:47,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 138 transitions, 1291 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-14 15:30:47,040 INFO L231 Difference]: Finished difference. Result has 100 places, 115 transitions, 1029 flow [2024-06-14 15:30:47,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1029, PETRI_PLACES=100, PETRI_TRANSITIONS=115} [2024-06-14 15:30:47,040 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2024-06-14 15:30:47,040 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 115 transitions, 1029 flow [2024-06-14 15:30:47,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-14 15:30:47,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:47,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:47,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:30:47,041 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:47,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:47,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1324373511, now seen corresponding path program 1 times [2024-06-14 15:30:47,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:47,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259876726] [2024-06-14 15:30:47,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:47,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:56,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-14 15:30:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259876726] [2024-06-14 15:30:56,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259876726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:56,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:56,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:30:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072030736] [2024-06-14 15:30:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:56,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:30:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:56,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:30:56,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:30:56,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:30:56,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 115 transitions, 1029 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:56,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:56,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:30:56,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:57,422 INFO L124 PetriNetUnfolderBase]: 1761/2697 cut-off events. [2024-06-14 15:30:57,423 INFO L125 PetriNetUnfolderBase]: For 43433/43447 co-relation queries the response was YES. [2024-06-14 15:30:57,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14922 conditions, 2697 events. 1761/2697 cut-off events. For 43433/43447 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12922 event pairs, 459 based on Foata normal form. 8/2683 useless extension candidates. Maximal degree in co-relation 14878. Up to 2482 conditions per place. [2024-06-14 15:30:57,440 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 130 selfloop transitions, 31 changer transitions 0/169 dead transitions. [2024-06-14 15:30:57,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 169 transitions, 1631 flow [2024-06-14 15:30:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:30:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:30:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-14 15:30:57,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2024-06-14 15:30:57,443 INFO L175 Difference]: Start difference. First operand has 100 places, 115 transitions, 1029 flow. Second operand 9 states and 157 transitions. [2024-06-14 15:30:57,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 169 transitions, 1631 flow [2024-06-14 15:30:57,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 169 transitions, 1561 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:30:57,475 INFO L231 Difference]: Finished difference. Result has 106 places, 134 transitions, 1247 flow [2024-06-14 15:30:57,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1247, PETRI_PLACES=106, PETRI_TRANSITIONS=134} [2024-06-14 15:30:57,475 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2024-06-14 15:30:57,476 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 134 transitions, 1247 flow [2024-06-14 15:30:57,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:57,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:57,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:57,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:30:57,476 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:57,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash -643381639, now seen corresponding path program 2 times [2024-06-14 15:30:57,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:57,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488104311] [2024-06-14 15:30:57,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:05,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:05,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488104311] [2024-06-14 15:31:05,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488104311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:05,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:05,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:05,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335916916] [2024-06-14 15:31:05,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:05,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:05,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:05,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:05,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:05,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:31:05,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 134 transitions, 1247 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:05,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:05,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:31:05,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:06,762 INFO L124 PetriNetUnfolderBase]: 1802/2767 cut-off events. [2024-06-14 15:31:06,762 INFO L125 PetriNetUnfolderBase]: For 49469/49482 co-relation queries the response was YES. [2024-06-14 15:31:06,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15916 conditions, 2767 events. 1802/2767 cut-off events. For 49469/49482 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13416 event pairs, 321 based on Foata normal form. 12/2764 useless extension candidates. Maximal degree in co-relation 15869. Up to 2488 conditions per place. [2024-06-14 15:31:06,778 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 125 selfloop transitions, 34 changer transitions 0/167 dead transitions. [2024-06-14 15:31:06,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 167 transitions, 1707 flow [2024-06-14 15:31:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-14 15:31:06,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-14 15:31:06,781 INFO L175 Difference]: Start difference. First operand has 106 places, 134 transitions, 1247 flow. Second operand 8 states and 138 transitions. [2024-06-14 15:31:06,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 167 transitions, 1707 flow [2024-06-14 15:31:06,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 167 transitions, 1641 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-14 15:31:06,820 INFO L231 Difference]: Finished difference. Result has 111 places, 136 transitions, 1307 flow [2024-06-14 15:31:06,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1307, PETRI_PLACES=111, PETRI_TRANSITIONS=136} [2024-06-14 15:31:06,821 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2024-06-14 15:31:06,821 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 136 transitions, 1307 flow [2024-06-14 15:31:06,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:06,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:06,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:06,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:31:06,822 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:06,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash -643321189, now seen corresponding path program 3 times [2024-06-14 15:31:06,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:06,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005329002] [2024-06-14 15:31:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:06,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:15,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005329002] [2024-06-14 15:31:15,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005329002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:15,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:15,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721788227] [2024-06-14 15:31:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:15,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:15,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:15,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:15,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:31:15,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 136 transitions, 1307 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:15,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:15,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:31:15,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:16,869 INFO L124 PetriNetUnfolderBase]: 1831/2816 cut-off events. [2024-06-14 15:31:16,869 INFO L125 PetriNetUnfolderBase]: For 56521/56534 co-relation queries the response was YES. [2024-06-14 15:31:16,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16601 conditions, 2816 events. 1831/2816 cut-off events. For 56521/56534 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13692 event pairs, 423 based on Foata normal form. 16/2817 useless extension candidates. Maximal degree in co-relation 16553. Up to 2543 conditions per place. [2024-06-14 15:31:16,886 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 123 selfloop transitions, 38 changer transitions 0/169 dead transitions. [2024-06-14 15:31:16,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 169 transitions, 1777 flow [2024-06-14 15:31:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-14 15:31:16,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-14 15:31:16,889 INFO L175 Difference]: Start difference. First operand has 111 places, 136 transitions, 1307 flow. Second operand 8 states and 139 transitions. [2024-06-14 15:31:16,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 169 transitions, 1777 flow [2024-06-14 15:31:16,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 169 transitions, 1667 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:16,927 INFO L231 Difference]: Finished difference. Result has 113 places, 138 transitions, 1335 flow [2024-06-14 15:31:16,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1335, PETRI_PLACES=113, PETRI_TRANSITIONS=138} [2024-06-14 15:31:16,928 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-14 15:31:16,928 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 138 transitions, 1335 flow [2024-06-14 15:31:16,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:16,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:16,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:16,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:31:16,929 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:16,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash -525048811, now seen corresponding path program 1 times [2024-06-14 15:31:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:16,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367055526] [2024-06-14 15:31:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:25,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367055526] [2024-06-14 15:31:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367055526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:25,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227414314] [2024-06-14 15:31:25,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:25,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:25,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:31:25,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 138 transitions, 1335 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:25,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:25,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:31:25,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:27,190 INFO L124 PetriNetUnfolderBase]: 2004/3009 cut-off events. [2024-06-14 15:31:27,190 INFO L125 PetriNetUnfolderBase]: For 56091/56099 co-relation queries the response was YES. [2024-06-14 15:31:27,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17126 conditions, 3009 events. 2004/3009 cut-off events. For 56091/56099 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13971 event pairs, 471 based on Foata normal form. 12/3018 useless extension candidates. Maximal degree in co-relation 17077. Up to 2920 conditions per place. [2024-06-14 15:31:27,207 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 147 selfloop transitions, 22 changer transitions 0/172 dead transitions. [2024-06-14 15:31:27,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 172 transitions, 1815 flow [2024-06-14 15:31:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:31:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:31:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-14 15:31:27,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-14 15:31:27,210 INFO L175 Difference]: Start difference. First operand has 113 places, 138 transitions, 1335 flow. Second operand 9 states and 141 transitions. [2024-06-14 15:31:27,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 172 transitions, 1815 flow [2024-06-14 15:31:27,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 172 transitions, 1705 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:27,253 INFO L231 Difference]: Finished difference. Result has 116 places, 140 transitions, 1320 flow [2024-06-14 15:31:27,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1320, PETRI_PLACES=116, PETRI_TRANSITIONS=140} [2024-06-14 15:31:27,253 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2024-06-14 15:31:27,254 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 140 transitions, 1320 flow [2024-06-14 15:31:27,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:27,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:27,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:27,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:31:27,254 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:27,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:27,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1281403707, now seen corresponding path program 4 times [2024-06-14 15:31:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:27,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186759431] [2024-06-14 15:31:27,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:35,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:35,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186759431] [2024-06-14 15:31:35,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186759431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:35,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:35,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:35,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129369815] [2024-06-14 15:31:35,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:35,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:35,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:35,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:35,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:35,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:31:35,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 140 transitions, 1320 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:35,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:35,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:31:35,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:36,938 INFO L124 PetriNetUnfolderBase]: 1936/2989 cut-off events. [2024-06-14 15:31:36,938 INFO L125 PetriNetUnfolderBase]: For 68023/68034 co-relation queries the response was YES. [2024-06-14 15:31:36,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17528 conditions, 2989 events. 1936/2989 cut-off events. For 68023/68034 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14754 event pairs, 451 based on Foata normal form. 34/3013 useless extension candidates. Maximal degree in co-relation 17478. Up to 2489 conditions per place. [2024-06-14 15:31:36,956 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 114 selfloop transitions, 52 changer transitions 0/174 dead transitions. [2024-06-14 15:31:36,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 174 transitions, 1808 flow [2024-06-14 15:31:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-14 15:31:36,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-14 15:31:36,958 INFO L175 Difference]: Start difference. First operand has 116 places, 140 transitions, 1320 flow. Second operand 8 states and 145 transitions. [2024-06-14 15:31:36,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 174 transitions, 1808 flow [2024-06-14 15:31:36,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 174 transitions, 1713 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 15:31:36,999 INFO L231 Difference]: Finished difference. Result has 117 places, 142 transitions, 1393 flow [2024-06-14 15:31:36,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1393, PETRI_PLACES=117, PETRI_TRANSITIONS=142} [2024-06-14 15:31:37,000 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-14 15:31:37,000 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 142 transitions, 1393 flow [2024-06-14 15:31:37,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:37,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:37,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:37,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:31:37,001 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:37,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash -626017670, now seen corresponding path program 1 times [2024-06-14 15:31:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550568035] [2024-06-14 15:31:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:49,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550568035] [2024-06-14 15:31:49,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550568035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:49,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:49,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:31:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462794694] [2024-06-14 15:31:49,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:49,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:31:49,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:49,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:31:49,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:31:49,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:31:49,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 142 transitions, 1393 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:49,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:49,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:31:49,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:50,957 INFO L124 PetriNetUnfolderBase]: 2134/3217 cut-off events. [2024-06-14 15:31:50,957 INFO L125 PetriNetUnfolderBase]: For 69374/69382 co-relation queries the response was YES. [2024-06-14 15:31:50,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18875 conditions, 3217 events. 2134/3217 cut-off events. For 69374/69382 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15186 event pairs, 509 based on Foata normal form. 9/3223 useless extension candidates. Maximal degree in co-relation 18824. Up to 3149 conditions per place. [2024-06-14 15:31:50,978 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 146 selfloop transitions, 20 changer transitions 0/169 dead transitions. [2024-06-14 15:31:50,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 169 transitions, 1891 flow [2024-06-14 15:31:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:31:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:31:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-14 15:31:50,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:31:50,979 INFO L175 Difference]: Start difference. First operand has 117 places, 142 transitions, 1393 flow. Second operand 6 states and 102 transitions. [2024-06-14 15:31:50,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 169 transitions, 1891 flow [2024-06-14 15:31:51,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 169 transitions, 1757 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:51,036 INFO L231 Difference]: Finished difference. Result has 118 places, 149 transitions, 1388 flow [2024-06-14 15:31:51,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1388, PETRI_PLACES=118, PETRI_TRANSITIONS=149} [2024-06-14 15:31:51,037 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-14 15:31:51,037 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 149 transitions, 1388 flow [2024-06-14 15:31:51,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:51,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:51,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:51,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:31:51,038 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:51,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2100534629, now seen corresponding path program 5 times [2024-06-14 15:31:51,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:51,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310278373] [2024-06-14 15:31:51,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:51,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310278373] [2024-06-14 15:31:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310278373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:59,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:59,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731403539] [2024-06-14 15:31:59,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:59,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:59,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:59,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:00,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:32:00,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 149 transitions, 1388 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:00,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:00,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:32:00,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:01,417 INFO L124 PetriNetUnfolderBase]: 2024/3134 cut-off events. [2024-06-14 15:32:01,417 INFO L125 PetriNetUnfolderBase]: For 77907/77939 co-relation queries the response was YES. [2024-06-14 15:32:01,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18893 conditions, 3134 events. 2024/3134 cut-off events. For 77907/77939 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 15682 event pairs, 457 based on Foata normal form. 37/3150 useless extension candidates. Maximal degree in co-relation 18840. Up to 2501 conditions per place. [2024-06-14 15:32:01,438 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 100 selfloop transitions, 76 changer transitions 0/184 dead transitions. [2024-06-14 15:32:01,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 184 transitions, 1990 flow [2024-06-14 15:32:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:32:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:32:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 15:32:01,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-14 15:32:01,442 INFO L175 Difference]: Start difference. First operand has 118 places, 149 transitions, 1388 flow. Second operand 8 states and 149 transitions. [2024-06-14 15:32:01,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 184 transitions, 1990 flow [2024-06-14 15:32:01,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 184 transitions, 1956 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-14 15:32:01,500 INFO L231 Difference]: Finished difference. Result has 124 places, 151 transitions, 1572 flow [2024-06-14 15:32:01,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1572, PETRI_PLACES=124, PETRI_TRANSITIONS=151} [2024-06-14 15:32:01,501 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2024-06-14 15:32:01,501 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 151 transitions, 1572 flow [2024-06-14 15:32:01,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:01,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:01,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:01,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:32:01,502 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:01,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash 428361479, now seen corresponding path program 1 times [2024-06-14 15:32:01,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:01,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601867924] [2024-06-14 15:32:01,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:01,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:10,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:10,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601867924] [2024-06-14 15:32:10,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601867924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:10,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:10,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:10,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026689373] [2024-06-14 15:32:10,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:10,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:10,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:10,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:10,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:11,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:32:11,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 151 transitions, 1572 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:11,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:11,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:32:11,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:12,411 INFO L124 PetriNetUnfolderBase]: 2237/3384 cut-off events. [2024-06-14 15:32:12,411 INFO L125 PetriNetUnfolderBase]: For 79055/79061 co-relation queries the response was YES. [2024-06-14 15:32:12,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20489 conditions, 3384 events. 2237/3384 cut-off events. For 79055/79061 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 16355 event pairs, 507 based on Foata normal form. 10/3391 useless extension candidates. Maximal degree in co-relation 20434. Up to 2995 conditions per place. [2024-06-14 15:32:12,437 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 129 selfloop transitions, 65 changer transitions 0/197 dead transitions. [2024-06-14 15:32:12,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 197 transitions, 2173 flow [2024-06-14 15:32:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:32:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:32:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-14 15:32:12,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-14 15:32:12,441 INFO L175 Difference]: Start difference. First operand has 124 places, 151 transitions, 1572 flow. Second operand 10 states and 166 transitions. [2024-06-14 15:32:12,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 197 transitions, 2173 flow [2024-06-14 15:32:12,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 197 transitions, 1971 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-14 15:32:12,502 INFO L231 Difference]: Finished difference. Result has 129 places, 160 transitions, 1624 flow [2024-06-14 15:32:12,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1624, PETRI_PLACES=129, PETRI_TRANSITIONS=160} [2024-06-14 15:32:12,502 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-14 15:32:12,503 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 160 transitions, 1624 flow [2024-06-14 15:32:12,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:12,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:12,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:12,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:32:12,503 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:12,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash 428534459, now seen corresponding path program 2 times [2024-06-14 15:32:12,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677889538] [2024-06-14 15:32:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:22,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:22,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677889538] [2024-06-14 15:32:22,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677889538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:22,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:22,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:22,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748929183] [2024-06-14 15:32:22,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:22,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:22,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:22,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:22,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:22,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:32:22,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 160 transitions, 1624 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:22,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:22,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:32:22,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:23,644 INFO L124 PetriNetUnfolderBase]: 2281/3448 cut-off events. [2024-06-14 15:32:23,644 INFO L125 PetriNetUnfolderBase]: For 81342/81348 co-relation queries the response was YES. [2024-06-14 15:32:23,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20821 conditions, 3448 events. 2281/3448 cut-off events. For 81342/81348 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16680 event pairs, 507 based on Foata normal form. 10/3455 useless extension candidates. Maximal degree in co-relation 20764. Up to 3014 conditions per place. [2024-06-14 15:32:23,669 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 128 selfloop transitions, 73 changer transitions 0/204 dead transitions. [2024-06-14 15:32:23,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 204 transitions, 2226 flow [2024-06-14 15:32:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:32:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:32:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-14 15:32:23,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121951219512195 [2024-06-14 15:32:23,672 INFO L175 Difference]: Start difference. First operand has 129 places, 160 transitions, 1624 flow. Second operand 10 states and 169 transitions. [2024-06-14 15:32:23,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 204 transitions, 2226 flow [2024-06-14 15:32:23,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 204 transitions, 2122 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-14 15:32:23,747 INFO L231 Difference]: Finished difference. Result has 134 places, 166 transitions, 1768 flow [2024-06-14 15:32:23,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1768, PETRI_PLACES=134, PETRI_TRANSITIONS=166} [2024-06-14 15:32:23,748 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2024-06-14 15:32:23,748 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 166 transitions, 1768 flow [2024-06-14 15:32:23,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:23,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:23,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:23,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:32:23,749 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:23,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2100349931, now seen corresponding path program 2 times [2024-06-14 15:32:23,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:23,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302831783] [2024-06-14 15:32:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:23,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:32,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-14 15:32:32,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:32,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302831783] [2024-06-14 15:32:32,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302831783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:32,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:32,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:32,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624517525] [2024-06-14 15:32:32,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:32,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:32,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:32,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:32,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:32,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:32:32,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 166 transitions, 1768 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:32,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:32,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:32:32,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:33,868 INFO L124 PetriNetUnfolderBase]: 2298/3475 cut-off events. [2024-06-14 15:32:33,868 INFO L125 PetriNetUnfolderBase]: For 87270/87300 co-relation queries the response was YES. [2024-06-14 15:32:33,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21480 conditions, 3475 events. 2298/3475 cut-off events. For 87270/87300 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16841 event pairs, 526 based on Foata normal form. 24/3492 useless extension candidates. Maximal degree in co-relation 21421. Up to 3339 conditions per place. [2024-06-14 15:32:33,894 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 161 selfloop transitions, 34 changer transitions 0/198 dead transitions. [2024-06-14 15:32:33,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 198 transitions, 2304 flow [2024-06-14 15:32:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-14 15:32:33,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-14 15:32:33,896 INFO L175 Difference]: Start difference. First operand has 134 places, 166 transitions, 1768 flow. Second operand 9 states and 142 transitions. [2024-06-14 15:32:33,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 198 transitions, 2304 flow [2024-06-14 15:32:33,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 198 transitions, 2138 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-14 15:32:33,974 INFO L231 Difference]: Finished difference. Result has 136 places, 168 transitions, 1731 flow [2024-06-14 15:32:33,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1731, PETRI_PLACES=136, PETRI_TRANSITIONS=168} [2024-06-14 15:32:33,974 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2024-06-14 15:32:33,974 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 168 transitions, 1731 flow [2024-06-14 15:32:33,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:33,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:33,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:33,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:32:33,975 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:33,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:33,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2094100579, now seen corresponding path program 3 times [2024-06-14 15:32:33,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:33,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383312347] [2024-06-14 15:32:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:33,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:43,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:43,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383312347] [2024-06-14 15:32:43,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383312347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:43,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:43,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:43,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052788976] [2024-06-14 15:32:43,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:43,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:43,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:43,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:43,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:43,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:32:43,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 168 transitions, 1731 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:43,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:43,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:32:43,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:44,917 INFO L124 PetriNetUnfolderBase]: 2288/3461 cut-off events. [2024-06-14 15:32:44,917 INFO L125 PetriNetUnfolderBase]: For 80960/80966 co-relation queries the response was YES. [2024-06-14 15:32:44,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20956 conditions, 3461 events. 2288/3461 cut-off events. For 80960/80966 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16797 event pairs, 502 based on Foata normal form. 10/3468 useless extension candidates. Maximal degree in co-relation 20897. Up to 3050 conditions per place. [2024-06-14 15:32:44,939 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 130 selfloop transitions, 74 changer transitions 0/207 dead transitions. [2024-06-14 15:32:44,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 207 transitions, 2275 flow [2024-06-14 15:32:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:32:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:32:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-14 15:32:44,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-14 15:32:44,941 INFO L175 Difference]: Start difference. First operand has 136 places, 168 transitions, 1731 flow. Second operand 10 states and 166 transitions. [2024-06-14 15:32:44,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 207 transitions, 2275 flow [2024-06-14 15:32:45,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 207 transitions, 2142 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-14 15:32:45,014 INFO L231 Difference]: Finished difference. Result has 139 places, 170 transitions, 1778 flow [2024-06-14 15:32:45,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1778, PETRI_PLACES=139, PETRI_TRANSITIONS=170} [2024-06-14 15:32:45,015 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2024-06-14 15:32:45,015 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 170 transitions, 1778 flow [2024-06-14 15:32:45,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:45,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:45,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:45,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:32:45,016 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:45,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1872448781, now seen corresponding path program 3 times [2024-06-14 15:32:45,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:45,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068884772] [2024-06-14 15:32:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:53,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068884772] [2024-06-14 15:32:53,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068884772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:53,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:53,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:53,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559964910] [2024-06-14 15:32:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:53,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:53,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:53,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:32:53,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 170 transitions, 1778 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:53,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:53,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:32:53,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:54,942 INFO L124 PetriNetUnfolderBase]: 2305/3488 cut-off events. [2024-06-14 15:32:54,942 INFO L125 PetriNetUnfolderBase]: For 86581/86611 co-relation queries the response was YES. [2024-06-14 15:32:54,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21440 conditions, 3488 events. 2305/3488 cut-off events. For 86581/86611 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16942 event pairs, 534 based on Foata normal form. 24/3505 useless extension candidates. Maximal degree in co-relation 21380. Up to 3352 conditions per place. [2024-06-14 15:32:54,966 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 164 selfloop transitions, 35 changer transitions 0/202 dead transitions. [2024-06-14 15:32:54,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 202 transitions, 2326 flow [2024-06-14 15:32:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-14 15:32:54,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-14 15:32:54,969 INFO L175 Difference]: Start difference. First operand has 139 places, 170 transitions, 1778 flow. Second operand 9 states and 141 transitions. [2024-06-14 15:32:54,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 202 transitions, 2326 flow [2024-06-14 15:32:55,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 202 transitions, 2177 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:32:55,031 INFO L231 Difference]: Finished difference. Result has 141 places, 172 transitions, 1764 flow [2024-06-14 15:32:55,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1764, PETRI_PLACES=141, PETRI_TRANSITIONS=172} [2024-06-14 15:32:55,032 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2024-06-14 15:32:55,032 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 172 transitions, 1764 flow [2024-06-14 15:32:55,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:55,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:55,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:55,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:32:55,032 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:55,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash 665013247, now seen corresponding path program 4 times [2024-06-14 15:32:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:55,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012176525] [2024-06-14 15:32:55,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:03,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012176525] [2024-06-14 15:33:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012176525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:03,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571323500] [2024-06-14 15:33:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:03,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:03,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:03,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:33:03,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 172 transitions, 1764 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:03,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:03,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:33:03,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:05,057 INFO L124 PetriNetUnfolderBase]: 2322/3515 cut-off events. [2024-06-14 15:33:05,058 INFO L125 PetriNetUnfolderBase]: For 93485/93515 co-relation queries the response was YES. [2024-06-14 15:33:05,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21797 conditions, 3515 events. 2322/3515 cut-off events. For 93485/93515 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17150 event pairs, 499 based on Foata normal form. 24/3532 useless extension candidates. Maximal degree in co-relation 21736. Up to 3242 conditions per place. [2024-06-14 15:33:05,084 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 151 selfloop transitions, 55 changer transitions 0/209 dead transitions. [2024-06-14 15:33:05,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 209 transitions, 2498 flow [2024-06-14 15:33:05,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:33:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:33:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-14 15:33:05,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2024-06-14 15:33:05,087 INFO L175 Difference]: Start difference. First operand has 141 places, 172 transitions, 1764 flow. Second operand 9 states and 145 transitions. [2024-06-14 15:33:05,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 209 transitions, 2498 flow [2024-06-14 15:33:05,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 209 transitions, 2381 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-14 15:33:05,160 INFO L231 Difference]: Finished difference. Result has 143 places, 176 transitions, 1884 flow [2024-06-14 15:33:05,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1884, PETRI_PLACES=143, PETRI_TRANSITIONS=176} [2024-06-14 15:33:05,160 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2024-06-14 15:33:05,160 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 176 transitions, 1884 flow [2024-06-14 15:33:05,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:05,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:05,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:33:05,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:33:05,161 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:05,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1864174571, now seen corresponding path program 5 times [2024-06-14 15:33:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13330147] [2024-06-14 15:33:05,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:13,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13330147] [2024-06-14 15:33:13,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13330147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:13,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:13,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:13,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760637381] [2024-06-14 15:33:13,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:13,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:13,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:13,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:13,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:13,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:33:13,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 176 transitions, 1884 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:13,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:13,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:33:13,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:15,225 INFO L124 PetriNetUnfolderBase]: 2314/3503 cut-off events. [2024-06-14 15:33:15,225 INFO L125 PetriNetUnfolderBase]: For 97892/97922 co-relation queries the response was YES. [2024-06-14 15:33:15,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21893 conditions, 3503 events. 2314/3503 cut-off events. For 97892/97922 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17006 event pairs, 532 based on Foata normal form. 24/3520 useless extension candidates. Maximal degree in co-relation 21831. Up to 3331 conditions per place. [2024-06-14 15:33:15,247 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 157 selfloop transitions, 46 changer transitions 0/206 dead transitions. [2024-06-14 15:33:15,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 206 transitions, 2386 flow [2024-06-14 15:33:15,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:33:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:33:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-14 15:33:15,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-14 15:33:15,250 INFO L175 Difference]: Start difference. First operand has 143 places, 176 transitions, 1884 flow. Second operand 9 states and 142 transitions. [2024-06-14 15:33:15,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 206 transitions, 2386 flow [2024-06-14 15:33:15,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 206 transitions, 2238 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-06-14 15:33:15,327 INFO L231 Difference]: Finished difference. Result has 147 places, 176 transitions, 1835 flow [2024-06-14 15:33:15,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1835, PETRI_PLACES=147, PETRI_TRANSITIONS=176} [2024-06-14 15:33:15,327 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2024-06-14 15:33:15,327 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 176 transitions, 1835 flow [2024-06-14 15:33:15,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:15,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:15,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:33:15,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:33:15,328 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:15,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash -168545722, now seen corresponding path program 2 times [2024-06-14 15:33:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574544538] [2024-06-14 15:33:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:15,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:27,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:27,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574544538] [2024-06-14 15:33:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574544538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:27,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:27,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:33:27,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250574583] [2024-06-14 15:33:27,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:27,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:33:27,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:27,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:33:27,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:33:27,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:33:27,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 176 transitions, 1835 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:27,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:27,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:33:27,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:29,099 INFO L124 PetriNetUnfolderBase]: 2311/3499 cut-off events. [2024-06-14 15:33:29,099 INFO L125 PetriNetUnfolderBase]: For 99918/99948 co-relation queries the response was YES. [2024-06-14 15:33:29,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21911 conditions, 3499 events. 2311/3499 cut-off events. For 99918/99948 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16909 event pairs, 532 based on Foata normal form. 21/3513 useless extension candidates. Maximal degree in co-relation 21847. Up to 3447 conditions per place. [2024-06-14 15:33:29,121 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 170 selfloop transitions, 19 changer transitions 0/192 dead transitions. [2024-06-14 15:33:29,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 192 transitions, 2296 flow [2024-06-14 15:33:29,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:33:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:33:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-06-14 15:33:29,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2024-06-14 15:33:29,124 INFO L175 Difference]: Start difference. First operand has 147 places, 176 transitions, 1835 flow. Second operand 6 states and 91 transitions. [2024-06-14 15:33:29,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 192 transitions, 2296 flow [2024-06-14 15:33:29,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 192 transitions, 2168 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:33:29,198 INFO L231 Difference]: Finished difference. Result has 146 places, 181 transitions, 1815 flow [2024-06-14 15:33:29,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1815, PETRI_PLACES=146, PETRI_TRANSITIONS=181} [2024-06-14 15:33:29,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2024-06-14 15:33:29,198 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 181 transitions, 1815 flow [2024-06-14 15:33:29,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:29,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:29,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:33:29,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:33:29,199 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:29,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:29,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1874481212, now seen corresponding path program 1 times [2024-06-14 15:33:29,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:29,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667536150] [2024-06-14 15:33:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:38,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-14 15:33:38,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:38,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667536150] [2024-06-14 15:33:38,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667536150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:38,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:38,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:33:38,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761719999] [2024-06-14 15:33:38,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:38,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:33:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:38,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:33:38,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:33:38,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:33:38,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 181 transitions, 1815 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:38,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:38,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:33:38,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:40,178 INFO L124 PetriNetUnfolderBase]: 2160/3355 cut-off events. [2024-06-14 15:33:40,179 INFO L125 PetriNetUnfolderBase]: For 105279/105279 co-relation queries the response was YES. [2024-06-14 15:33:40,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21217 conditions, 3355 events. 2160/3355 cut-off events. For 105279/105279 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16860 event pairs, 512 based on Foata normal form. 3/3352 useless extension candidates. Maximal degree in co-relation 21151. Up to 3188 conditions per place. [2024-06-14 15:33:40,209 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 178 selfloop transitions, 18 changer transitions 0/203 dead transitions. [2024-06-14 15:33:40,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 203 transitions, 2363 flow [2024-06-14 15:33:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:33:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:33:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-14 15:33:40,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186991869918699 [2024-06-14 15:33:40,211 INFO L175 Difference]: Start difference. First operand has 146 places, 181 transitions, 1815 flow. Second operand 6 states and 103 transitions. [2024-06-14 15:33:40,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 203 transitions, 2363 flow [2024-06-14 15:33:40,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 203 transitions, 2312 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-14 15:33:40,287 INFO L231 Difference]: Finished difference. Result has 149 places, 187 transitions, 1866 flow [2024-06-14 15:33:40,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1866, PETRI_PLACES=149, PETRI_TRANSITIONS=187} [2024-06-14 15:33:40,287 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-14 15:33:40,287 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 187 transitions, 1866 flow [2024-06-14 15:33:40,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:40,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:40,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:33:40,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:33:40,288 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:40,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash 129893212, now seen corresponding path program 2 times [2024-06-14 15:33:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:40,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717133538] [2024-06-14 15:33:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:50,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717133538] [2024-06-14 15:33:50,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717133538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:50,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:50,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:33:50,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673462657] [2024-06-14 15:33:50,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:50,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:33:50,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:50,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:33:50,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:33:50,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:33:50,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 187 transitions, 1866 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:50,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:50,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:33:50,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:51,515 INFO L124 PetriNetUnfolderBase]: 2151/3344 cut-off events. [2024-06-14 15:33:51,515 INFO L125 PetriNetUnfolderBase]: For 104288/104288 co-relation queries the response was YES. [2024-06-14 15:33:51,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21362 conditions, 3344 events. 2151/3344 cut-off events. For 104288/104288 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16776 event pairs, 508 based on Foata normal form. 3/3344 useless extension candidates. Maximal degree in co-relation 21295. Up to 3196 conditions per place. [2024-06-14 15:33:51,540 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 178 selfloop transitions, 13 changer transitions 0/198 dead transitions. [2024-06-14 15:33:51,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 198 transitions, 2278 flow [2024-06-14 15:33:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:33:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:33:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-14 15:33:51,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 15:33:51,542 INFO L175 Difference]: Start difference. First operand has 149 places, 187 transitions, 1866 flow. Second operand 6 states and 96 transitions. [2024-06-14 15:33:51,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 198 transitions, 2278 flow [2024-06-14 15:33:51,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 198 transitions, 2228 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-14 15:33:51,639 INFO L231 Difference]: Finished difference. Result has 152 places, 187 transitions, 1849 flow [2024-06-14 15:33:51,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1849, PETRI_PLACES=152, PETRI_TRANSITIONS=187} [2024-06-14 15:33:51,639 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-14 15:33:51,639 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 187 transitions, 1849 flow [2024-06-14 15:33:51,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:51,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:51,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:33:51,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:33:51,640 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:51,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:51,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1618726073, now seen corresponding path program 1 times [2024-06-14 15:33:51,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:51,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460381389] [2024-06-14 15:33:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:51,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:00,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:00,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460381389] [2024-06-14 15:34:00,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460381389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:00,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:00,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:34:00,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758135369] [2024-06-14 15:34:00,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:00,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:34:00,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:00,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:34:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:34:00,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:34:00,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 187 transitions, 1849 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:00,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:00,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:34:00,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:02,098 INFO L124 PetriNetUnfolderBase]: 2392/3631 cut-off events. [2024-06-14 15:34:02,098 INFO L125 PetriNetUnfolderBase]: For 121478/121486 co-relation queries the response was YES. [2024-06-14 15:34:02,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23144 conditions, 3631 events. 2392/3631 cut-off events. For 121478/121486 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17914 event pairs, 523 based on Foata normal form. 28/3656 useless extension candidates. Maximal degree in co-relation 23076. Up to 3191 conditions per place. [2024-06-14 15:34:02,124 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 175 selfloop transitions, 55 changer transitions 0/233 dead transitions. [2024-06-14 15:34:02,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 233 transitions, 2501 flow [2024-06-14 15:34:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:34:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:34:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-14 15:34:02,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121951219512195 [2024-06-14 15:34:02,127 INFO L175 Difference]: Start difference. First operand has 152 places, 187 transitions, 1849 flow. Second operand 10 states and 169 transitions. [2024-06-14 15:34:02,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 233 transitions, 2501 flow [2024-06-14 15:34:02,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 233 transitions, 2467 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 15:34:02,227 INFO L231 Difference]: Finished difference. Result has 157 places, 188 transitions, 1977 flow [2024-06-14 15:34:02,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1977, PETRI_PLACES=157, PETRI_TRANSITIONS=188} [2024-06-14 15:34:02,228 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 115 predicate places. [2024-06-14 15:34:02,228 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 188 transitions, 1977 flow [2024-06-14 15:34:02,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:02,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:02,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:34:02,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:34:02,229 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:34:02,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2067991144, now seen corresponding path program 1 times [2024-06-14 15:34:02,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:02,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231023460] [2024-06-14 15:34:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:16,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-14 15:34:16,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:16,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231023460] [2024-06-14 15:34:16,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231023460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:16,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:16,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:34:16,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404957243] [2024-06-14 15:34:16,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:16,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:34:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:16,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:34:16,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:34:16,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:34:16,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 188 transitions, 1977 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:16,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:16,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:34:16,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:17,772 INFO L124 PetriNetUnfolderBase]: 2434/3689 cut-off events. [2024-06-14 15:34:17,772 INFO L125 PetriNetUnfolderBase]: For 121479/121487 co-relation queries the response was YES. [2024-06-14 15:34:17,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24030 conditions, 3689 events. 2434/3689 cut-off events. For 121479/121487 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18190 event pairs, 540 based on Foata normal form. 10/3696 useless extension candidates. Maximal degree in co-relation 23961. Up to 3501 conditions per place. [2024-06-14 15:34:17,803 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 177 selfloop transitions, 44 changer transitions 0/224 dead transitions. [2024-06-14 15:34:17,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 224 transitions, 2705 flow [2024-06-14 15:34:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:34:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:34:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-14 15:34:17,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-14 15:34:17,805 INFO L175 Difference]: Start difference. First operand has 157 places, 188 transitions, 1977 flow. Second operand 7 states and 125 transitions. [2024-06-14 15:34:17,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 224 transitions, 2705 flow [2024-06-14 15:34:17,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 224 transitions, 2575 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:34:17,908 INFO L231 Difference]: Finished difference. Result has 157 places, 195 transitions, 2046 flow [2024-06-14 15:34:17,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2046, PETRI_PLACES=157, PETRI_TRANSITIONS=195} [2024-06-14 15:34:17,908 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 115 predicate places. [2024-06-14 15:34:17,909 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 195 transitions, 2046 flow [2024-06-14 15:34:17,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:17,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:17,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:34:17,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:34:17,909 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:34:17,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2144384603, now seen corresponding path program 2 times [2024-06-14 15:34:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:17,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145491267] [2024-06-14 15:34:17,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:17,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:26,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145491267] [2024-06-14 15:34:26,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145491267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:26,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:26,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:34:26,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918703252] [2024-06-14 15:34:26,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:26,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:34:26,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:26,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:34:26,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:34:26,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:34:26,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 195 transitions, 2046 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:26,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:26,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:34:26,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:28,277 INFO L124 PetriNetUnfolderBase]: 2587/3946 cut-off events. [2024-06-14 15:34:28,277 INFO L125 PetriNetUnfolderBase]: For 144267/144273 co-relation queries the response was YES. [2024-06-14 15:34:28,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26137 conditions, 3946 events. 2587/3946 cut-off events. For 144267/144273 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19968 event pairs, 576 based on Foata normal form. 22/3965 useless extension candidates. Maximal degree in co-relation 26066. Up to 3128 conditions per place. [2024-06-14 15:34:28,308 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 185 selfloop transitions, 55 changer transitions 0/243 dead transitions. [2024-06-14 15:34:28,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 243 transitions, 2898 flow [2024-06-14 15:34:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:34:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:34:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-14 15:34:28,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2024-06-14 15:34:28,311 INFO L175 Difference]: Start difference. First operand has 157 places, 195 transitions, 2046 flow. Second operand 9 states and 157 transitions. [2024-06-14 15:34:28,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 243 transitions, 2898 flow [2024-06-14 15:34:28,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 243 transitions, 2836 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-14 15:34:28,417 INFO L231 Difference]: Finished difference. Result has 164 places, 199 transitions, 2220 flow [2024-06-14 15:34:28,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2220, PETRI_PLACES=164, PETRI_TRANSITIONS=199} [2024-06-14 15:34:28,418 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 122 predicate places. [2024-06-14 15:34:28,418 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 199 transitions, 2220 flow [2024-06-14 15:34:28,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:28,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:28,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:34:28,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:34:28,418 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:34:28,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2068290046, now seen corresponding path program 1 times [2024-06-14 15:34:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:28,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793957375] [2024-06-14 15:34:28,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:28,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:41,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:41,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793957375] [2024-06-14 15:34:41,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793957375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:41,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:41,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:34:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690655094] [2024-06-14 15:34:41,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:41,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:34:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:34:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:34:41,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:34:41,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 199 transitions, 2220 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:41,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:41,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:34:41,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:43,299 INFO L124 PetriNetUnfolderBase]: 2597/3958 cut-off events. [2024-06-14 15:34:43,299 INFO L125 PetriNetUnfolderBase]: For 146282/146290 co-relation queries the response was YES. [2024-06-14 15:34:43,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26716 conditions, 3958 events. 2597/3958 cut-off events. For 146282/146290 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20040 event pairs, 598 based on Foata normal form. 10/3965 useless extension candidates. Maximal degree in co-relation 26642. Up to 3876 conditions per place. [2024-06-14 15:34:43,333 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 194 selfloop transitions, 29 changer transitions 0/226 dead transitions. [2024-06-14 15:34:43,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 226 transitions, 2894 flow [2024-06-14 15:34:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:34:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:34:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-14 15:34:43,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-14 15:34:43,336 INFO L175 Difference]: Start difference. First operand has 164 places, 199 transitions, 2220 flow. Second operand 7 states and 114 transitions. [2024-06-14 15:34:43,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 226 transitions, 2894 flow [2024-06-14 15:34:43,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 226 transitions, 2817 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 15:34:43,482 INFO L231 Difference]: Finished difference. Result has 167 places, 205 transitions, 2309 flow [2024-06-14 15:34:43,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2309, PETRI_PLACES=167, PETRI_TRANSITIONS=205} [2024-06-14 15:34:43,483 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2024-06-14 15:34:43,483 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 205 transitions, 2309 flow [2024-06-14 15:34:43,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:43,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:43,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:34:43,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:34:43,483 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:34:43,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2068289674, now seen corresponding path program 2 times [2024-06-14 15:34:43,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:43,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396559300] [2024-06-14 15:34:43,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396559300] [2024-06-14 15:34:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396559300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:57,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:34:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051996278] [2024-06-14 15:34:57,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:57,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:34:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:57,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:34:57,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:34:57,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:34:57,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 205 transitions, 2309 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:57,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:57,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:34:57,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:58,599 INFO L124 PetriNetUnfolderBase]: 2607/3974 cut-off events. [2024-06-14 15:34:58,600 INFO L125 PetriNetUnfolderBase]: For 151289/151295 co-relation queries the response was YES. [2024-06-14 15:34:58,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27036 conditions, 3974 events. 2607/3974 cut-off events. For 151289/151295 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20172 event pairs, 620 based on Foata normal form. 8/3979 useless extension candidates. Maximal degree in co-relation 26960. Up to 3823 conditions per place. [2024-06-14 15:34:58,629 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 186 selfloop transitions, 40 changer transitions 0/229 dead transitions. [2024-06-14 15:34:58,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 229 transitions, 2948 flow [2024-06-14 15:34:58,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:34:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:34:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-14 15:34:58,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-14 15:34:58,631 INFO L175 Difference]: Start difference. First operand has 167 places, 205 transitions, 2309 flow. Second operand 7 states and 114 transitions. [2024-06-14 15:34:58,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 229 transitions, 2948 flow [2024-06-14 15:34:58,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 229 transitions, 2879 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-14 15:34:58,756 INFO L231 Difference]: Finished difference. Result has 171 places, 210 transitions, 2389 flow [2024-06-14 15:34:58,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2389, PETRI_PLACES=171, PETRI_TRANSITIONS=210} [2024-06-14 15:34:58,757 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-14 15:34:58,757 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 210 transitions, 2389 flow [2024-06-14 15:34:58,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:58,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:58,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:34:58,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:34:58,758 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:34:58,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash -686337787, now seen corresponding path program 3 times [2024-06-14 15:34:58,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006860201] [2024-06-14 15:34:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:07,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006860201] [2024-06-14 15:35:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006860201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:07,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:35:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679764030] [2024-06-14 15:35:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:07,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:35:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:35:07,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:35:07,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:35:07,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 210 transitions, 2389 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:07,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:07,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:35:07,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:09,271 INFO L124 PetriNetUnfolderBase]: 2890/4437 cut-off events. [2024-06-14 15:35:09,271 INFO L125 PetriNetUnfolderBase]: For 182645/182651 co-relation queries the response was YES. [2024-06-14 15:35:09,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30209 conditions, 4437 events. 2890/4437 cut-off events. For 182645/182651 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23326 event pairs, 632 based on Foata normal form. 22/4456 useless extension candidates. Maximal degree in co-relation 30131. Up to 3403 conditions per place. [2024-06-14 15:35:09,309 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 169 selfloop transitions, 92 changer transitions 0/264 dead transitions. [2024-06-14 15:35:09,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 264 transitions, 3326 flow [2024-06-14 15:35:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:35:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:35:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-14 15:35:09,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43414634146341463 [2024-06-14 15:35:09,312 INFO L175 Difference]: Start difference. First operand has 171 places, 210 transitions, 2389 flow. Second operand 10 states and 178 transitions. [2024-06-14 15:35:09,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 264 transitions, 3326 flow [2024-06-14 15:35:09,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 264 transitions, 3290 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-14 15:35:09,472 INFO L231 Difference]: Finished difference. Result has 180 places, 216 transitions, 2683 flow [2024-06-14 15:35:09,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2683, PETRI_PLACES=180, PETRI_TRANSITIONS=216} [2024-06-14 15:35:09,472 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places. [2024-06-14 15:35:09,472 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 216 transitions, 2683 flow [2024-06-14 15:35:09,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:09,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:09,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:09,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:35:09,473 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:35:09,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:09,473 INFO L85 PathProgramCache]: Analyzing trace with hash 399667223, now seen corresponding path program 4 times [2024-06-14 15:35:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:09,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186806332] [2024-06-14 15:35:09,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:18,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:18,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186806332] [2024-06-14 15:35:18,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186806332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:18,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:18,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:35:18,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294184632] [2024-06-14 15:35:18,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:18,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:35:18,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:18,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:35:18,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:35:18,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:35:18,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 216 transitions, 2683 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:18,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:18,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:35:18,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:20,550 INFO L124 PetriNetUnfolderBase]: 2915/4484 cut-off events. [2024-06-14 15:35:20,550 INFO L125 PetriNetUnfolderBase]: For 194683/194713 co-relation queries the response was YES. [2024-06-14 15:35:20,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31043 conditions, 4484 events. 2915/4484 cut-off events. For 194683/194713 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23768 event pairs, 677 based on Foata normal form. 40/4517 useless extension candidates. Maximal degree in co-relation 30961. Up to 3897 conditions per place. [2024-06-14 15:35:20,586 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 180 selfloop transitions, 78 changer transitions 0/261 dead transitions. [2024-06-14 15:35:20,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 261 transitions, 3398 flow [2024-06-14 15:35:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:35:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:35:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-14 15:35:20,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-14 15:35:20,589 INFO L175 Difference]: Start difference. First operand has 180 places, 216 transitions, 2683 flow. Second operand 10 states and 172 transitions. [2024-06-14 15:35:20,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 261 transitions, 3398 flow [2024-06-14 15:35:20,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 261 transitions, 3294 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-14 15:35:20,789 INFO L231 Difference]: Finished difference. Result has 186 places, 217 transitions, 2796 flow [2024-06-14 15:35:20,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2581, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2796, PETRI_PLACES=186, PETRI_TRANSITIONS=217} [2024-06-14 15:35:20,789 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places. [2024-06-14 15:35:20,790 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 217 transitions, 2796 flow [2024-06-14 15:35:20,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:20,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:20,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:20,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:35:20,790 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:35:20,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:20,791 INFO L85 PathProgramCache]: Analyzing trace with hash 349394485, now seen corresponding path program 5 times [2024-06-14 15:35:20,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:20,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780559778] [2024-06-14 15:35:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780559778] [2024-06-14 15:35:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780559778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:28,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:28,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:35:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688027033] [2024-06-14 15:35:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:28,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:35:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:28,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:35:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:35:28,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:35:28,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 217 transitions, 2796 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:28,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:28,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:35:28,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:30,701 INFO L124 PetriNetUnfolderBase]: 3145/4854 cut-off events. [2024-06-14 15:35:30,701 INFO L125 PetriNetUnfolderBase]: For 218221/218251 co-relation queries the response was YES. [2024-06-14 15:35:30,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34279 conditions, 4854 events. 3145/4854 cut-off events. For 218221/218251 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 26308 event pairs, 725 based on Foata normal form. 36/4883 useless extension candidates. Maximal degree in co-relation 34195. Up to 4066 conditions per place. [2024-06-14 15:35:30,751 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 202 selfloop transitions, 72 changer transitions 0/277 dead transitions. [2024-06-14 15:35:30,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 277 transitions, 3844 flow [2024-06-14 15:35:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:35:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:35:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-06-14 15:35:30,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41019955654101997 [2024-06-14 15:35:30,754 INFO L175 Difference]: Start difference. First operand has 186 places, 217 transitions, 2796 flow. Second operand 11 states and 185 transitions. [2024-06-14 15:35:30,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 277 transitions, 3844 flow [2024-06-14 15:35:30,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 277 transitions, 3662 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-14 15:35:30,983 INFO L231 Difference]: Finished difference. Result has 191 places, 225 transitions, 2997 flow [2024-06-14 15:35:30,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2620, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2997, PETRI_PLACES=191, PETRI_TRANSITIONS=225} [2024-06-14 15:35:30,983 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places. [2024-06-14 15:35:30,984 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 225 transitions, 2997 flow [2024-06-14 15:35:30,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:30,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:30,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:30,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:35:30,984 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:35:30,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1125331719, now seen corresponding path program 6 times [2024-06-14 15:35:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965428765] [2024-06-14 15:35:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:30,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:40,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965428765] [2024-06-14 15:35:40,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965428765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:40,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:40,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:35:40,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662481960] [2024-06-14 15:35:40,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:40,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:35:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:35:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:35:40,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:35:40,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 225 transitions, 2997 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:40,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:40,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:35:40,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:42,234 INFO L124 PetriNetUnfolderBase]: 3170/4901 cut-off events. [2024-06-14 15:35:42,235 INFO L125 PetriNetUnfolderBase]: For 225176/225206 co-relation queries the response was YES. [2024-06-14 15:35:42,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34581 conditions, 4901 events. 3170/4901 cut-off events. For 225176/225206 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 26719 event pairs, 731 based on Foata normal form. 40/4934 useless extension candidates. Maximal degree in co-relation 34494. Up to 4339 conditions per place. [2024-06-14 15:35:42,277 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 188 selfloop transitions, 79 changer transitions 0/270 dead transitions. [2024-06-14 15:35:42,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 270 transitions, 3732 flow [2024-06-14 15:35:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:35:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:35:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-14 15:35:42,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4170731707317073 [2024-06-14 15:35:42,280 INFO L175 Difference]: Start difference. First operand has 191 places, 225 transitions, 2997 flow. Second operand 10 states and 171 transitions. [2024-06-14 15:35:42,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 270 transitions, 3732 flow [2024-06-14 15:35:42,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 270 transitions, 3611 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-14 15:35:42,546 INFO L231 Difference]: Finished difference. Result has 194 places, 226 transitions, 3095 flow [2024-06-14 15:35:42,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2880, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3095, PETRI_PLACES=194, PETRI_TRANSITIONS=226} [2024-06-14 15:35:42,547 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places. [2024-06-14 15:35:42,547 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 226 transitions, 3095 flow [2024-06-14 15:35:42,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:42,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:42,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:42,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:35:42,548 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:35:42,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:42,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1945639449, now seen corresponding path program 7 times [2024-06-14 15:35:42,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:42,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968077159] [2024-06-14 15:35:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:51,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:51,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968077159] [2024-06-14 15:35:51,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968077159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:51,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:51,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:35:51,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485482248] [2024-06-14 15:35:51,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:51,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:35:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:51,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:35:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:35:52,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:35:52,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 226 transitions, 3095 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:52,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:52,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:35:52,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:54,162 INFO L124 PetriNetUnfolderBase]: 3484/5431 cut-off events. [2024-06-14 15:35:54,162 INFO L125 PetriNetUnfolderBase]: For 246837/246867 co-relation queries the response was YES. [2024-06-14 15:35:54,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38064 conditions, 5431 events. 3484/5431 cut-off events. For 246837/246867 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30587 event pairs, 771 based on Foata normal form. 36/5460 useless extension candidates. Maximal degree in co-relation 37976. Up to 3545 conditions per place. [2024-06-14 15:35:54,213 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 195 selfloop transitions, 84 changer transitions 0/282 dead transitions. [2024-06-14 15:35:54,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 282 transitions, 4186 flow [2024-06-14 15:35:54,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:35:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:35:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-14 15:35:54,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121951219512195 [2024-06-14 15:35:54,218 INFO L175 Difference]: Start difference. First operand has 194 places, 226 transitions, 3095 flow. Second operand 10 states and 169 transitions. [2024-06-14 15:35:54,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 282 transitions, 4186 flow [2024-06-14 15:35:54,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 282 transitions, 4004 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-14 15:35:54,496 INFO L231 Difference]: Finished difference. Result has 197 places, 233 transitions, 3349 flow [2024-06-14 15:35:54,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2915, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3349, PETRI_PLACES=197, PETRI_TRANSITIONS=233} [2024-06-14 15:35:54,496 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-14 15:35:54,497 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 233 transitions, 3349 flow [2024-06-14 15:35:54,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:54,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:54,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:54,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:35:54,497 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:35:54,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1871998500, now seen corresponding path program 2 times [2024-06-14 15:35:54,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:54,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939011898] [2024-06-14 15:35:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:07,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:07,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939011898] [2024-06-14 15:36:07,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939011898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:07,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:07,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104679113] [2024-06-14 15:36:07,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:07,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:07,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:36:07,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 233 transitions, 3349 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:07,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:07,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:36:07,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:09,750 INFO L124 PetriNetUnfolderBase]: 3478/5425 cut-off events. [2024-06-14 15:36:09,751 INFO L125 PetriNetUnfolderBase]: For 245317/245317 co-relation queries the response was YES. [2024-06-14 15:36:09,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38468 conditions, 5425 events. 3478/5425 cut-off events. For 245317/245317 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30674 event pairs, 896 based on Foata normal form. 2/5424 useless extension candidates. Maximal degree in co-relation 38378. Up to 5385 conditions per place. [2024-06-14 15:36:09,796 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 228 selfloop transitions, 14 changer transitions 0/245 dead transitions. [2024-06-14 15:36:09,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 245 transitions, 3865 flow [2024-06-14 15:36:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-14 15:36:09,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3554006968641115 [2024-06-14 15:36:09,798 INFO L175 Difference]: Start difference. First operand has 197 places, 233 transitions, 3349 flow. Second operand 7 states and 102 transitions. [2024-06-14 15:36:09,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 245 transitions, 3865 flow [2024-06-14 15:36:10,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 245 transitions, 3681 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-14 15:36:10,099 INFO L231 Difference]: Finished difference. Result has 197 places, 233 transitions, 3199 flow [2024-06-14 15:36:10,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3165, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3199, PETRI_PLACES=197, PETRI_TRANSITIONS=233} [2024-06-14 15:36:10,099 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-14 15:36:10,099 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 233 transitions, 3199 flow [2024-06-14 15:36:10,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:10,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:10,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:10,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:36:10,100 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:36:10,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1872414582, now seen corresponding path program 3 times [2024-06-14 15:36:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:10,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640144298] [2024-06-14 15:36:10,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:10,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640144298] [2024-06-14 15:36:23,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640144298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:23,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:23,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289432712] [2024-06-14 15:36:23,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:23,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:23,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:23,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:23,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:23,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:36:23,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 233 transitions, 3199 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:23,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:23,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:36:23,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:25,337 INFO L124 PetriNetUnfolderBase]: 3472/5418 cut-off events. [2024-06-14 15:36:25,337 INFO L125 PetriNetUnfolderBase]: For 248200/248224 co-relation queries the response was YES. [2024-06-14 15:36:25,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37814 conditions, 5418 events. 3472/5418 cut-off events. For 248200/248224 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30619 event pairs, 898 based on Foata normal form. 14/5418 useless extension candidates. Maximal degree in co-relation 37723. Up to 5267 conditions per place. [2024-06-14 15:36:25,385 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 202 selfloop transitions, 40 changer transitions 0/245 dead transitions. [2024-06-14 15:36:25,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 245 transitions, 3719 flow [2024-06-14 15:36:25,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2024-06-14 15:36:25,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37282229965156793 [2024-06-14 15:36:25,386 INFO L175 Difference]: Start difference. First operand has 197 places, 233 transitions, 3199 flow. Second operand 7 states and 107 transitions. [2024-06-14 15:36:25,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 245 transitions, 3719 flow [2024-06-14 15:36:25,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 245 transitions, 3636 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:36:25,648 INFO L231 Difference]: Finished difference. Result has 196 places, 233 transitions, 3202 flow [2024-06-14 15:36:25,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3116, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3202, PETRI_PLACES=196, PETRI_TRANSITIONS=233} [2024-06-14 15:36:25,649 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-14 15:36:25,649 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 233 transitions, 3202 flow [2024-06-14 15:36:25,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:25,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:25,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:25,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:36:25,649 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:36:25,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:25,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1872414210, now seen corresponding path program 3 times [2024-06-14 15:36:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:25,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465368861] [2024-06-14 15:36:25,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:25,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:38,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:38,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465368861] [2024-06-14 15:36:38,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465368861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:38,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:38,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341678481] [2024-06-14 15:36:38,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:38,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:38,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:38,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:38,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:38,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:36:38,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 233 transitions, 3202 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:38,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:38,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:36:38,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:40,787 INFO L124 PetriNetUnfolderBase]: 3466/5405 cut-off events. [2024-06-14 15:36:40,787 INFO L125 PetriNetUnfolderBase]: For 254370/254378 co-relation queries the response was YES. [2024-06-14 15:36:40,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37910 conditions, 5405 events. 3466/5405 cut-off events. For 254370/254378 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 30522 event pairs, 866 based on Foata normal form. 10/5412 useless extension candidates. Maximal degree in co-relation 37820. Up to 5329 conditions per place. [2024-06-14 15:36:40,830 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 223 selfloop transitions, 30 changer transitions 0/256 dead transitions. [2024-06-14 15:36:40,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 256 transitions, 3776 flow [2024-06-14 15:36:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:36:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:36:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-14 15:36:40,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-14 15:36:40,833 INFO L175 Difference]: Start difference. First operand has 196 places, 233 transitions, 3202 flow. Second operand 9 states and 135 transitions. [2024-06-14 15:36:40,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 256 transitions, 3776 flow [2024-06-14 15:36:41,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 256 transitions, 3646 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-14 15:36:41,081 INFO L231 Difference]: Finished difference. Result has 199 places, 233 transitions, 3138 flow [2024-06-14 15:36:41,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3072, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3138, PETRI_PLACES=199, PETRI_TRANSITIONS=233} [2024-06-14 15:36:41,082 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-14 15:36:41,082 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 233 transitions, 3138 flow [2024-06-14 15:36:41,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:41,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:41,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:41,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:36:41,082 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:36:41,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2049481374, now seen corresponding path program 1 times [2024-06-14 15:36:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:41,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040020911] [2024-06-14 15:36:41,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:51,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:51,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040020911] [2024-06-14 15:36:51,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040020911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:51,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:51,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:51,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491235918] [2024-06-14 15:36:51,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:51,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:51,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:51,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:51,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:36:51,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 233 transitions, 3138 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:51,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:51,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:36:51,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:53,232 INFO L124 PetriNetUnfolderBase]: 3340/5289 cut-off events. [2024-06-14 15:36:53,233 INFO L125 PetriNetUnfolderBase]: For 265268/265269 co-relation queries the response was YES. [2024-06-14 15:36:53,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37448 conditions, 5289 events. 3340/5289 cut-off events. For 265268/265269 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30535 event pairs, 866 based on Foata normal form. 3/5287 useless extension candidates. Maximal degree in co-relation 37357. Up to 5131 conditions per place. [2024-06-14 15:36:53,280 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 229 selfloop transitions, 14 changer transitions 0/253 dead transitions. [2024-06-14 15:36:53,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 253 transitions, 3724 flow [2024-06-14 15:36:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:53,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-14 15:36:53,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-14 15:36:53,281 INFO L175 Difference]: Start difference. First operand has 199 places, 233 transitions, 3138 flow. Second operand 7 states and 113 transitions. [2024-06-14 15:36:53,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 253 transitions, 3724 flow [2024-06-14 15:36:53,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 253 transitions, 3619 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:36:53,618 INFO L231 Difference]: Finished difference. Result has 197 places, 236 transitions, 3123 flow [2024-06-14 15:36:53,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3033, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3123, PETRI_PLACES=197, PETRI_TRANSITIONS=236} [2024-06-14 15:36:53,619 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-14 15:36:53,619 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 236 transitions, 3123 flow [2024-06-14 15:36:53,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:53,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:53,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:53,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:36:53,620 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:36:53,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash -468645074, now seen corresponding path program 2 times [2024-06-14 15:36:53,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:53,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71081032] [2024-06-14 15:36:53,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:53,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:03,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:03,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71081032] [2024-06-14 15:37:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71081032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762430019] [2024-06-14 15:37:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:03,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:03,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:37:03,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 236 transitions, 3123 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:03,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:03,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:37:03,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:05,675 INFO L124 PetriNetUnfolderBase]: 3349/5301 cut-off events. [2024-06-14 15:37:05,676 INFO L125 PetriNetUnfolderBase]: For 273322/273323 co-relation queries the response was YES. [2024-06-14 15:37:05,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37851 conditions, 5301 events. 3349/5301 cut-off events. For 273322/273323 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30573 event pairs, 854 based on Foata normal form. 4/5299 useless extension candidates. Maximal degree in co-relation 37760. Up to 5098 conditions per place. [2024-06-14 15:37:05,726 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 222 selfloop transitions, 28 changer transitions 0/260 dead transitions. [2024-06-14 15:37:05,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 260 transitions, 3873 flow [2024-06-14 15:37:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:37:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:37:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-14 15:37:05,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-14 15:37:05,727 INFO L175 Difference]: Start difference. First operand has 197 places, 236 transitions, 3123 flow. Second operand 7 states and 118 transitions. [2024-06-14 15:37:05,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 260 transitions, 3873 flow [2024-06-14 15:37:06,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 260 transitions, 3807 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-14 15:37:06,018 INFO L231 Difference]: Finished difference. Result has 199 places, 242 transitions, 3237 flow [2024-06-14 15:37:06,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3057, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3237, PETRI_PLACES=199, PETRI_TRANSITIONS=242} [2024-06-14 15:37:06,018 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-14 15:37:06,018 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 242 transitions, 3237 flow [2024-06-14 15:37:06,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:06,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:06,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:37:06,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:37:06,019 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:37:06,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1525222854, now seen corresponding path program 3 times [2024-06-14 15:37:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191058330] [2024-06-14 15:37:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:16,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:16,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191058330] [2024-06-14 15:37:16,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191058330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:16,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:16,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:16,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631874774] [2024-06-14 15:37:16,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:16,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:16,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:16,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:16,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:16,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:37:16,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 242 transitions, 3237 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:16,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:16,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:37:16,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:18,562 INFO L124 PetriNetUnfolderBase]: 3332/5280 cut-off events. [2024-06-14 15:37:18,562 INFO L125 PetriNetUnfolderBase]: For 281521/281523 co-relation queries the response was YES. [2024-06-14 15:37:18,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37974 conditions, 5280 events. 3332/5280 cut-off events. For 281521/281523 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 30498 event pairs, 854 based on Foata normal form. 3/5278 useless extension candidates. Maximal degree in co-relation 37882. Up to 5123 conditions per place. [2024-06-14 15:37:18,607 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 229 selfloop transitions, 16 changer transitions 0/255 dead transitions. [2024-06-14 15:37:18,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 255 transitions, 3761 flow [2024-06-14 15:37:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:37:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:37:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-14 15:37:18,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-14 15:37:18,609 INFO L175 Difference]: Start difference. First operand has 199 places, 242 transitions, 3237 flow. Second operand 7 states and 109 transitions. [2024-06-14 15:37:18,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 255 transitions, 3761 flow [2024-06-14 15:37:18,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 255 transitions, 3655 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-06-14 15:37:18,902 INFO L231 Difference]: Finished difference. Result has 203 places, 242 transitions, 3169 flow [2024-06-14 15:37:18,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3131, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3169, PETRI_PLACES=203, PETRI_TRANSITIONS=242} [2024-06-14 15:37:18,903 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places. [2024-06-14 15:37:18,903 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 242 transitions, 3169 flow [2024-06-14 15:37:18,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:18,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:18,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:37:18,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:37:18,904 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:37:18,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1871983620, now seen corresponding path program 1 times [2024-06-14 15:37:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174811074] [2024-06-14 15:37:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:31,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:31,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174811074] [2024-06-14 15:37:31,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174811074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:31,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:31,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:31,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291645513] [2024-06-14 15:37:31,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:31,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:31,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:31,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:31,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:32,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:37:32,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 242 transitions, 3169 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:32,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:32,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:37:32,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:33,915 INFO L124 PetriNetUnfolderBase]: 3482/5432 cut-off events. [2024-06-14 15:37:33,915 INFO L125 PetriNetUnfolderBase]: For 285842/285842 co-relation queries the response was YES. [2024-06-14 15:37:33,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38815 conditions, 5432 events. 3482/5432 cut-off events. For 285842/285842 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 30600 event pairs, 894 based on Foata normal form. 2/5431 useless extension candidates. Maximal degree in co-relation 38721. Up to 5394 conditions per place. [2024-06-14 15:37:33,964 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 240 selfloop transitions, 13 changer transitions 0/256 dead transitions. [2024-06-14 15:37:33,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 256 transitions, 3741 flow [2024-06-14 15:37:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:37:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:37:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-14 15:37:33,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519163763066202 [2024-06-14 15:37:33,966 INFO L175 Difference]: Start difference. First operand has 203 places, 242 transitions, 3169 flow. Second operand 7 states and 101 transitions. [2024-06-14 15:37:33,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 256 transitions, 3741 flow [2024-06-14 15:37:34,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 256 transitions, 3692 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:37:34,315 INFO L231 Difference]: Finished difference. Result has 204 places, 244 transitions, 3189 flow [2024-06-14 15:37:34,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3120, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3189, PETRI_PLACES=204, PETRI_TRANSITIONS=244} [2024-06-14 15:37:34,316 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places. [2024-06-14 15:37:34,316 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 244 transitions, 3189 flow [2024-06-14 15:37:34,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:34,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:34,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:37:34,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:37:34,316 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:37:34,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:34,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1197138808, now seen corresponding path program 1 times [2024-06-14 15:37:34,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:34,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502690422] [2024-06-14 15:37:34,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:34,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:44,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502690422] [2024-06-14 15:37:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502690422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:44,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523197084] [2024-06-14 15:37:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:44,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:44,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:44,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:37:44,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 244 transitions, 3189 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:44,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:44,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:37:44,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:46,651 INFO L124 PetriNetUnfolderBase]: 3523/5501 cut-off events. [2024-06-14 15:37:46,651 INFO L125 PetriNetUnfolderBase]: For 308637/308643 co-relation queries the response was YES. [2024-06-14 15:37:46,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39568 conditions, 5501 events. 3523/5501 cut-off events. For 308637/308643 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 31102 event pairs, 706 based on Foata normal form. 18/5516 useless extension candidates. Maximal degree in co-relation 39473. Up to 5163 conditions per place. [2024-06-14 15:37:46,705 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 244 selfloop transitions, 36 changer transitions 0/283 dead transitions. [2024-06-14 15:37:46,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 283 transitions, 3925 flow [2024-06-14 15:37:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:37:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:37:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-14 15:37:46,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 15:37:46,708 INFO L175 Difference]: Start difference. First operand has 204 places, 244 transitions, 3189 flow. Second operand 9 states and 144 transitions. [2024-06-14 15:37:46,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 283 transitions, 3925 flow [2024-06-14 15:37:47,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 283 transitions, 3872 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 15:37:47,025 INFO L231 Difference]: Finished difference. Result has 209 places, 248 transitions, 3296 flow [2024-06-14 15:37:47,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3136, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3296, PETRI_PLACES=209, PETRI_TRANSITIONS=248} [2024-06-14 15:37:47,025 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places. [2024-06-14 15:37:47,025 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 248 transitions, 3296 flow [2024-06-14 15:37:47,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:47,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:47,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:37:47,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:37:47,026 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:37:47,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:47,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1255346578, now seen corresponding path program 2 times [2024-06-14 15:37:47,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:47,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237227444] [2024-06-14 15:37:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:57,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237227444] [2024-06-14 15:37:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237227444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:57,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:57,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:37:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526178532] [2024-06-14 15:37:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:57,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:37:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:37:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:37:57,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:37:57,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 248 transitions, 3296 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:57,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:57,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:37:57,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:59,951 INFO L124 PetriNetUnfolderBase]: 3564/5570 cut-off events. [2024-06-14 15:37:59,951 INFO L125 PetriNetUnfolderBase]: For 321835/321843 co-relation queries the response was YES. [2024-06-14 15:37:59,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40523 conditions, 5570 events. 3564/5570 cut-off events. For 321835/321843 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 31769 event pairs, 852 based on Foata normal form. 20/5587 useless extension candidates. Maximal degree in co-relation 40426. Up to 5292 conditions per place. [2024-06-14 15:38:00,008 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 251 selfloop transitions, 40 changer transitions 0/294 dead transitions. [2024-06-14 15:38:00,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 294 transitions, 4076 flow [2024-06-14 15:38:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-06-14 15:38:00,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951219512195122 [2024-06-14 15:38:00,011 INFO L175 Difference]: Start difference. First operand has 209 places, 248 transitions, 3296 flow. Second operand 10 states and 162 transitions. [2024-06-14 15:38:00,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 294 transitions, 4076 flow [2024-06-14 15:38:00,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 294 transitions, 3957 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-14 15:38:00,452 INFO L231 Difference]: Finished difference. Result has 215 places, 251 transitions, 3344 flow [2024-06-14 15:38:00,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3177, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3344, PETRI_PLACES=215, PETRI_TRANSITIONS=251} [2024-06-14 15:38:00,453 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2024-06-14 15:38:00,453 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 251 transitions, 3344 flow [2024-06-14 15:38:00,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:00,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:00,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:00,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:38:00,454 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:38:00,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1255231258, now seen corresponding path program 3 times [2024-06-14 15:38:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365297627] [2024-06-14 15:38:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365297627] [2024-06-14 15:38:10,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365297627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:10,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:10,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:38:10,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069610278] [2024-06-14 15:38:10,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:10,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:38:10,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:10,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:38:10,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:38:10,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:38:10,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 251 transitions, 3344 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:10,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:10,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:38:10,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:13,039 INFO L124 PetriNetUnfolderBase]: 3605/5643 cut-off events. [2024-06-14 15:38:13,039 INFO L125 PetriNetUnfolderBase]: For 339341/339347 co-relation queries the response was YES. [2024-06-14 15:38:13,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41045 conditions, 5643 events. 3605/5643 cut-off events. For 339341/339347 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32409 event pairs, 840 based on Foata normal form. 18/5658 useless extension candidates. Maximal degree in co-relation 40945. Up to 5148 conditions per place. [2024-06-14 15:38:13,101 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 232 selfloop transitions, 57 changer transitions 0/292 dead transitions. [2024-06-14 15:38:13,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 292 transitions, 4135 flow [2024-06-14 15:38:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:38:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:38:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-14 15:38:13,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-14 15:38:13,104 INFO L175 Difference]: Start difference. First operand has 215 places, 251 transitions, 3344 flow. Second operand 9 states and 148 transitions. [2024-06-14 15:38:13,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 292 transitions, 4135 flow [2024-06-14 15:38:13,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 292 transitions, 4023 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-14 15:38:13,601 INFO L231 Difference]: Finished difference. Result has 219 places, 257 transitions, 3481 flow [2024-06-14 15:38:13,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3232, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3481, PETRI_PLACES=219, PETRI_TRANSITIONS=257} [2024-06-14 15:38:13,602 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 177 predicate places. [2024-06-14 15:38:13,602 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 257 transitions, 3481 flow [2024-06-14 15:38:13,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:13,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:13,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:13,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:38:13,602 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:38:13,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash -316782640, now seen corresponding path program 1 times [2024-06-14 15:38:13,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:13,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108795720] [2024-06-14 15:38:13,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:28,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:28,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108795720] [2024-06-14 15:38:28,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108795720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:28,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:28,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:28,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303032674] [2024-06-14 15:38:28,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:28,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:28,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:28,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:28,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:38:28,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 257 transitions, 3481 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:28,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:28,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:38:28,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:30,466 INFO L124 PetriNetUnfolderBase]: 3625/5669 cut-off events. [2024-06-14 15:38:30,466 INFO L125 PetriNetUnfolderBase]: For 342858/342866 co-relation queries the response was YES. [2024-06-14 15:38:30,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41567 conditions, 5669 events. 3625/5669 cut-off events. For 342858/342866 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32468 event pairs, 886 based on Foata normal form. 12/5678 useless extension candidates. Maximal degree in co-relation 41465. Up to 5421 conditions per place. [2024-06-14 15:38:30,517 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 234 selfloop transitions, 57 changer transitions 0/294 dead transitions. [2024-06-14 15:38:30,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 294 transitions, 4349 flow [2024-06-14 15:38:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:38:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:38:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-14 15:38:30,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-14 15:38:30,520 INFO L175 Difference]: Start difference. First operand has 219 places, 257 transitions, 3481 flow. Second operand 8 states and 137 transitions. [2024-06-14 15:38:30,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 294 transitions, 4349 flow [2024-06-14 15:38:30,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 294 transitions, 4156 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-14 15:38:30,967 INFO L231 Difference]: Finished difference. Result has 221 places, 263 transitions, 3502 flow [2024-06-14 15:38:30,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3288, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3502, PETRI_PLACES=221, PETRI_TRANSITIONS=263} [2024-06-14 15:38:30,968 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 179 predicate places. [2024-06-14 15:38:30,968 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 263 transitions, 3502 flow [2024-06-14 15:38:30,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:30,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:30,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:30,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:38:30,969 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:38:30,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash -313238503, now seen corresponding path program 1 times [2024-06-14 15:38:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:30,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667104944] [2024-06-14 15:38:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:41,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:41,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667104944] [2024-06-14 15:38:41,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667104944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:41,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:41,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:38:41,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267699363] [2024-06-14 15:38:41,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:41,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:38:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:38:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:38:41,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:38:41,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 263 transitions, 3502 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:41,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:41,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:38:41,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:43,500 INFO L124 PetriNetUnfolderBase]: 3638/5687 cut-off events. [2024-06-14 15:38:43,501 INFO L125 PetriNetUnfolderBase]: For 348507/348515 co-relation queries the response was YES. [2024-06-14 15:38:43,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41815 conditions, 5687 events. 3638/5687 cut-off events. For 348507/348515 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32647 event pairs, 891 based on Foata normal form. 9/5693 useless extension candidates. Maximal degree in co-relation 41713. Up to 5614 conditions per place. [2024-06-14 15:38:43,564 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 261 selfloop transitions, 26 changer transitions 0/290 dead transitions. [2024-06-14 15:38:43,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 290 transitions, 4336 flow [2024-06-14 15:38:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:38:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:38:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-14 15:38:43,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-14 15:38:43,567 INFO L175 Difference]: Start difference. First operand has 221 places, 263 transitions, 3502 flow. Second operand 7 states and 113 transitions. [2024-06-14 15:38:43,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 290 transitions, 4336 flow [2024-06-14 15:38:44,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 290 transitions, 4247 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-14 15:38:44,084 INFO L231 Difference]: Finished difference. Result has 224 places, 269 transitions, 3565 flow [2024-06-14 15:38:44,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3413, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3565, PETRI_PLACES=224, PETRI_TRANSITIONS=269} [2024-06-14 15:38:44,085 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 182 predicate places. [2024-06-14 15:38:44,085 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 269 transitions, 3565 flow [2024-06-14 15:38:44,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:44,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:44,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:44,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:38:44,085 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:38:44,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:44,086 INFO L85 PathProgramCache]: Analyzing trace with hash 920866563, now seen corresponding path program 2 times [2024-06-14 15:38:44,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:44,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414638653] [2024-06-14 15:38:44,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:44,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:53,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:53,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414638653] [2024-06-14 15:38:53,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414638653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:53,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:53,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:38:53,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69669769] [2024-06-14 15:38:53,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:53,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:38:53,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:38:53,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:38:53,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:38:53,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 269 transitions, 3565 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:53,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:53,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:38:53,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:55,781 INFO L124 PetriNetUnfolderBase]: 3648/5701 cut-off events. [2024-06-14 15:38:55,781 INFO L125 PetriNetUnfolderBase]: For 359770/359778 co-relation queries the response was YES. [2024-06-14 15:38:55,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42224 conditions, 5701 events. 3648/5701 cut-off events. For 359770/359778 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32645 event pairs, 885 based on Foata normal form. 9/5707 useless extension candidates. Maximal degree in co-relation 42120. Up to 5636 conditions per place. [2024-06-14 15:38:55,832 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 263 selfloop transitions, 28 changer transitions 0/294 dead transitions. [2024-06-14 15:38:55,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 294 transitions, 4282 flow [2024-06-14 15:38:55,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:38:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:38:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-14 15:38:55,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 15:38:55,833 INFO L175 Difference]: Start difference. First operand has 224 places, 269 transitions, 3565 flow. Second operand 7 states and 112 transitions. [2024-06-14 15:38:55,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 294 transitions, 4282 flow [2024-06-14 15:38:56,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 294 transitions, 4192 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-14 15:38:56,267 INFO L231 Difference]: Finished difference. Result has 229 places, 276 transitions, 3644 flow [2024-06-14 15:38:56,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3491, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3644, PETRI_PLACES=229, PETRI_TRANSITIONS=276} [2024-06-14 15:38:56,268 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places. [2024-06-14 15:38:56,268 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 276 transitions, 3644 flow [2024-06-14 15:38:56,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:56,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:56,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:56,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:38:56,268 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:38:56,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2067384496, now seen corresponding path program 4 times [2024-06-14 15:38:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057173943] [2024-06-14 15:38:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:05,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:05,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057173943] [2024-06-14 15:39:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057173943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:05,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:05,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:39:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105191699] [2024-06-14 15:39:05,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:05,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:39:05,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:05,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:39:05,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:39:06,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:39:06,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 276 transitions, 3644 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:06,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:06,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:39:06,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:08,233 INFO L124 PetriNetUnfolderBase]: 3608/5639 cut-off events. [2024-06-14 15:39:08,233 INFO L125 PetriNetUnfolderBase]: For 369749/369755 co-relation queries the response was YES. [2024-06-14 15:39:08,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41114 conditions, 5639 events. 3608/5639 cut-off events. For 369749/369755 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 32251 event pairs, 808 based on Foata normal form. 30/5666 useless extension candidates. Maximal degree in co-relation 41007. Up to 5103 conditions per place. [2024-06-14 15:39:08,292 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 253 selfloop transitions, 55 changer transitions 0/311 dead transitions. [2024-06-14 15:39:08,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 311 transitions, 4368 flow [2024-06-14 15:39:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:39:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:39:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-06-14 15:39:08,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010840108401084 [2024-06-14 15:39:08,295 INFO L175 Difference]: Start difference. First operand has 229 places, 276 transitions, 3644 flow. Second operand 9 states and 148 transitions. [2024-06-14 15:39:08,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 311 transitions, 4368 flow [2024-06-14 15:39:08,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 311 transitions, 4266 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-14 15:39:08,876 INFO L231 Difference]: Finished difference. Result has 234 places, 276 transitions, 3661 flow [2024-06-14 15:39:08,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3542, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3661, PETRI_PLACES=234, PETRI_TRANSITIONS=276} [2024-06-14 15:39:08,877 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2024-06-14 15:39:08,877 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 276 transitions, 3661 flow [2024-06-14 15:39:08,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:08,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:08,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:08,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:39:08,877 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:39:08,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1818026124, now seen corresponding path program 2 times [2024-06-14 15:39:08,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:08,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112218020] [2024-06-14 15:39:08,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:08,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:23,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:23,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112218020] [2024-06-14 15:39:23,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112218020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:23,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:23,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205595626] [2024-06-14 15:39:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:23,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:23,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:23,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:23,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:23,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:39:23,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 276 transitions, 3661 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:23,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:23,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:39:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:25,635 INFO L124 PetriNetUnfolderBase]: 3660/5711 cut-off events. [2024-06-14 15:39:25,636 INFO L125 PetriNetUnfolderBase]: For 365478/365484 co-relation queries the response was YES. [2024-06-14 15:39:25,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41949 conditions, 5711 events. 3660/5711 cut-off events. For 365478/365484 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32622 event pairs, 867 based on Foata normal form. 10/5718 useless extension candidates. Maximal degree in co-relation 41841. Up to 5426 conditions per place. [2024-06-14 15:39:25,690 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 242 selfloop transitions, 63 changer transitions 0/308 dead transitions. [2024-06-14 15:39:25,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 308 transitions, 4653 flow [2024-06-14 15:39:25,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-14 15:39:25,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-14 15:39:25,693 INFO L175 Difference]: Start difference. First operand has 234 places, 276 transitions, 3661 flow. Second operand 8 states and 134 transitions. [2024-06-14 15:39:25,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 308 transitions, 4653 flow [2024-06-14 15:39:26,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 308 transitions, 4521 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 15:39:26,113 INFO L231 Difference]: Finished difference. Result has 236 places, 282 transitions, 3745 flow [2024-06-14 15:39:26,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3533, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3745, PETRI_PLACES=236, PETRI_TRANSITIONS=282} [2024-06-14 15:39:26,113 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 194 predicate places. [2024-06-14 15:39:26,113 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 282 transitions, 3745 flow [2024-06-14 15:39:26,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:26,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:26,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:26,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:39:26,114 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-14 15:39:26,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:26,114 INFO L85 PathProgramCache]: Analyzing trace with hash -307528210, now seen corresponding path program 3 times [2024-06-14 15:39:26,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:26,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639267288] [2024-06-14 15:39:26,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:26,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:40,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:40,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639267288] [2024-06-14 15:39:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639267288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:40,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:40,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:40,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647909385] [2024-06-14 15:39:40,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:40,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:40,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:40,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:39:40,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 282 transitions, 3745 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:40,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:40,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:39:40,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:42,994 INFO L124 PetriNetUnfolderBase]: 3648/5695 cut-off events. [2024-06-14 15:39:42,994 INFO L125 PetriNetUnfolderBase]: For 357286/357292 co-relation queries the response was YES. [2024-06-14 15:39:43,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41473 conditions, 5695 events. 3648/5695 cut-off events. For 357286/357292 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32555 event pairs, 865 based on Foata normal form. 10/5702 useless extension candidates. Maximal degree in co-relation 41364. Up to 5418 conditions per place. [2024-06-14 15:39:43,056 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 243 selfloop transitions, 62 changer transitions 0/308 dead transitions. [2024-06-14 15:39:43,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 308 transitions, 4549 flow [2024-06-14 15:39:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-14 15:39:43,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-14 15:39:43,059 INFO L175 Difference]: Start difference. First operand has 236 places, 282 transitions, 3745 flow. Second operand 8 states and 135 transitions. [2024-06-14 15:39:43,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 308 transitions, 4549 flow [2024-06-14 15:39:43,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 308 transitions, 4420 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-14 15:39:43,582 INFO L231 Difference]: Finished difference. Result has 240 places, 282 transitions, 3746 flow [2024-06-14 15:39:43,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3616, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3746, PETRI_PLACES=240, PETRI_TRANSITIONS=282} [2024-06-14 15:39:43,583 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2024-06-14 15:39:43,583 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 282 transitions, 3746 flow [2024-06-14 15:39:43,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:43,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:43,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:43,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:39:43,584 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-14 15:39:43,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1796546653, now seen corresponding path program 3 times [2024-06-14 15:39:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:43,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263655961] [2024-06-14 15:39:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:43,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263655961] [2024-06-14 15:39:54,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263655961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:54,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:54,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54072490] [2024-06-14 15:39:54,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:54,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:54,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:54,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:39:54,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 282 transitions, 3746 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:54,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:54,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:39:54,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:56,453 INFO L124 PetriNetUnfolderBase]: 3653/5702 cut-off events. [2024-06-14 15:39:56,453 INFO L125 PetriNetUnfolderBase]: For 363893/363917 co-relation queries the response was YES. [2024-06-14 15:39:56,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41597 conditions, 5702 events. 3653/5702 cut-off events. For 363893/363917 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32623 event pairs, 872 based on Foata normal form. 17/5712 useless extension candidates. Maximal degree in co-relation 41487. Up to 5593 conditions per place. [2024-06-14 15:39:56,511 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 268 selfloop transitions, 42 changer transitions 0/313 dead transitions. [2024-06-14 15:39:56,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 313 transitions, 4790 flow [2024-06-14 15:39:56,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:39:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:39:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-14 15:39:56,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-14 15:39:56,513 INFO L175 Difference]: Start difference. First operand has 240 places, 282 transitions, 3746 flow. Second operand 7 states and 113 transitions. [2024-06-14 15:39:56,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 313 transitions, 4790 flow [2024-06-14 15:39:57,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 313 transitions, 4658 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:57,067 INFO L231 Difference]: Finished difference. Result has 241 places, 293 transitions, 3878 flow [2024-06-14 15:39:57,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3614, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3878, PETRI_PLACES=241, PETRI_TRANSITIONS=293} [2024-06-14 15:39:57,068 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places. [2024-06-14 15:39:57,068 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 293 transitions, 3878 flow [2024-06-14 15:39:57,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:57,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:57,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:57,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:39:57,069 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:39:57,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash 894299161, now seen corresponding path program 4 times [2024-06-14 15:39:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:57,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639225373] [2024-06-14 15:39:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:57,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:08,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:08,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639225373] [2024-06-14 15:40:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639225373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:08,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116403477] [2024-06-14 15:40:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:08,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:08,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:08,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:08,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:40:08,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 293 transitions, 3878 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:08,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:08,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:40:08,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:10,052 INFO L124 PetriNetUnfolderBase]: 3684/5743 cut-off events. [2024-06-14 15:40:10,052 INFO L125 PetriNetUnfolderBase]: For 379001/379009 co-relation queries the response was YES. [2024-06-14 15:40:10,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42426 conditions, 5743 events. 3684/5743 cut-off events. For 379001/379009 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 32833 event pairs, 859 based on Foata normal form. 9/5749 useless extension candidates. Maximal degree in co-relation 42314. Up to 5600 conditions per place. [2024-06-14 15:40:10,117 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 265 selfloop transitions, 59 changer transitions 0/327 dead transitions. [2024-06-14 15:40:10,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 327 transitions, 4872 flow [2024-06-14 15:40:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:40:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:40:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-14 15:40:10,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-14 15:40:10,120 INFO L175 Difference]: Start difference. First operand has 241 places, 293 transitions, 3878 flow. Second operand 8 states and 132 transitions. [2024-06-14 15:40:10,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 327 transitions, 4872 flow [2024-06-14 15:40:10,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 327 transitions, 4746 flow, removed 55 selfloop flow, removed 2 redundant places. [2024-06-14 15:40:10,664 INFO L231 Difference]: Finished difference. Result has 248 places, 302 transitions, 4064 flow [2024-06-14 15:40:10,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3784, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4064, PETRI_PLACES=248, PETRI_TRANSITIONS=302} [2024-06-14 15:40:10,664 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 206 predicate places. [2024-06-14 15:40:10,665 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 302 transitions, 4064 flow [2024-06-14 15:40:10,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:10,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:10,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:10,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:40:10,665 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:40:10,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash 827466643, now seen corresponding path program 5 times [2024-06-14 15:40:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270040553] [2024-06-14 15:40:10,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:20,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:20,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270040553] [2024-06-14 15:40:20,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270040553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:20,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:20,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:20,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970668993] [2024-06-14 15:40:20,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:20,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:20,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:20,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:20,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:40:20,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 302 transitions, 4064 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:20,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:20,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:40:20,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:22,552 INFO L124 PetriNetUnfolderBase]: 3681/5741 cut-off events. [2024-06-14 15:40:22,552 INFO L125 PetriNetUnfolderBase]: For 388973/388997 co-relation queries the response was YES. [2024-06-14 15:40:22,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42685 conditions, 5741 events. 3681/5741 cut-off events. For 388973/388997 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32816 event pairs, 870 based on Foata normal form. 17/5751 useless extension candidates. Maximal degree in co-relation 42570. Up to 5676 conditions per place. [2024-06-14 15:40:22,620 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 282 selfloop transitions, 30 changer transitions 0/315 dead transitions. [2024-06-14 15:40:22,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 315 transitions, 4846 flow [2024-06-14 15:40:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:40:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:40:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-14 15:40:22,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3623693379790941 [2024-06-14 15:40:22,624 INFO L175 Difference]: Start difference. First operand has 248 places, 302 transitions, 4064 flow. Second operand 7 states and 104 transitions. [2024-06-14 15:40:22,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 315 transitions, 4846 flow [2024-06-14 15:40:23,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 315 transitions, 4722 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-14 15:40:23,247 INFO L231 Difference]: Finished difference. Result has 251 places, 302 transitions, 4006 flow [2024-06-14 15:40:23,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3940, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4006, PETRI_PLACES=251, PETRI_TRANSITIONS=302} [2024-06-14 15:40:23,248 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 209 predicate places. [2024-06-14 15:40:23,248 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 302 transitions, 4006 flow [2024-06-14 15:40:23,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:23,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:23,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:23,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:40:23,249 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:40:23,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:23,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2084695065, now seen corresponding path program 6 times [2024-06-14 15:40:23,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:23,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727670921] [2024-06-14 15:40:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:23,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:33,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727670921] [2024-06-14 15:40:33,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727670921] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:33,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:33,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689072758] [2024-06-14 15:40:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:33,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:33,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:33,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:33,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:33,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:40:33,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 302 transitions, 4006 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:33,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:33,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:40:33,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:35,409 INFO L124 PetriNetUnfolderBase]: 3678/5737 cut-off events. [2024-06-14 15:40:35,410 INFO L125 PetriNetUnfolderBase]: For 398437/398461 co-relation queries the response was YES. [2024-06-14 15:40:35,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42656 conditions, 5737 events. 3678/5737 cut-off events. For 398437/398461 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32782 event pairs, 872 based on Foata normal form. 17/5747 useless extension candidates. Maximal degree in co-relation 42540. Up to 5682 conditions per place. [2024-06-14 15:40:35,470 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 289 selfloop transitions, 22 changer transitions 0/314 dead transitions. [2024-06-14 15:40:35,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 314 transitions, 4668 flow [2024-06-14 15:40:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:40:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:40:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-14 15:40:35,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3554006968641115 [2024-06-14 15:40:35,473 INFO L175 Difference]: Start difference. First operand has 251 places, 302 transitions, 4006 flow. Second operand 7 states and 102 transitions. [2024-06-14 15:40:35,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 314 transitions, 4668 flow [2024-06-14 15:40:36,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 314 transitions, 4592 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-14 15:40:36,032 INFO L231 Difference]: Finished difference. Result has 254 places, 302 transitions, 3980 flow [2024-06-14 15:40:36,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3930, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3980, PETRI_PLACES=254, PETRI_TRANSITIONS=302} [2024-06-14 15:40:36,032 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places. [2024-06-14 15:40:36,032 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 302 transitions, 3980 flow [2024-06-14 15:40:36,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:36,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:36,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:36,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:40:36,033 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:40:36,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash 20992242, now seen corresponding path program 5 times [2024-06-14 15:40:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929400455] [2024-06-14 15:40:36,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:45,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-14 15:40:45,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929400455] [2024-06-14 15:40:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929400455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:45,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:45,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:45,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016598151] [2024-06-14 15:40:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:45,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:45,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:46,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:40:46,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 302 transitions, 3980 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:46,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:46,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:40:46,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:48,286 INFO L124 PetriNetUnfolderBase]: 3638/5676 cut-off events. [2024-06-14 15:40:48,287 INFO L125 PetriNetUnfolderBase]: For 408767/408788 co-relation queries the response was YES. [2024-06-14 15:40:48,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41235 conditions, 5676 events. 3638/5676 cut-off events. For 408767/408788 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 32378 event pairs, 765 based on Foata normal form. 35/5697 useless extension candidates. Maximal degree in co-relation 41118. Up to 5107 conditions per place. [2024-06-14 15:40:48,357 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 264 selfloop transitions, 71 changer transitions 0/338 dead transitions. [2024-06-14 15:40:48,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 338 transitions, 4779 flow [2024-06-14 15:40:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:40:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:40:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-14 15:40:48,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-14 15:40:48,359 INFO L175 Difference]: Start difference. First operand has 254 places, 302 transitions, 3980 flow. Second operand 9 states and 151 transitions. [2024-06-14 15:40:48,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 338 transitions, 4779 flow [2024-06-14 15:40:49,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 338 transitions, 4668 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-14 15:40:49,102 INFO L231 Difference]: Finished difference. Result has 258 places, 304 transitions, 4050 flow [2024-06-14 15:40:49,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3869, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4050, PETRI_PLACES=258, PETRI_TRANSITIONS=304} [2024-06-14 15:40:49,102 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 216 predicate places. [2024-06-14 15:40:49,103 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 304 transitions, 4050 flow [2024-06-14 15:40:49,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:49,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:49,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:49,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:40:49,103 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:40:49,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash 20876922, now seen corresponding path program 6 times [2024-06-14 15:40:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872993620] [2024-06-14 15:40:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:58,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:58,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872993620] [2024-06-14 15:40:58,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872993620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:58,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:58,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149645582] [2024-06-14 15:40:58,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:58,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:58,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:58,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:59,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:40:59,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 304 transitions, 4050 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:59,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:59,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:40:59,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:01,619 INFO L124 PetriNetUnfolderBase]: 3618/5644 cut-off events. [2024-06-14 15:41:01,619 INFO L125 PetriNetUnfolderBase]: For 388359/388380 co-relation queries the response was YES. [2024-06-14 15:41:01,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40671 conditions, 5644 events. 3618/5644 cut-off events. For 388359/388380 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 32196 event pairs, 751 based on Foata normal form. 23/5653 useless extension candidates. Maximal degree in co-relation 40552. Up to 5085 conditions per place. [2024-06-14 15:41:01,678 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 265 selfloop transitions, 74 changer transitions 0/342 dead transitions. [2024-06-14 15:41:01,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 342 transitions, 4891 flow [2024-06-14 15:41:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:41:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:41:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-14 15:41:01,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-14 15:41:01,681 INFO L175 Difference]: Start difference. First operand has 258 places, 304 transitions, 4050 flow. Second operand 9 states and 150 transitions. [2024-06-14 15:41:01,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 342 transitions, 4891 flow [2024-06-14 15:41:02,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 342 transitions, 4715 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-14 15:41:02,343 INFO L231 Difference]: Finished difference. Result has 262 places, 308 transitions, 4102 flow [2024-06-14 15:41:02,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3874, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4102, PETRI_PLACES=262, PETRI_TRANSITIONS=308} [2024-06-14 15:41:02,344 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 220 predicate places. [2024-06-14 15:41:02,344 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 308 transitions, 4102 flow [2024-06-14 15:41:02,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:02,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:02,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:02,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:41:02,344 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:41:02,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 161367726, now seen corresponding path program 7 times [2024-06-14 15:41:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175093882] [2024-06-14 15:41:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:12,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:12,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175093882] [2024-06-14 15:41:12,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175093882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:12,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:12,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:41:12,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045821032] [2024-06-14 15:41:12,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:12,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:41:12,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:12,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:41:12,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:41:12,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:41:12,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 308 transitions, 4102 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:12,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:12,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:41:12,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:14,993 INFO L124 PetriNetUnfolderBase]: 3598/5609 cut-off events. [2024-06-14 15:41:14,994 INFO L125 PetriNetUnfolderBase]: For 382860/382864 co-relation queries the response was YES. [2024-06-14 15:41:15,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40050 conditions, 5609 events. 3598/5609 cut-off events. For 382860/382864 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 31991 event pairs, 727 based on Foata normal form. 16/5622 useless extension candidates. Maximal degree in co-relation 39929. Up to 5130 conditions per place. [2024-06-14 15:41:15,060 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 274 selfloop transitions, 74 changer transitions 0/351 dead transitions. [2024-06-14 15:41:15,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 351 transitions, 4856 flow [2024-06-14 15:41:15,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:41:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:41:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-06-14 15:41:15,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3946784922394678 [2024-06-14 15:41:15,063 INFO L175 Difference]: Start difference. First operand has 262 places, 308 transitions, 4102 flow. Second operand 11 states and 178 transitions. [2024-06-14 15:41:15,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 351 transitions, 4856 flow [2024-06-14 15:41:15,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 351 transitions, 4434 flow, removed 62 selfloop flow, removed 8 redundant places. [2024-06-14 15:41:15,840 INFO L231 Difference]: Finished difference. Result has 264 places, 307 transitions, 3754 flow [2024-06-14 15:41:15,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3602, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3754, PETRI_PLACES=264, PETRI_TRANSITIONS=307} [2024-06-14 15:41:15,840 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-14 15:41:15,840 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 307 transitions, 3754 flow [2024-06-14 15:41:15,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:15,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:15,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:15,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:41:15,841 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:41:15,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:15,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2084691438, now seen corresponding path program 4 times [2024-06-14 15:41:15,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:15,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617123966] [2024-06-14 15:41:15,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:15,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617123966] [2024-06-14 15:41:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617123966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:41:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737851486] [2024-06-14 15:41:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:30,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:41:30,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:41:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:41:30,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:41:30,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 307 transitions, 3754 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:30,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:30,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:41:30,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:32,515 INFO L124 PetriNetUnfolderBase]: 3618/5640 cut-off events. [2024-06-14 15:41:32,516 INFO L125 PetriNetUnfolderBase]: For 379458/379473 co-relation queries the response was YES. [2024-06-14 15:41:32,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38959 conditions, 5640 events. 3618/5640 cut-off events. For 379458/379473 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32073 event pairs, 815 based on Foata normal form. 11/5637 useless extension candidates. Maximal degree in co-relation 38840. Up to 5348 conditions per place. [2024-06-14 15:41:32,569 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 259 selfloop transitions, 67 changer transitions 0/329 dead transitions. [2024-06-14 15:41:32,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 329 transitions, 4635 flow [2024-06-14 15:41:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:41:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:41:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-14 15:41:32,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-14 15:41:32,571 INFO L175 Difference]: Start difference. First operand has 264 places, 307 transitions, 3754 flow. Second operand 8 states and 126 transitions. [2024-06-14 15:41:32,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 329 transitions, 4635 flow [2024-06-14 15:41:33,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 329 transitions, 4478 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:41:33,179 INFO L231 Difference]: Finished difference. Result has 264 places, 310 transitions, 3780 flow [2024-06-14 15:41:33,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3597, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3780, PETRI_PLACES=264, PETRI_TRANSITIONS=310} [2024-06-14 15:41:33,179 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-14 15:41:33,179 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 310 transitions, 3780 flow [2024-06-14 15:41:33,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:33,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:33,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:33,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:41:33,180 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:41:33,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2084702598, now seen corresponding path program 5 times [2024-06-14 15:41:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:33,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087615116] [2024-06-14 15:41:33,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15