./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.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_pso.opt_rmo.opt_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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_pso.opt_rmo.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_pso.opt_rmo.opt_tso.opt.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-bcb38a6-m [2024-06-03 22:02:43,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:02:43,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:02:43,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:02:43,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:02:43,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:02:43,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:02:43,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:02:43,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:02:43,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:02:43,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:02:43,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:02:43,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:02:43,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:02:43,831 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:02:43,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:02:43,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:02:43,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:02:43,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:02:43,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:02:43,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:02:43,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:02:43,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:02:43,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:02:43,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:02:43,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:02:43,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:02:43,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:02:43,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:02:43,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:02:43,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:02:43,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:02:43,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:02:43,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:02:43,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:02:43,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:02:43,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:02:43,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:02:43,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:02:43,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:02:43,837 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:02:43,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:02:43,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:02:43,838 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-03 22:02:44,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:02:44,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:02:44,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:02:44,055 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:02:44,056 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:02:44,057 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_pso.opt_rmo.opt_tso.opt.yml/witness.yml [2024-06-03 22:02:44,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:02:44,280 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:02:44,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2024-06-03 22:02:45,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:02:45,485 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:02:45,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2024-06-03 22:02:45,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901893850/0f6adfd40f884e5ba6695c39ce416e90/FLAG4b8db8986 [2024-06-03 22:02:45,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901893850/0f6adfd40f884e5ba6695c39ce416e90 [2024-06-03 22:02:45,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:02:45,521 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:02:45,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:02:45,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:02:45,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:02:45,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:02:44" (1/2) ... [2024-06-03 22:02:45,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463f8c56 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:02:45, skipping insertion in model container [2024-06-03 22:02:45,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:02:44" (1/2) ... [2024-06-03 22:02:45,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1afa8137 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:02:45, skipping insertion in model container [2024-06-03 22:02:45,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:02:45" (2/2) ... [2024-06-03 22:02:45,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463f8c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:45, skipping insertion in model container [2024-06-03 22:02:45,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:02:45" (2/2) ... [2024-06-03 22:02:45,529 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:02:45,641 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:02:45,642 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_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 || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$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 )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 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 )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (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 )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-03 22:02:45,643 INFO L97 edCorrectnessWitness]: Location invariant before [L828-L828] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_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 || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$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 )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 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 )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (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 )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-03 22:02:45,643 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_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 || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$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 )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 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 )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (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 )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-03 22:02:45,644 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:02:45,644 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-03 22:02:45,677 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:02:45,939 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:02:45,949 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:02:46,191 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:02:46,227 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:02:46,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46 WrapperNode [2024-06-03 22:02:46,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:02:46,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:02:46,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:02:46,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:02:46,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,425 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2024-06-03 22:02:46,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:02:46,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:02:46,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:02:46,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:02:46,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,515 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-03 22:02:46,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:02:46,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:02:46,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:02:46,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:02:46,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (1/1) ... [2024-06-03 22:02:46,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:02:46,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:02:46,610 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-03 22:02:46,621 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-03 22:02:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:02:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:02:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:02:46,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:02:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:02:46,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:02:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 22:02:46,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 22:02:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:02:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:02:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:02:46,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:02:46,642 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:02:46,826 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:02:46,828 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:02:47,862 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:02:47,863 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:02:48,075 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:02:48,075 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:02:48,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:02:48 BoogieIcfgContainer [2024-06-03 22:02:48,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:02:48,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:02:48,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:02:48,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:02:48,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:02:44" (1/4) ... [2024-06-03 22:02:48,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ba6b98 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:02:48, skipping insertion in model container [2024-06-03 22:02:48,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:02:45" (2/4) ... [2024-06-03 22:02:48,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ba6b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:02:48, skipping insertion in model container [2024-06-03 22:02:48,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:02:46" (3/4) ... [2024-06-03 22:02:48,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ba6b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:02:48, skipping insertion in model container [2024-06-03 22:02:48,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:02:48" (4/4) ... [2024-06-03 22:02:48,082 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2024-06-03 22:02:48,096 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:02:48,096 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 22:02:48,096 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:02:48,184 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:02:48,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:02:48,281 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-03 22:02:48,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:02:48,284 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 62 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-03 22:02:48,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:02:48,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-03 22:02:48,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:02:48,300 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;@3795d326, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:02:48,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 22:02:48,307 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:02:48,307 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 22:02:48,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:02:48,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:02:48,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:02:48,308 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-03 22:02:48,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:02:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1879000425, now seen corresponding path program 1 times [2024-06-03 22:02:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:02:48,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524801432] [2024-06-03 22:02:48,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:02:48,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:02:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:02:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:02:53,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:02:53,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524801432] [2024-06-03 22:02:53,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524801432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:02:53,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:02:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:02:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853354251] [2024-06-03 22:02:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:02:53,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:02:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:02:53,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:02:53,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:02:53,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-03 22:02:53,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:53,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:02:53,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-03 22:02:53,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:02:54,050 INFO L124 PetriNetUnfolderBase]: 946/1517 cut-off events. [2024-06-03 22:02:54,051 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-03 22:02:54,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3025 conditions, 1517 events. 946/1517 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7364 event pairs, 638 based on Foata normal form. 1/1473 useless extension candidates. Maximal degree in co-relation 3010. Up to 1431 conditions per place. [2024-06-03 22:02:54,063 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 32 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-03 22:02:54,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 171 flow [2024-06-03 22:02:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:02:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:02:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-03 22:02:54,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-06-03 22:02:54,073 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 75 transitions. [2024-06-03 22:02:54,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 171 flow [2024-06-03 22:02:54,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 22:02:54,077 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-03 22:02:54,078 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-03 22:02:54,080 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-03 22:02:54,081 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-03 22:02:54,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:54,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:02:54,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:02:54,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:02:54,081 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-03 22:02:54,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:02:54,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1833111882, now seen corresponding path program 1 times [2024-06-03 22:02:54,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:02:54,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553056885] [2024-06-03 22:02:54,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:02:54,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:02:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:02:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:02:57,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:02:57,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553056885] [2024-06-03 22:02:57,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553056885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:02:57,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:02:57,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:02:57,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094993022] [2024-06-03 22:02:57,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:02:57,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:02:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:02:57,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:02:57,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:02:57,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:02:57,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:57,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:02:57,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:02:57,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:02:58,303 INFO L124 PetriNetUnfolderBase]: 1110/1713 cut-off events. [2024-06-03 22:02:58,303 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2024-06-03 22:02:58,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 1713 events. 1110/1713 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8085 event pairs, 641 based on Foata normal form. 3/1710 useless extension candidates. Maximal degree in co-relation 3921. Up to 1652 conditions per place. [2024-06-03 22:02:58,312 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 40 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-03 22:02:58,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 240 flow [2024-06-03 22:02:58,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:02:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:02:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-06-03 22:02:58,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.573170731707317 [2024-06-03 22:02:58,314 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 94 transitions. [2024-06-03 22:02:58,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 240 flow [2024-06-03 22:02:58,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:02:58,316 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-03 22:02:58,316 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-03 22:02:58,316 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-03 22:02:58,317 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-03 22:02:58,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:58,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:02:58,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:02:58,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:02:58,317 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-03 22:02:58,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:02:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash -991892426, now seen corresponding path program 1 times [2024-06-03 22:02:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:02:58,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196678408] [2024-06-03 22:02:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:02:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:02:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:01,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:01,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196678408] [2024-06-03 22:03:01,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196678408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:01,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:01,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:03:01,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304558152] [2024-06-03 22:03:01,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:01,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:03:01,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:01,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:03:01,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:03:01,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:03:01,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:01,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:01,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:03:01,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:02,466 INFO L124 PetriNetUnfolderBase]: 1132/1764 cut-off events. [2024-06-03 22:03:02,467 INFO L125 PetriNetUnfolderBase]: For 989/989 co-relation queries the response was YES. [2024-06-03 22:03:02,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4498 conditions, 1764 events. 1132/1764 cut-off events. For 989/989 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8404 event pairs, 401 based on Foata normal form. 7/1766 useless extension candidates. Maximal degree in co-relation 4481. Up to 1555 conditions per place. [2024-06-03 22:03:02,476 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2024-06-03 22:03:02,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 406 flow [2024-06-03 22:03:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:03:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:03:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-06-03 22:03:02,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6146341463414634 [2024-06-03 22:03:02,481 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 126 transitions. [2024-06-03 22:03:02,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 406 flow [2024-06-03 22:03:02,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 392 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 22:03:02,485 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 235 flow [2024-06-03 22:03:02,485 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-06-03 22:03:02,486 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-03 22:03:02,486 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 235 flow [2024-06-03 22:03:02,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:02,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:02,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:02,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:03:02,487 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-03 22:03:02,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 274153525, now seen corresponding path program 1 times [2024-06-03 22:03:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:02,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081393742] [2024-06-03 22:03:02,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:06,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081393742] [2024-06-03 22:03:06,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081393742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:06,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:06,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:03:06,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575937190] [2024-06-03 22:03:06,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:06,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:03:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:03:06,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:03:06,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:03:06,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:06,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:06,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:03:06,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:07,040 INFO L124 PetriNetUnfolderBase]: 1214/1910 cut-off events. [2024-06-03 22:03:07,040 INFO L125 PetriNetUnfolderBase]: For 2570/2570 co-relation queries the response was YES. [2024-06-03 22:03:07,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5816 conditions, 1910 events. 1214/1910 cut-off events. For 2570/2570 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9480 event pairs, 273 based on Foata normal form. 26/1931 useless extension candidates. Maximal degree in co-relation 5796. Up to 1519 conditions per place. [2024-06-03 22:03:07,051 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 64 selfloop transitions, 18 changer transitions 0/87 dead transitions. [2024-06-03 22:03:07,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 87 transitions, 523 flow [2024-06-03 22:03:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:03:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:03:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-03 22:03:07,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5975609756097561 [2024-06-03 22:03:07,054 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 235 flow. Second operand 6 states and 147 transitions. [2024-06-03 22:03:07,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 87 transitions, 523 flow [2024-06-03 22:03:07,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 515 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-03 22:03:07,058 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 283 flow [2024-06-03 22:03:07,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-06-03 22:03:07,058 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2024-06-03 22:03:07,058 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 283 flow [2024-06-03 22:03:07,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:07,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:07,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:07,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:03:07,059 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-03 22:03:07,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:07,060 INFO L85 PathProgramCache]: Analyzing trace with hash -306618633, now seen corresponding path program 1 times [2024-06-03 22:03:07,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:07,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339791504] [2024-06-03 22:03:07,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:15,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:15,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339791504] [2024-06-03 22:03:15,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339791504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:15,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:15,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:03:15,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26126175] [2024-06-03 22:03:15,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:15,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:03:15,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:15,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:03:15,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:03:15,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:03:15,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03 22:03:15,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:15,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:03:15,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:15,902 INFO L124 PetriNetUnfolderBase]: 1034/1715 cut-off events. [2024-06-03 22:03:15,903 INFO L125 PetriNetUnfolderBase]: For 3193/3193 co-relation queries the response was YES. [2024-06-03 22:03:15,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5554 conditions, 1715 events. 1034/1715 cut-off events. For 3193/3193 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8808 event pairs, 374 based on Foata normal form. 4/1718 useless extension candidates. Maximal degree in co-relation 5531. Up to 1569 conditions per place. [2024-06-03 22:03:15,917 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 48 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2024-06-03 22:03:15,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 425 flow [2024-06-03 22:03:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:03:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:03:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-03 22:03:15,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-03 22:03:15,919 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 283 flow. Second operand 5 states and 100 transitions. [2024-06-03 22:03:15,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 425 flow [2024-06-03 22:03:15,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 381 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:03:15,926 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 263 flow [2024-06-03 22:03:15,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2024-06-03 22:03:15,928 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2024-06-03 22:03:15,929 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 263 flow [2024-06-03 22:03:15,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03 22:03:15,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:15,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:15,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:03:15,936 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-03 22:03:15,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:15,936 INFO L85 PathProgramCache]: Analyzing trace with hash -513407064, now seen corresponding path program 1 times [2024-06-03 22:03:15,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:15,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314725680] [2024-06-03 22:03:15,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:24,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:24,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314725680] [2024-06-03 22:03:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314725680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:24,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:03:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229869985] [2024-06-03 22:03:24,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:24,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:03:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:03:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:03:24,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:03:24,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:24,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:24,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:03:24,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:25,759 INFO L124 PetriNetUnfolderBase]: 1216/1914 cut-off events. [2024-06-03 22:03:25,759 INFO L125 PetriNetUnfolderBase]: For 4160/4160 co-relation queries the response was YES. [2024-06-03 22:03:25,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6250 conditions, 1914 events. 1216/1914 cut-off events. For 4160/4160 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9437 event pairs, 392 based on Foata normal form. 8/1918 useless extension candidates. Maximal degree in co-relation 6225. Up to 1698 conditions per place. [2024-06-03 22:03:25,769 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 52 selfloop transitions, 19 changer transitions 0/76 dead transitions. [2024-06-03 22:03:25,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 503 flow [2024-06-03 22:03:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:03:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:03:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-06-03 22:03:25,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2024-06-03 22:03:25,770 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 263 flow. Second operand 6 states and 124 transitions. [2024-06-03 22:03:25,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 503 flow [2024-06-03 22:03:25,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 481 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:03:25,773 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 313 flow [2024-06-03 22:03:25,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-06-03 22:03:25,774 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2024-06-03 22:03:25,774 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 313 flow [2024-06-03 22:03:25,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:25,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:25,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:25,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:03:25,774 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-03 22:03:25,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:25,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1692578784, now seen corresponding path program 2 times [2024-06-03 22:03:25,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:25,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446753838] [2024-06-03 22:03:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:35,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:35,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446753838] [2024-06-03 22:03:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446753838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:35,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:35,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:03:35,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039866120] [2024-06-03 22:03:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:35,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:03:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:03:35,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:03:35,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:03:35,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 313 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:35,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:35,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:03:35,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:36,241 INFO L124 PetriNetUnfolderBase]: 1184/1850 cut-off events. [2024-06-03 22:03:36,242 INFO L125 PetriNetUnfolderBase]: For 4925/4925 co-relation queries the response was YES. [2024-06-03 22:03:36,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6307 conditions, 1850 events. 1184/1850 cut-off events. For 4925/4925 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8903 event pairs, 380 based on Foata normal form. 4/1853 useless extension candidates. Maximal degree in co-relation 6282. Up to 1650 conditions per place. [2024-06-03 22:03:36,254 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 57 selfloop transitions, 21 changer transitions 0/83 dead transitions. [2024-06-03 22:03:36,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 543 flow [2024-06-03 22:03:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:03:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:03:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-03 22:03:36,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47560975609756095 [2024-06-03 22:03:36,257 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 313 flow. Second operand 8 states and 156 transitions. [2024-06-03 22:03:36,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 543 flow [2024-06-03 22:03:36,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 514 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 22:03:36,263 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 334 flow [2024-06-03 22:03:36,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=334, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-06-03 22:03:36,264 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-03 22:03:36,264 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 334 flow [2024-06-03 22:03:36,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:36,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:36,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:36,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:03:36,265 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-03 22:03:36,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1293915648, now seen corresponding path program 1 times [2024-06-03 22:03:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:36,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700471478] [2024-06-03 22:03:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:44,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700471478] [2024-06-03 22:03:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700471478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:44,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:44,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:03:44,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205840806] [2024-06-03 22:03:44,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:44,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:03:44,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:44,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:03:44,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:03:44,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:03:44,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 334 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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-03 22:03:44,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:44,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:03:44,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:45,560 INFO L124 PetriNetUnfolderBase]: 1006/1656 cut-off events. [2024-06-03 22:03:45,561 INFO L125 PetriNetUnfolderBase]: For 5168/5168 co-relation queries the response was YES. [2024-06-03 22:03:45,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5683 conditions, 1656 events. 1006/1656 cut-off events. For 5168/5168 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8341 event pairs, 336 based on Foata normal form. 4/1659 useless extension candidates. Maximal degree in co-relation 5657. Up to 1497 conditions per place. [2024-06-03 22:03:45,571 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 59 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2024-06-03 22:03:45,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 565 flow [2024-06-03 22:03:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:03:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:03:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 22:03:45,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-03 22:03:45,574 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 334 flow. Second operand 7 states and 135 transitions. [2024-06-03 22:03:45,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 565 flow [2024-06-03 22:03:45,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 493 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 22:03:45,579 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 342 flow [2024-06-03 22:03:45,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2024-06-03 22:03:45,580 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-03 22:03:45,580 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 342 flow [2024-06-03 22:03:45,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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-03 22:03:45,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:45,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:45,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:03:45,581 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:03:45,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1825711828, now seen corresponding path program 1 times [2024-06-03 22:03:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:45,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436521943] [2024-06-03 22:03:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:45,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:03:54,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:54,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436521943] [2024-06-03 22:03:54,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436521943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:54,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:03:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824726252] [2024-06-03 22:03:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:54,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:03:54,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:03:54,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:03:54,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:03:54,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:54,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:54,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:03:54,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:55,237 INFO L124 PetriNetUnfolderBase]: 1003/1657 cut-off events. [2024-06-03 22:03:55,237 INFO L125 PetriNetUnfolderBase]: For 5744/5744 co-relation queries the response was YES. [2024-06-03 22:03:55,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5873 conditions, 1657 events. 1003/1657 cut-off events. For 5744/5744 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8370 event pairs, 347 based on Foata normal form. 1/1657 useless extension candidates. Maximal degree in co-relation 5845. Up to 1526 conditions per place. [2024-06-03 22:03:55,245 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 55 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2024-06-03 22:03:55,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 508 flow [2024-06-03 22:03:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:03:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:03:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-03 22:03:55,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:03:55,247 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 342 flow. Second operand 5 states and 95 transitions. [2024-06-03 22:03:55,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 508 flow [2024-06-03 22:03:55,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 475 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:03:55,254 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 357 flow [2024-06-03 22:03:55,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-06-03 22:03:55,255 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2024-06-03 22:03:55,255 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 357 flow [2024-06-03 22:03:55,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:55,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:55,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:55,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:03:55,256 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-03 22:03:55,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:55,256 INFO L85 PathProgramCache]: Analyzing trace with hash -986868379, now seen corresponding path program 1 times [2024-06-03 22:03:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:55,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573917176] [2024-06-03 22:03:55,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:55,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:05,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573917176] [2024-06-03 22:04:05,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573917176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:05,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:05,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:04:05,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276258301] [2024-06-03 22:04:05,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:05,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:04:05,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:05,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:04:05,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:04:05,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:04:05,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 357 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:05,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:05,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:04:05,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:06,442 INFO L124 PetriNetUnfolderBase]: 1314/2076 cut-off events. [2024-06-03 22:04:06,443 INFO L125 PetriNetUnfolderBase]: For 10143/10143 co-relation queries the response was YES. [2024-06-03 22:04:06,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7870 conditions, 2076 events. 1314/2076 cut-off events. For 10143/10143 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10430 event pairs, 284 based on Foata normal form. 16/2088 useless extension candidates. Maximal degree in co-relation 7841. Up to 1419 conditions per place. [2024-06-03 22:04:06,453 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 71 selfloop transitions, 22 changer transitions 0/98 dead transitions. [2024-06-03 22:04:06,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 98 transitions, 699 flow [2024-06-03 22:04:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:04:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:04:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-03 22:04:06,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087108013937283 [2024-06-03 22:04:06,456 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 357 flow. Second operand 7 states and 146 transitions. [2024-06-03 22:04:06,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 98 transitions, 699 flow [2024-06-03 22:04:06,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 673 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-03 22:04:06,463 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 407 flow [2024-06-03 22:04:06,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=407, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-06-03 22:04:06,464 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2024-06-03 22:04:06,464 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 407 flow [2024-06-03 22:04:06,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:06,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:06,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:06,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:04:06,464 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-03 22:04:06,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:06,465 INFO L85 PathProgramCache]: Analyzing trace with hash -36910917, now seen corresponding path program 2 times [2024-06-03 22:04:06,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:06,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128203541] [2024-06-03 22:04:06,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:06,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:16,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128203541] [2024-06-03 22:04:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128203541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:16,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:16,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:04:16,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645320560] [2024-06-03 22:04:16,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:16,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:04:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:16,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:04:16,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:04:16,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:04:16,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 407 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:16,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:16,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:04:16,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:17,730 INFO L124 PetriNetUnfolderBase]: 1356/2155 cut-off events. [2024-06-03 22:04:17,730 INFO L125 PetriNetUnfolderBase]: For 12306/12306 co-relation queries the response was YES. [2024-06-03 22:04:17,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8393 conditions, 2155 events. 1356/2155 cut-off events. For 12306/12306 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11034 event pairs, 418 based on Foata normal form. 24/2175 useless extension candidates. Maximal degree in co-relation 8363. Up to 1806 conditions per place. [2024-06-03 22:04:17,742 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 66 selfloop transitions, 23 changer transitions 0/94 dead transitions. [2024-06-03 22:04:17,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 685 flow [2024-06-03 22:04:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:04:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:04:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-03 22:04:17,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49825783972125437 [2024-06-03 22:04:17,744 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 407 flow. Second operand 7 states and 143 transitions. [2024-06-03 22:04:17,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 685 flow [2024-06-03 22:04:17,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 94 transitions, 655 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 22:04:17,753 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 455 flow [2024-06-03 22:04:17,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-06-03 22:04:17,754 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2024-06-03 22:04:17,754 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 455 flow [2024-06-03 22:04:17,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:17,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:17,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:17,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:04:17,756 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:17,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2121168459, now seen corresponding path program 1 times [2024-06-03 22:04:17,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:17,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012049637] [2024-06-03 22:04:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012049637] [2024-06-03 22:04:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012049637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:26,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:04:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382569020] [2024-06-03 22:04:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:26,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:04:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:26,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:04:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:04:27,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:04:27,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 455 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:27,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:27,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:04:27,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:27,865 INFO L124 PetriNetUnfolderBase]: 1361/2172 cut-off events. [2024-06-03 22:04:27,865 INFO L125 PetriNetUnfolderBase]: For 12925/12925 co-relation queries the response was YES. [2024-06-03 22:04:27,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8820 conditions, 2172 events. 1361/2172 cut-off events. For 12925/12925 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11062 event pairs, 473 based on Foata normal form. 1/2172 useless extension candidates. Maximal degree in co-relation 8788. Up to 2073 conditions per place. [2024-06-03 22:04:27,876 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 67 selfloop transitions, 11 changer transitions 0/83 dead transitions. [2024-06-03 22:04:27,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 83 transitions, 671 flow [2024-06-03 22:04:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:04:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:04:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-03 22:04:27,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-03 22:04:27,877 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 455 flow. Second operand 6 states and 111 transitions. [2024-06-03 22:04:27,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 83 transitions, 671 flow [2024-06-03 22:04:27,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 83 transitions, 617 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:04:27,887 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 457 flow [2024-06-03 22:04:27,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=457, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-03 22:04:27,888 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-06-03 22:04:27,888 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 457 flow [2024-06-03 22:04:27,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:27,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:27,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:27,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:04:27,889 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:27,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash -364655509, now seen corresponding path program 1 times [2024-06-03 22:04:27,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:27,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729086148] [2024-06-03 22:04:27,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:27,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:36,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:36,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729086148] [2024-06-03 22:04:36,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729086148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:36,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:36,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:04:36,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641706198] [2024-06-03 22:04:36,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:36,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:04:36,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:36,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:04:36,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:04:36,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:04:36,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 457 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:36,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:36,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:04:36,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:37,507 INFO L124 PetriNetUnfolderBase]: 1389/2208 cut-off events. [2024-06-03 22:04:37,507 INFO L125 PetriNetUnfolderBase]: For 14768/14768 co-relation queries the response was YES. [2024-06-03 22:04:37,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9197 conditions, 2208 events. 1389/2208 cut-off events. For 14768/14768 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11248 event pairs, 440 based on Foata normal form. 4/2206 useless extension candidates. Maximal degree in co-relation 9164. Up to 1967 conditions per place. [2024-06-03 22:04:37,520 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 67 selfloop transitions, 28 changer transitions 0/100 dead transitions. [2024-06-03 22:04:37,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 100 transitions, 766 flow [2024-06-03 22:04:37,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:04:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:04:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-03 22:04:37,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-03 22:04:37,524 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 457 flow. Second operand 8 states and 154 transitions. [2024-06-03 22:04:37,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 100 transitions, 766 flow [2024-06-03 22:04:37,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 732 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:04:37,535 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 549 flow [2024-06-03 22:04:37,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=549, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2024-06-03 22:04:37,535 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-06-03 22:04:37,535 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 549 flow [2024-06-03 22:04:37,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:37,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:37,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:37,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:04:37,536 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-03 22:04:37,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash -358399399, now seen corresponding path program 2 times [2024-06-03 22:04:37,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:37,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834574919] [2024-06-03 22:04:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:37,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:45,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:45,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834574919] [2024-06-03 22:04:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834574919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:45,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:45,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:04:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102195286] [2024-06-03 22:04:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:45,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:04:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:04:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:04:46,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:04:46,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 549 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:46,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:46,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:04:46,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:47,089 INFO L124 PetriNetUnfolderBase]: 1381/2199 cut-off events. [2024-06-03 22:04:47,089 INFO L125 PetriNetUnfolderBase]: For 17265/17265 co-relation queries the response was YES. [2024-06-03 22:04:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9639 conditions, 2199 events. 1381/2199 cut-off events. For 17265/17265 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11190 event pairs, 438 based on Foata normal form. 4/2198 useless extension candidates. Maximal degree in co-relation 9604. Up to 1955 conditions per place. [2024-06-03 22:04:47,101 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 68 selfloop transitions, 34 changer transitions 0/107 dead transitions. [2024-06-03 22:04:47,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 107 transitions, 904 flow [2024-06-03 22:04:47,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:04:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:04:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-03 22:04:47,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-03 22:04:47,104 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 549 flow. Second operand 8 states and 154 transitions. [2024-06-03 22:04:47,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 107 transitions, 904 flow [2024-06-03 22:04:47,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 107 transitions, 821 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 22:04:47,118 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 644 flow [2024-06-03 22:04:47,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=644, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2024-06-03 22:04:47,119 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-03 22:04:47,119 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 644 flow [2024-06-03 22:04:47,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:47,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:47,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:47,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:04:47,120 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-03 22:04:47,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2087602655, now seen corresponding path program 3 times [2024-06-03 22:04:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:47,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904817705] [2024-06-03 22:04:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:47,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:55,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:55,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904817705] [2024-06-03 22:04:55,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904817705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:55,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:55,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:04:55,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858356253] [2024-06-03 22:04:55,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:55,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:04:55,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:55,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:04:55,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:04:56,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:04:56,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 644 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:56,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:56,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:04:56,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:57,215 INFO L124 PetriNetUnfolderBase]: 1414/2268 cut-off events. [2024-06-03 22:04:57,215 INFO L125 PetriNetUnfolderBase]: For 19601/19601 co-relation queries the response was YES. [2024-06-03 22:04:57,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10115 conditions, 2268 events. 1414/2268 cut-off events. For 19601/19601 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11771 event pairs, 355 based on Foata normal form. 4/2267 useless extension candidates. Maximal degree in co-relation 10078. Up to 1845 conditions per place. [2024-06-03 22:04:57,228 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 68 selfloop transitions, 41 changer transitions 0/114 dead transitions. [2024-06-03 22:04:57,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 114 transitions, 978 flow [2024-06-03 22:04:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:04:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:04:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-03 22:04:57,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817073170731707 [2024-06-03 22:04:57,238 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 644 flow. Second operand 8 states and 158 transitions. [2024-06-03 22:04:57,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 114 transitions, 978 flow [2024-06-03 22:04:57,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 114 transitions, 914 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-03 22:04:57,255 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 726 flow [2024-06-03 22:04:57,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=726, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-06-03 22:04:57,256 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2024-06-03 22:04:57,256 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 726 flow [2024-06-03 22:04:57,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:57,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:57,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:04:57,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:04:57,257 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:57,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2132596299, now seen corresponding path program 2 times [2024-06-03 22:04:57,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:57,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310048852] [2024-06-03 22:04:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:06,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:06,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310048852] [2024-06-03 22:05:06,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310048852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:06,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:06,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:05:06,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160389715] [2024-06-03 22:05:06,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:06,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:05:06,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:06,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:05:06,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:05:06,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:05:06,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 726 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:06,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:06,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:05:06,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:07,231 INFO L124 PetriNetUnfolderBase]: 1411/2278 cut-off events. [2024-06-03 22:05:07,231 INFO L125 PetriNetUnfolderBase]: For 21505/21505 co-relation queries the response was YES. [2024-06-03 22:05:07,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10360 conditions, 2278 events. 1411/2278 cut-off events. For 21505/21505 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11890 event pairs, 435 based on Foata normal form. 1/2278 useless extension candidates. Maximal degree in co-relation 10321. Up to 2153 conditions per place. [2024-06-03 22:05:07,243 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 85 selfloop transitions, 17 changer transitions 0/107 dead transitions. [2024-06-03 22:05:07,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 107 transitions, 1016 flow [2024-06-03 22:05:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:05:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:05:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-03 22:05:07,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:05:07,257 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 726 flow. Second operand 7 states and 126 transitions. [2024-06-03 22:05:07,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 107 transitions, 1016 flow [2024-06-03 22:05:07,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 107 transitions, 926 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-03 22:05:07,276 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 740 flow [2024-06-03 22:05:07,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=740, PETRI_PLACES=91, PETRI_TRANSITIONS=91} [2024-06-03 22:05:07,276 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2024-06-03 22:05:07,276 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 740 flow [2024-06-03 22:05:07,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:07,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:07,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:07,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:05:07,277 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:07,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:07,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1639605209, now seen corresponding path program 1 times [2024-06-03 22:05:07,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:07,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763248624] [2024-06-03 22:05:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:16,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:16,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763248624] [2024-06-03 22:05:16,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763248624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:16,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:16,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:05:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620886818] [2024-06-03 22:05:16,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:16,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:05:16,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:05:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:05:16,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:05:16,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 740 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:16,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:16,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:05:16,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:16,983 INFO L124 PetriNetUnfolderBase]: 1338/2213 cut-off events. [2024-06-03 22:05:16,983 INFO L125 PetriNetUnfolderBase]: For 25089/25089 co-relation queries the response was YES. [2024-06-03 22:05:16,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10246 conditions, 2213 events. 1338/2213 cut-off events. For 25089/25089 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11864 event pairs, 406 based on Foata normal form. 3/2213 useless extension candidates. Maximal degree in co-relation 10205. Up to 2018 conditions per place. [2024-06-03 22:05:16,994 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 87 selfloop transitions, 11 changer transitions 0/107 dead transitions. [2024-06-03 22:05:16,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 107 transitions, 990 flow [2024-06-03 22:05:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:05:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:05:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-03 22:05:16,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:05:16,995 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 740 flow. Second operand 6 states and 114 transitions. [2024-06-03 22:05:16,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 107 transitions, 990 flow [2024-06-03 22:05:17,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 107 transitions, 952 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-03 22:05:17,010 INFO L231 Difference]: Finished difference. Result has 94 places, 94 transitions, 754 flow [2024-06-03 22:05:17,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2024-06-03 22:05:17,011 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-03 22:05:17,011 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 754 flow [2024-06-03 22:05:17,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:17,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:17,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:17,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:05:17,011 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:17,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2132602251, now seen corresponding path program 2 times [2024-06-03 22:05:17,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:17,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083248094] [2024-06-03 22:05:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083248094] [2024-06-03 22:05:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083248094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:26,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:26,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:05:26,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012913120] [2024-06-03 22:05:26,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:26,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:05:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:26,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:05:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:05:26,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:05:26,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 754 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:26,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:26,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:05:26,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:27,019 INFO L124 PetriNetUnfolderBase]: 1337/2215 cut-off events. [2024-06-03 22:05:27,019 INFO L125 PetriNetUnfolderBase]: For 27134/27137 co-relation queries the response was YES. [2024-06-03 22:05:27,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10599 conditions, 2215 events. 1337/2215 cut-off events. For 27134/27137 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11897 event pairs, 409 based on Foata normal form. 5/2216 useless extension candidates. Maximal degree in co-relation 10556. Up to 2007 conditions per place. [2024-06-03 22:05:27,031 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 81 selfloop transitions, 18 changer transitions 0/108 dead transitions. [2024-06-03 22:05:27,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 108 transitions, 1010 flow [2024-06-03 22:05:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:05:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:05:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-03 22:05:27,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:05:27,033 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 754 flow. Second operand 6 states and 114 transitions. [2024-06-03 22:05:27,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 108 transitions, 1010 flow [2024-06-03 22:05:27,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 108 transitions, 980 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:05:27,049 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 797 flow [2024-06-03 22:05:27,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2024-06-03 22:05:27,049 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-03 22:05:27,049 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 797 flow [2024-06-03 22:05:27,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:27,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:27,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:27,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:05:27,050 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:27,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:27,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2132610187, now seen corresponding path program 1 times [2024-06-03 22:05:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:27,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076211399] [2024-06-03 22:05:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:36,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076211399] [2024-06-03 22:05:36,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076211399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:36,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:36,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:05:36,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76714620] [2024-06-03 22:05:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:36,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:05:36,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:36,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:05:36,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:05:36,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:05:36,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 797 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:36,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:36,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:05:36,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:37,479 INFO L124 PetriNetUnfolderBase]: 1432/2312 cut-off events. [2024-06-03 22:05:37,480 INFO L125 PetriNetUnfolderBase]: For 28993/28993 co-relation queries the response was YES. [2024-06-03 22:05:37,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11364 conditions, 2312 events. 1432/2312 cut-off events. For 28993/28993 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12145 event pairs, 436 based on Foata normal form. 1/2312 useless extension candidates. Maximal degree in co-relation 11320. Up to 2198 conditions per place. [2024-06-03 22:05:37,493 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 91 selfloop transitions, 14 changer transitions 0/110 dead transitions. [2024-06-03 22:05:37,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 110 transitions, 1063 flow [2024-06-03 22:05:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:05:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:05:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-03 22:05:37,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:05:37,495 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 797 flow. Second operand 7 states and 119 transitions. [2024-06-03 22:05:37,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 110 transitions, 1063 flow [2024-06-03 22:05:37,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 110 transitions, 1014 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 22:05:37,512 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 820 flow [2024-06-03 22:05:37,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=820, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2024-06-03 22:05:37,512 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places. [2024-06-03 22:05:37,512 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 820 flow [2024-06-03 22:05:37,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:37,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:37,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:37,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:05:37,513 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:37,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:37,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1331415537, now seen corresponding path program 1 times [2024-06-03 22:05:37,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:37,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133596762] [2024-06-03 22:05:37,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:37,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133596762] [2024-06-03 22:05:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133596762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:46,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:05:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865696450] [2024-06-03 22:05:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:46,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:05:46,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:46,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:05:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:05:46,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:05:46,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 820 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:46,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:46,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:05:46,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:47,753 INFO L124 PetriNetUnfolderBase]: 1447/2338 cut-off events. [2024-06-03 22:05:47,754 INFO L125 PetriNetUnfolderBase]: For 31668/31671 co-relation queries the response was YES. [2024-06-03 22:05:47,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11705 conditions, 2338 events. 1447/2338 cut-off events. For 31668/31671 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12354 event pairs, 434 based on Foata normal form. 5/2341 useless extension candidates. Maximal degree in co-relation 11660. Up to 2139 conditions per place. [2024-06-03 22:05:47,766 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 101 selfloop transitions, 24 changer transitions 0/130 dead transitions. [2024-06-03 22:05:47,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 130 transitions, 1188 flow [2024-06-03 22:05:47,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:05:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:05:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-03 22:05:47,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47735191637630664 [2024-06-03 22:05:47,767 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 820 flow. Second operand 7 states and 137 transitions. [2024-06-03 22:05:47,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 130 transitions, 1188 flow [2024-06-03 22:05:47,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 130 transitions, 1118 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-03 22:05:47,787 INFO L231 Difference]: Finished difference. Result has 101 places, 107 transitions, 882 flow [2024-06-03 22:05:47,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=882, PETRI_PLACES=101, PETRI_TRANSITIONS=107} [2024-06-03 22:05:47,787 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-03 22:05:47,787 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 107 transitions, 882 flow [2024-06-03 22:05:47,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:47,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:47,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:47,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:05:47,788 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-03 22:05:47,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:47,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1154797477, now seen corresponding path program 1 times [2024-06-03 22:05:47,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:47,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713089441] [2024-06-03 22:05:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:47,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:55,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713089441] [2024-06-03 22:05:55,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713089441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:55,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:55,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:05:55,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162922481] [2024-06-03 22:05:55,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:55,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:05:55,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:55,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:05:55,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:05:56,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:05:56,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 107 transitions, 882 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:56,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:56,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:05:56,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:57,061 INFO L124 PetriNetUnfolderBase]: 1557/2539 cut-off events. [2024-06-03 22:05:57,061 INFO L125 PetriNetUnfolderBase]: For 36888/36888 co-relation queries the response was YES. [2024-06-03 22:05:57,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13110 conditions, 2539 events. 1557/2539 cut-off events. For 36888/36888 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13876 event pairs, 442 based on Foata normal form. 12/2547 useless extension candidates. Maximal degree in co-relation 13064. Up to 1961 conditions per place. [2024-06-03 22:05:57,076 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 103 selfloop transitions, 37 changer transitions 0/145 dead transitions. [2024-06-03 22:05:57,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 145 transitions, 1312 flow [2024-06-03 22:05:57,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:05:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:05:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-03 22:05:57,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847560975609756 [2024-06-03 22:05:57,078 INFO L175 Difference]: Start difference. First operand has 101 places, 107 transitions, 882 flow. Second operand 8 states and 159 transitions. [2024-06-03 22:05:57,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 145 transitions, 1312 flow [2024-06-03 22:05:57,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 145 transitions, 1250 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-03 22:05:57,104 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 969 flow [2024-06-03 22:05:57,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2024-06-03 22:05:57,105 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2024-06-03 22:05:57,105 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 969 flow [2024-06-03 22:05:57,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:57,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:57,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:05:57,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:05:57,106 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:05:57,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1331714439, now seen corresponding path program 1 times [2024-06-03 22:05:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049411570] [2024-06-03 22:05:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:06,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049411570] [2024-06-03 22:06:06,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049411570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:06,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:06,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:06:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127367922] [2024-06-03 22:06:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:06,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:06:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:06,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:06:06,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:06:06,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:06:06,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 969 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:06,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:06,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:06:06,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:07,328 INFO L124 PetriNetUnfolderBase]: 1562/2546 cut-off events. [2024-06-03 22:06:07,328 INFO L125 PetriNetUnfolderBase]: For 38928/38928 co-relation queries the response was YES. [2024-06-03 22:06:07,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13487 conditions, 2546 events. 1562/2546 cut-off events. For 38928/38928 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13926 event pairs, 452 based on Foata normal form. 1/2546 useless extension candidates. Maximal degree in co-relation 13440. Up to 2399 conditions per place. [2024-06-03 22:06:07,342 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 112 selfloop transitions, 14 changer transitions 0/131 dead transitions. [2024-06-03 22:06:07,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 131 transitions, 1307 flow [2024-06-03 22:06:07,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:06:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:06:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 22:06:07,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-03 22:06:07,343 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 969 flow. Second operand 7 states and 125 transitions. [2024-06-03 22:06:07,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 131 transitions, 1307 flow [2024-06-03 22:06:07,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 131 transitions, 1256 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-03 22:06:07,371 INFO L231 Difference]: Finished difference. Result has 110 places, 115 transitions, 1004 flow [2024-06-03 22:06:07,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1004, PETRI_PLACES=110, PETRI_TRANSITIONS=115} [2024-06-03 22:06:07,372 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-03 22:06:07,372 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 1004 flow [2024-06-03 22:06:07,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:07,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:07,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:07,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:06:07,373 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:07,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1674012657, now seen corresponding path program 2 times [2024-06-03 22:06:07,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:07,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81054685] [2024-06-03 22:06:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81054685] [2024-06-03 22:06:16,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81054685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:16,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:16,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:06:16,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48245778] [2024-06-03 22:06:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:16,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:06:16,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:16,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:06:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:06:16,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:06:16,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 115 transitions, 1004 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:16,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:16,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:06:16,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:17,578 INFO L124 PetriNetUnfolderBase]: 1613/2632 cut-off events. [2024-06-03 22:06:17,578 INFO L125 PetriNetUnfolderBase]: For 42033/42036 co-relation queries the response was YES. [2024-06-03 22:06:17,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14130 conditions, 2632 events. 1613/2632 cut-off events. For 42033/42036 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14496 event pairs, 457 based on Foata normal form. 5/2635 useless extension candidates. Maximal degree in co-relation 14082. Up to 2359 conditions per place. [2024-06-03 22:06:17,595 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 108 selfloop transitions, 29 changer transitions 0/142 dead transitions. [2024-06-03 22:06:17,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 142 transitions, 1470 flow [2024-06-03 22:06:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:06:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:06:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-03 22:06:17,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46689895470383275 [2024-06-03 22:06:17,596 INFO L175 Difference]: Start difference. First operand has 110 places, 115 transitions, 1004 flow. Second operand 7 states and 134 transitions. [2024-06-03 22:06:17,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 142 transitions, 1470 flow [2024-06-03 22:06:17,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 142 transitions, 1406 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-03 22:06:17,627 INFO L231 Difference]: Finished difference. Result has 113 places, 123 transitions, 1120 flow [2024-06-03 22:06:17,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1120, PETRI_PLACES=113, PETRI_TRANSITIONS=123} [2024-06-03 22:06:17,628 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-03 22:06:17,628 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 123 transitions, 1120 flow [2024-06-03 22:06:17,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:17,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:17,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:17,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:06:17,629 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:17,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1877054787, now seen corresponding path program 2 times [2024-06-03 22:06:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554276608] [2024-06-03 22:06:17,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:17,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:25,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:25,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554276608] [2024-06-03 22:06:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554276608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:25,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:25,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:06:25,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851875121] [2024-06-03 22:06:25,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:25,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:06:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:25,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:06:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:06:26,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:06:26,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 123 transitions, 1120 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:26,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:26,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:06:26,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:27,099 INFO L124 PetriNetUnfolderBase]: 1593/2599 cut-off events. [2024-06-03 22:06:27,100 INFO L125 PetriNetUnfolderBase]: For 46897/46897 co-relation queries the response was YES. [2024-06-03 22:06:27,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14515 conditions, 2599 events. 1593/2599 cut-off events. For 46897/46897 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14176 event pairs, 279 based on Foata normal form. 12/2607 useless extension candidates. Maximal degree in co-relation 14465. Up to 1591 conditions per place. [2024-06-03 22:06:27,117 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 108 selfloop transitions, 40 changer transitions 0/153 dead transitions. [2024-06-03 22:06:27,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 153 transitions, 1516 flow [2024-06-03 22:06:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:06:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:06:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-03 22:06:27,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49825783972125437 [2024-06-03 22:06:27,119 INFO L175 Difference]: Start difference. First operand has 113 places, 123 transitions, 1120 flow. Second operand 7 states and 143 transitions. [2024-06-03 22:06:27,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 153 transitions, 1516 flow [2024-06-03 22:06:27,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 153 transitions, 1447 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-03 22:06:27,159 INFO L231 Difference]: Finished difference. Result has 117 places, 123 transitions, 1140 flow [2024-06-03 22:06:27,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1140, PETRI_PLACES=117, PETRI_TRANSITIONS=123} [2024-06-03 22:06:27,160 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-03 22:06:27,160 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 123 transitions, 1140 flow [2024-06-03 22:06:27,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:27,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:27,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:27,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:06:27,160 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-03 22:06:27,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:27,161 INFO L85 PathProgramCache]: Analyzing trace with hash -407207635, now seen corresponding path program 3 times [2024-06-03 22:06:27,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:27,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690154999] [2024-06-03 22:06:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:36,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:36,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690154999] [2024-06-03 22:06:36,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690154999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:36,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:36,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:06:36,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490606892] [2024-06-03 22:06:36,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:36,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:06:36,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:36,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:06:36,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:06:36,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:06:36,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 123 transitions, 1140 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:36,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:36,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:06:36,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:37,773 INFO L124 PetriNetUnfolderBase]: 1573/2569 cut-off events. [2024-06-03 22:06:37,773 INFO L125 PetriNetUnfolderBase]: For 48312/48312 co-relation queries the response was YES. [2024-06-03 22:06:37,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14457 conditions, 2569 events. 1573/2569 cut-off events. For 48312/48312 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14060 event pairs, 262 based on Foata normal form. 12/2571 useless extension candidates. Maximal degree in co-relation 14405. Up to 1449 conditions per place. [2024-06-03 22:06:37,791 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 103 selfloop transitions, 39 changer transitions 0/147 dead transitions. [2024-06-03 22:06:37,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 1478 flow [2024-06-03 22:06:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:06:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:06:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 22:06:37,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-03 22:06:37,793 INFO L175 Difference]: Start difference. First operand has 117 places, 123 transitions, 1140 flow. Second operand 7 states and 135 transitions. [2024-06-03 22:06:37,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 1478 flow [2024-06-03 22:06:37,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 147 transitions, 1374 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 22:06:37,831 INFO L231 Difference]: Finished difference. Result has 117 places, 122 transitions, 1086 flow [2024-06-03 22:06:37,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1086, PETRI_PLACES=117, PETRI_TRANSITIONS=122} [2024-06-03 22:06:37,833 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-03 22:06:37,833 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 122 transitions, 1086 flow [2024-06-03 22:06:37,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:37,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:37,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:37,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:06:37,834 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:37,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1685989569, now seen corresponding path program 2 times [2024-06-03 22:06:37,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:37,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481519091] [2024-06-03 22:06:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:37,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:47,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481519091] [2024-06-03 22:06:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481519091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:06:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602800114] [2024-06-03 22:06:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:47,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:06:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:47,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:06:47,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:06:47,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:06:47,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 1086 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:47,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:47,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:06:47,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:48,407 INFO L124 PetriNetUnfolderBase]: 1578/2574 cut-off events. [2024-06-03 22:06:48,407 INFO L125 PetriNetUnfolderBase]: For 45198/45198 co-relation queries the response was YES. [2024-06-03 22:06:48,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14443 conditions, 2574 events. 1578/2574 cut-off events. For 45198/45198 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14043 event pairs, 430 based on Foata normal form. 1/2574 useless extension candidates. Maximal degree in co-relation 14390. Up to 2425 conditions per place. [2024-06-03 22:06:48,426 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 116 selfloop transitions, 14 changer transitions 0/135 dead transitions. [2024-06-03 22:06:48,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 135 transitions, 1426 flow [2024-06-03 22:06:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:06:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:06:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 22:06:48,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-03 22:06:48,427 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 1086 flow. Second operand 7 states and 118 transitions. [2024-06-03 22:06:48,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 135 transitions, 1426 flow [2024-06-03 22:06:48,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 135 transitions, 1315 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:06:48,471 INFO L231 Difference]: Finished difference. Result has 118 places, 125 transitions, 1071 flow [2024-06-03 22:06:48,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1071, PETRI_PLACES=118, PETRI_TRANSITIONS=125} [2024-06-03 22:06:48,472 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-03 22:06:48,472 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 125 transitions, 1071 flow [2024-06-03 22:06:48,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:48,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:48,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:48,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:06:48,472 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:48,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1685977107, now seen corresponding path program 3 times [2024-06-03 22:06:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:48,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978449483] [2024-06-03 22:06:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:06:58,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:58,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978449483] [2024-06-03 22:06:58,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978449483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:58,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:58,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:06:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012158856] [2024-06-03 22:06:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:58,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:06:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:06:58,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:06:58,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:06:58,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 125 transitions, 1071 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:58,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:58,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:06:58,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:59,321 INFO L124 PetriNetUnfolderBase]: 1605/2621 cut-off events. [2024-06-03 22:06:59,321 INFO L125 PetriNetUnfolderBase]: For 48520/48523 co-relation queries the response was YES. [2024-06-03 22:06:59,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14579 conditions, 2621 events. 1605/2621 cut-off events. For 48520/48523 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14390 event pairs, 430 based on Foata normal form. 5/2624 useless extension candidates. Maximal degree in co-relation 14526. Up to 2282 conditions per place. [2024-06-03 22:06:59,340 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 112 selfloop transitions, 43 changer transitions 0/160 dead transitions. [2024-06-03 22:06:59,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 160 transitions, 1687 flow [2024-06-03 22:06:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:06:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:06:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-03 22:06:59,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:06:59,341 INFO L175 Difference]: Start difference. First operand has 118 places, 125 transitions, 1071 flow. Second operand 8 states and 152 transitions. [2024-06-03 22:06:59,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 160 transitions, 1687 flow [2024-06-03 22:06:59,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 160 transitions, 1613 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-03 22:06:59,383 INFO L231 Difference]: Finished difference. Result has 123 places, 138 transitions, 1278 flow [2024-06-03 22:06:59,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1278, PETRI_PLACES=123, PETRI_TRANSITIONS=138} [2024-06-03 22:06:59,383 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 81 predicate places. [2024-06-03 22:06:59,383 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 138 transitions, 1278 flow [2024-06-03 22:06:59,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:59,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:59,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:06:59,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:06:59,384 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:59,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1685977479, now seen corresponding path program 3 times [2024-06-03 22:06:59,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:59,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602932177] [2024-06-03 22:06:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:59,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:09,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602932177] [2024-06-03 22:07:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602932177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:09,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:09,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:07:09,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624448247] [2024-06-03 22:07:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:09,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:07:09,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:09,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:07:09,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:07:09,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:07:09,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 138 transitions, 1278 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:09,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:09,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:07:09,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:10,110 INFO L124 PetriNetUnfolderBase]: 1602/2612 cut-off events. [2024-06-03 22:07:10,110 INFO L125 PetriNetUnfolderBase]: For 53459/53459 co-relation queries the response was YES. [2024-06-03 22:07:10,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15356 conditions, 2612 events. 1602/2612 cut-off events. For 53459/53459 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14231 event pairs, 438 based on Foata normal form. 1/2612 useless extension candidates. Maximal degree in co-relation 15300. Up to 2432 conditions per place. [2024-06-03 22:07:10,128 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 126 selfloop transitions, 27 changer transitions 0/158 dead transitions. [2024-06-03 22:07:10,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 158 transitions, 1692 flow [2024-06-03 22:07:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:07:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:07:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 22:07:10,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-03 22:07:10,131 INFO L175 Difference]: Start difference. First operand has 123 places, 138 transitions, 1278 flow. Second operand 8 states and 141 transitions. [2024-06-03 22:07:10,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 158 transitions, 1692 flow [2024-06-03 22:07:10,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 158 transitions, 1603 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-03 22:07:10,174 INFO L231 Difference]: Finished difference. Result has 128 places, 141 transitions, 1321 flow [2024-06-03 22:07:10,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1321, PETRI_PLACES=128, PETRI_TRANSITIONS=141} [2024-06-03 22:07:10,175 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-03 22:07:10,175 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 141 transitions, 1321 flow [2024-06-03 22:07:10,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:10,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:10,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:07:10,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:07:10,176 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:10,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1508910315, now seen corresponding path program 1 times [2024-06-03 22:07:10,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:10,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293521428] [2024-06-03 22:07:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:19,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293521428] [2024-06-03 22:07:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293521428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:19,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:19,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:07:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219689074] [2024-06-03 22:07:19,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:19,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:07:19,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:19,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:07:19,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:07:19,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:07:19,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 141 transitions, 1321 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:19,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:19,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:07:19,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:20,603 INFO L124 PetriNetUnfolderBase]: 1535/2539 cut-off events. [2024-06-03 22:07:20,603 INFO L125 PetriNetUnfolderBase]: For 56903/56911 co-relation queries the response was YES. [2024-06-03 22:07:20,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14863 conditions, 2539 events. 1535/2539 cut-off events. For 56903/56911 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 14169 event pairs, 408 based on Foata normal form. 2/2522 useless extension candidates. Maximal degree in co-relation 14805. Up to 2270 conditions per place. [2024-06-03 22:07:20,622 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 131 selfloop transitions, 14 changer transitions 0/160 dead transitions. [2024-06-03 22:07:20,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 160 transitions, 1693 flow [2024-06-03 22:07:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:07:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:07:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 22:07:20,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-03 22:07:20,624 INFO L175 Difference]: Start difference. First operand has 128 places, 141 transitions, 1321 flow. Second operand 7 states and 130 transitions. [2024-06-03 22:07:20,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 160 transitions, 1693 flow [2024-06-03 22:07:20,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 160 transitions, 1583 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-03 22:07:20,668 INFO L231 Difference]: Finished difference. Result has 129 places, 144 transitions, 1293 flow [2024-06-03 22:07:20,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1293, PETRI_PLACES=129, PETRI_TRANSITIONS=144} [2024-06-03 22:07:20,669 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-03 22:07:20,669 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 144 transitions, 1293 flow [2024-06-03 22:07:20,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:20,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:20,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:07:20,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:07:20,669 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:20,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:20,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1686408069, now seen corresponding path program 1 times [2024-06-03 22:07:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:20,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365980402] [2024-06-03 22:07:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:30,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:30,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365980402] [2024-06-03 22:07:30,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365980402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:30,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:30,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:07:30,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567989088] [2024-06-03 22:07:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:30,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:07:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:30,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:07:30,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:07:31,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:07:31,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 144 transitions, 1293 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:31,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:31,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:07:31,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:31,996 INFO L124 PetriNetUnfolderBase]: 1591/2597 cut-off events. [2024-06-03 22:07:31,996 INFO L125 PetriNetUnfolderBase]: For 58890/58890 co-relation queries the response was YES. [2024-06-03 22:07:32,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15294 conditions, 2597 events. 1591/2597 cut-off events. For 58890/58890 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14163 event pairs, 435 based on Foata normal form. 2/2598 useless extension candidates. Maximal degree in co-relation 15235. Up to 2438 conditions per place. [2024-06-03 22:07:32,014 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 137 selfloop transitions, 16 changer transitions 0/158 dead transitions. [2024-06-03 22:07:32,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 158 transitions, 1675 flow [2024-06-03 22:07:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:07:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:07:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-03 22:07:32,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-03 22:07:32,015 INFO L175 Difference]: Start difference. First operand has 129 places, 144 transitions, 1293 flow. Second operand 8 states and 132 transitions. [2024-06-03 22:07:32,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 158 transitions, 1675 flow [2024-06-03 22:07:32,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 158 transitions, 1619 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-03 22:07:32,059 INFO L231 Difference]: Finished difference. Result has 132 places, 146 transitions, 1326 flow [2024-06-03 22:07:32,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1326, PETRI_PLACES=132, PETRI_TRANSITIONS=146} [2024-06-03 22:07:32,059 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 90 predicate places. [2024-06-03 22:07:32,060 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 146 transitions, 1326 flow [2024-06-03 22:07:32,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:32,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:32,060 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-03 22:07:32,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:07:32,060 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:32,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash 475339013, now seen corresponding path program 1 times [2024-06-03 22:07:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180491638] [2024-06-03 22:07:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:32,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:41,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180491638] [2024-06-03 22:07:41,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180491638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:41,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:41,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:07:41,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354648421] [2024-06-03 22:07:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:41,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:07:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:41,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:07:41,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:07:41,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:07:41,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 146 transitions, 1326 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:41,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:41,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:07:41,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:42,913 INFO L124 PetriNetUnfolderBase]: 1606/2623 cut-off events. [2024-06-03 22:07:42,914 INFO L125 PetriNetUnfolderBase]: For 62641/62644 co-relation queries the response was YES. [2024-06-03 22:07:42,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15618 conditions, 2623 events. 1606/2623 cut-off events. For 62641/62644 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14347 event pairs, 436 based on Foata normal form. 5/2626 useless extension candidates. Maximal degree in co-relation 15558. Up to 2374 conditions per place. [2024-06-03 22:07:42,931 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 142 selfloop transitions, 28 changer transitions 0/175 dead transitions. [2024-06-03 22:07:42,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 175 transitions, 1810 flow [2024-06-03 22:07:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:07:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:07:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-03 22:07:42,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:07:42,932 INFO L175 Difference]: Start difference. First operand has 132 places, 146 transitions, 1326 flow. Second operand 8 states and 152 transitions. [2024-06-03 22:07:42,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 175 transitions, 1810 flow [2024-06-03 22:07:42,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 175 transitions, 1737 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-03 22:07:42,982 INFO L231 Difference]: Finished difference. Result has 134 places, 150 transitions, 1394 flow [2024-06-03 22:07:42,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1394, PETRI_PLACES=134, PETRI_TRANSITIONS=150} [2024-06-03 22:07:42,983 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2024-06-03 22:07:42,983 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 150 transitions, 1394 flow [2024-06-03 22:07:42,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:42,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:42,984 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-03 22:07:42,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:07:42,984 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:42,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash -803082470, now seen corresponding path program 1 times [2024-06-03 22:07:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747382796] [2024-06-03 22:07:42,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:42,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:52,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:52,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747382796] [2024-06-03 22:07:52,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747382796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:52,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:52,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:07:52,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667666622] [2024-06-03 22:07:52,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:52,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:07:52,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:52,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:07:52,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:07:52,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:07:52,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 150 transitions, 1394 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:52,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:52,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:07:52,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:53,323 INFO L124 PetriNetUnfolderBase]: 1626/2655 cut-off events. [2024-06-03 22:07:53,323 INFO L125 PetriNetUnfolderBase]: For 67713/67716 co-relation queries the response was YES. [2024-06-03 22:07:53,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16332 conditions, 2655 events. 1626/2655 cut-off events. For 67713/67716 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14557 event pairs, 434 based on Foata normal form. 6/2659 useless extension candidates. Maximal degree in co-relation 16271. Up to 2410 conditions per place. [2024-06-03 22:07:53,342 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 146 selfloop transitions, 23 changer transitions 0/174 dead transitions. [2024-06-03 22:07:53,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 174 transitions, 1848 flow [2024-06-03 22:07:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:07:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:07:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 22:07:53,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:07:53,343 INFO L175 Difference]: Start difference. First operand has 134 places, 150 transitions, 1394 flow. Second operand 7 states and 133 transitions. [2024-06-03 22:07:53,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 174 transitions, 1848 flow [2024-06-03 22:07:53,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 174 transitions, 1735 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-03 22:07:53,393 INFO L231 Difference]: Finished difference. Result has 135 places, 154 transitions, 1402 flow [2024-06-03 22:07:53,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1402, PETRI_PLACES=135, PETRI_TRANSITIONS=154} [2024-06-03 22:07:53,394 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-03 22:07:53,394 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 154 transitions, 1402 flow [2024-06-03 22:07:53,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:53,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:53,394 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-03 22:07:53,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:07:53,394 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-03 22:07:53,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:53,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1666531606, now seen corresponding path program 2 times [2024-06-03 22:07:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:53,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688747615] [2024-06-03 22:07:53,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:53,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:03,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:03,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688747615] [2024-06-03 22:08:03,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688747615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:03,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:03,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:08:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409051378] [2024-06-03 22:08:03,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:03,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:08:03,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:03,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:08:03,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:08:03,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:08:03,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 154 transitions, 1402 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:03,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:03,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:08:03,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:04,190 INFO L124 PetriNetUnfolderBase]: 1630/2665 cut-off events. [2024-06-03 22:08:04,190 INFO L125 PetriNetUnfolderBase]: For 70664/70667 co-relation queries the response was YES. [2024-06-03 22:08:04,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16399 conditions, 2665 events. 1630/2665 cut-off events. For 70664/70667 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14686 event pairs, 433 based on Foata normal form. 6/2669 useless extension candidates. Maximal degree in co-relation 16337. Up to 2359 conditions per place. [2024-06-03 22:08:04,212 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 136 selfloop transitions, 35 changer transitions 0/176 dead transitions. [2024-06-03 22:08:04,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 176 transitions, 1920 flow [2024-06-03 22:08:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:08:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:08:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 22:08:04,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:08:04,213 INFO L175 Difference]: Start difference. First operand has 135 places, 154 transitions, 1402 flow. Second operand 7 states and 133 transitions. [2024-06-03 22:08:04,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 176 transitions, 1920 flow [2024-06-03 22:08:04,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 176 transitions, 1864 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 22:08:04,275 INFO L231 Difference]: Finished difference. Result has 139 places, 157 transitions, 1483 flow [2024-06-03 22:08:04,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1483, PETRI_PLACES=139, PETRI_TRANSITIONS=157} [2024-06-03 22:08:04,275 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2024-06-03 22:08:04,275 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 157 transitions, 1483 flow [2024-06-03 22:08:04,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:04,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:04,276 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-03 22:08:04,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:08:04,276 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-03 22:08:04,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1666523670, now seen corresponding path program 1 times [2024-06-03 22:08:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:04,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175448137] [2024-06-03 22:08:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:04,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:15,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:15,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175448137] [2024-06-03 22:08:15,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175448137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:15,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:15,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:08:15,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537494085] [2024-06-03 22:08:15,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:15,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:08:15,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:08:15,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:08:15,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:08:15,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 157 transitions, 1483 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:15,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:15,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:08:15,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:16,582 INFO L124 PetriNetUnfolderBase]: 1635/2669 cut-off events. [2024-06-03 22:08:16,582 INFO L125 PetriNetUnfolderBase]: For 73295/73295 co-relation queries the response was YES. [2024-06-03 22:08:16,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16615 conditions, 2669 events. 1635/2669 cut-off events. For 73295/73295 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14661 event pairs, 430 based on Foata normal form. 1/2669 useless extension candidates. Maximal degree in co-relation 16552. Up to 2491 conditions per place. [2024-06-03 22:08:16,602 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 155 selfloop transitions, 17 changer transitions 0/177 dead transitions. [2024-06-03 22:08:16,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 177 transitions, 1935 flow [2024-06-03 22:08:16,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:08:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:08:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-03 22:08:16,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-03 22:08:16,604 INFO L175 Difference]: Start difference. First operand has 139 places, 157 transitions, 1483 flow. Second operand 8 states and 138 transitions. [2024-06-03 22:08:16,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 177 transitions, 1935 flow [2024-06-03 22:08:16,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 177 transitions, 1854 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-03 22:08:16,665 INFO L231 Difference]: Finished difference. Result has 143 places, 160 transitions, 1514 flow [2024-06-03 22:08:16,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1514, PETRI_PLACES=143, PETRI_TRANSITIONS=160} [2024-06-03 22:08:16,665 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2024-06-03 22:08:16,665 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 160 transitions, 1514 flow [2024-06-03 22:08:16,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:16,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:16,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-03 22:08:16,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:08:16,666 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-03 22:08:16,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1666524073, now seen corresponding path program 2 times [2024-06-03 22:08:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:16,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963847753] [2024-06-03 22:08:16,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:16,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:26,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963847753] [2024-06-03 22:08:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963847753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:26,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:26,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:08:26,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702210285] [2024-06-03 22:08:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:26,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:08:26,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:26,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:08:26,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:08:26,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:08:26,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 160 transitions, 1514 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:26,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:26,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:08:26,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:27,473 INFO L124 PetriNetUnfolderBase]: 1694/2762 cut-off events. [2024-06-03 22:08:27,473 INFO L125 PetriNetUnfolderBase]: For 81270/81273 co-relation queries the response was YES. [2024-06-03 22:08:27,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17599 conditions, 2762 events. 1694/2762 cut-off events. For 81270/81273 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15295 event pairs, 427 based on Foata normal form. 5/2765 useless extension candidates. Maximal degree in co-relation 17535. Up to 2365 conditions per place. [2024-06-03 22:08:27,495 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 142 selfloop transitions, 44 changer transitions 0/191 dead transitions. [2024-06-03 22:08:27,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 191 transitions, 2278 flow [2024-06-03 22:08:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:08:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:08:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 22:08:27,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-03 22:08:27,496 INFO L175 Difference]: Start difference. First operand has 143 places, 160 transitions, 1514 flow. Second operand 8 states and 151 transitions. [2024-06-03 22:08:27,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 191 transitions, 2278 flow [2024-06-03 22:08:27,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 191 transitions, 2188 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-03 22:08:27,556 INFO L231 Difference]: Finished difference. Result has 146 places, 168 transitions, 1700 flow [2024-06-03 22:08:27,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1700, PETRI_PLACES=146, PETRI_TRANSITIONS=168} [2024-06-03 22:08:27,556 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2024-06-03 22:08:27,556 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 168 transitions, 1700 flow [2024-06-03 22:08:27,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:27,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:27,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:08:27,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:08:27,557 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:08:27,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:27,557 INFO L85 PathProgramCache]: Analyzing trace with hash 484593443, now seen corresponding path program 3 times [2024-06-03 22:08:27,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:27,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809207389] [2024-06-03 22:08:27,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:27,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809207389] [2024-06-03 22:08:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809207389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:37,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:37,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:08:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328821268] [2024-06-03 22:08:37,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:37,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:08:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:08:37,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:08:37,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:08:37,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 168 transitions, 1700 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:37,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:37,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:08:37,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:38,212 INFO L124 PetriNetUnfolderBase]: 1705/2780 cut-off events. [2024-06-03 22:08:38,213 INFO L125 PetriNetUnfolderBase]: For 88790/88793 co-relation queries the response was YES. [2024-06-03 22:08:38,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18444 conditions, 2780 events. 1705/2780 cut-off events. For 88790/88793 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15455 event pairs, 432 based on Foata normal form. 5/2783 useless extension candidates. Maximal degree in co-relation 18378. Up to 2378 conditions per place. [2024-06-03 22:08:38,235 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 140 selfloop transitions, 48 changer transitions 0/193 dead transitions. [2024-06-03 22:08:38,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 193 transitions, 2303 flow [2024-06-03 22:08:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:08:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:08:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 22:08:38,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-03 22:08:38,237 INFO L175 Difference]: Start difference. First operand has 146 places, 168 transitions, 1700 flow. Second operand 8 states and 151 transitions. [2024-06-03 22:08:38,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 193 transitions, 2303 flow [2024-06-03 22:08:38,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 193 transitions, 2171 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-03 22:08:38,305 INFO L231 Difference]: Finished difference. Result has 150 places, 172 transitions, 1764 flow [2024-06-03 22:08:38,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1764, PETRI_PLACES=150, PETRI_TRANSITIONS=172} [2024-06-03 22:08:38,305 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2024-06-03 22:08:38,305 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 172 transitions, 1764 flow [2024-06-03 22:08:38,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:38,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:38,306 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-03 22:08:38,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:08:38,306 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-03 22:08:38,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:38,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1276748040, now seen corresponding path program 3 times [2024-06-03 22:08:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:38,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381638273] [2024-06-03 22:08:38,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:49,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381638273] [2024-06-03 22:08:49,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381638273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:49,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:49,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:08:49,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077713158] [2024-06-03 22:08:49,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:49,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:08:49,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:49,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:08:49,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:08:49,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:08:49,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 172 transitions, 1764 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:49,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:49,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:08:49,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:50,044 INFO L124 PetriNetUnfolderBase]: 1691/2764 cut-off events. [2024-06-03 22:08:50,044 INFO L125 PetriNetUnfolderBase]: For 91631/91631 co-relation queries the response was YES. [2024-06-03 22:08:50,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18381 conditions, 2764 events. 1691/2764 cut-off events. For 91631/91631 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15512 event pairs, 795 based on Foata normal form. 2/2764 useless extension candidates. Maximal degree in co-relation 18313. Up to 2569 conditions per place. [2024-06-03 22:08:50,067 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 169 selfloop transitions, 16 changer transitions 0/190 dead transitions. [2024-06-03 22:08:50,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 190 transitions, 2195 flow [2024-06-03 22:08:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:08:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:08:50,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 22:08:50,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:08:50,068 INFO L175 Difference]: Start difference. First operand has 150 places, 172 transitions, 1764 flow. Second operand 8 states and 136 transitions. [2024-06-03 22:08:50,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 190 transitions, 2195 flow [2024-06-03 22:08:50,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 190 transitions, 2045 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-03 22:08:50,140 INFO L231 Difference]: Finished difference. Result has 154 places, 174 transitions, 1672 flow [2024-06-03 22:08:50,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1672, PETRI_PLACES=154, PETRI_TRANSITIONS=174} [2024-06-03 22:08:50,140 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-06-03 22:08:50,141 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 174 transitions, 1672 flow [2024-06-03 22:08:50,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:50,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:50,141 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-03 22:08:50,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:08:50,141 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:08:50,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash -464707862, now seen corresponding path program 4 times [2024-06-03 22:08:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:50,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091877310] [2024-06-03 22:08:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091877310] [2024-06-03 22:08:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091877310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:59,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:59,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:08:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599107774] [2024-06-03 22:08:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:59,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:08:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:59,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:08:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:08:59,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:08:59,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 174 transitions, 1672 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:59,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:59,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:08:59,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:00,956 INFO L124 PetriNetUnfolderBase]: 1701/2772 cut-off events. [2024-06-03 22:09:00,956 INFO L125 PetriNetUnfolderBase]: For 94343/94343 co-relation queries the response was YES. [2024-06-03 22:09:00,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18344 conditions, 2772 events. 1701/2772 cut-off events. For 94343/94343 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15411 event pairs, 438 based on Foata normal form. 2/2772 useless extension candidates. Maximal degree in co-relation 18274. Up to 2495 conditions per place. [2024-06-03 22:09:00,976 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 163 selfloop transitions, 35 changer transitions 0/203 dead transitions. [2024-06-03 22:09:00,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 203 transitions, 2203 flow [2024-06-03 22:09:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:09:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:09:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-03 22:09:00,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-03 22:09:00,978 INFO L175 Difference]: Start difference. First operand has 154 places, 174 transitions, 1672 flow. Second operand 9 states and 165 transitions. [2024-06-03 22:09:00,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 203 transitions, 2203 flow [2024-06-03 22:09:01,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 203 transitions, 2077 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-03 22:09:01,047 INFO L231 Difference]: Finished difference. Result has 154 places, 178 transitions, 1702 flow [2024-06-03 22:09:01,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1702, PETRI_PLACES=154, PETRI_TRANSITIONS=178} [2024-06-03 22:09:01,048 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-06-03 22:09:01,048 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 178 transitions, 1702 flow [2024-06-03 22:09:01,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:01,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:01,048 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-03 22:09:01,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:09:01,048 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-03 22:09:01,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash 725688042, now seen corresponding path program 5 times [2024-06-03 22:09:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:01,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246399538] [2024-06-03 22:09:01,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:01,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:10,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:10,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246399538] [2024-06-03 22:09:10,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246399538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:10,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:10,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:09:10,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689696718] [2024-06-03 22:09:10,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:10,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:09:10,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:10,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:09:10,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:09:10,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:09:10,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 178 transitions, 1702 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:10,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:10,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:09:10,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:11,927 INFO L124 PetriNetUnfolderBase]: 1705/2787 cut-off events. [2024-06-03 22:09:11,927 INFO L125 PetriNetUnfolderBase]: For 98824/98827 co-relation queries the response was YES. [2024-06-03 22:09:11,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18535 conditions, 2787 events. 1705/2787 cut-off events. For 98824/98827 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15609 event pairs, 445 based on Foata normal form. 6/2790 useless extension candidates. Maximal degree in co-relation 18463. Up to 2399 conditions per place. [2024-06-03 22:09:11,950 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 142 selfloop transitions, 54 changer transitions 0/201 dead transitions. [2024-06-03 22:09:11,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 201 transitions, 2288 flow [2024-06-03 22:09:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:09:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:09:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 22:09:11,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-03 22:09:11,951 INFO L175 Difference]: Start difference. First operand has 154 places, 178 transitions, 1702 flow. Second operand 8 states and 151 transitions. [2024-06-03 22:09:11,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 201 transitions, 2288 flow [2024-06-03 22:09:12,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 201 transitions, 2199 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-03 22:09:12,036 INFO L231 Difference]: Finished difference. Result has 156 places, 181 transitions, 1783 flow [2024-06-03 22:09:12,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1783, PETRI_PLACES=156, PETRI_TRANSITIONS=181} [2024-06-03 22:09:12,037 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-03 22:09:12,037 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 181 transitions, 1783 flow [2024-06-03 22:09:12,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:12,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:12,037 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-03 22:09:12,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:09:12,038 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-03 22:09:12,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:12,038 INFO L85 PathProgramCache]: Analyzing trace with hash -320817332, now seen corresponding path program 6 times [2024-06-03 22:09:12,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:12,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098949347] [2024-06-03 22:09:12,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:12,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:21,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:21,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098949347] [2024-06-03 22:09:21,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098949347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:21,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:21,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:09:21,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014945439] [2024-06-03 22:09:21,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:21,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:09:21,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:21,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:09:21,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:09:21,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:09:21,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 181 transitions, 1783 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:21,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:21,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:09:21,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:22,832 INFO L124 PetriNetUnfolderBase]: 1695/2771 cut-off events. [2024-06-03 22:09:22,832 INFO L125 PetriNetUnfolderBase]: For 100332/100335 co-relation queries the response was YES. [2024-06-03 22:09:22,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18528 conditions, 2771 events. 1695/2771 cut-off events. For 100332/100335 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15484 event pairs, 449 based on Foata normal form. 4/2772 useless extension candidates. Maximal degree in co-relation 18455. Up to 2391 conditions per place. [2024-06-03 22:09:22,856 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 137 selfloop transitions, 58 changer transitions 0/200 dead transitions. [2024-06-03 22:09:22,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 200 transitions, 2239 flow [2024-06-03 22:09:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:09:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:09:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 22:09:22,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-03 22:09:22,858 INFO L175 Difference]: Start difference. First operand has 156 places, 181 transitions, 1783 flow. Second operand 8 states and 149 transitions. [2024-06-03 22:09:22,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 200 transitions, 2239 flow [2024-06-03 22:09:22,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 200 transitions, 2087 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-03 22:09:22,950 INFO L231 Difference]: Finished difference. Result has 159 places, 181 transitions, 1753 flow [2024-06-03 22:09:22,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1753, PETRI_PLACES=159, PETRI_TRANSITIONS=181} [2024-06-03 22:09:22,951 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places. [2024-06-03 22:09:22,951 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 181 transitions, 1753 flow [2024-06-03 22:09:22,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:22,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:22,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:22,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:09:22,951 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:09:22,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1351036980, now seen corresponding path program 2 times [2024-06-03 22:09:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:22,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763296095] [2024-06-03 22:09:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:33,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:33,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763296095] [2024-06-03 22:09:33,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763296095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:33,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:33,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:09:33,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860621454] [2024-06-03 22:09:33,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:33,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:09:33,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:33,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:09:33,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:09:33,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:09:33,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 181 transitions, 1753 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:33,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:33,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:09:33,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:34,602 INFO L124 PetriNetUnfolderBase]: 1700/2770 cut-off events. [2024-06-03 22:09:34,602 INFO L125 PetriNetUnfolderBase]: For 103290/103298 co-relation queries the response was YES. [2024-06-03 22:09:34,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18622 conditions, 2770 events. 1700/2770 cut-off events. For 103290/103298 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15346 event pairs, 439 based on Foata normal form. 9/2778 useless extension candidates. Maximal degree in co-relation 18548. Up to 2567 conditions per place. [2024-06-03 22:09:34,624 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 165 selfloop transitions, 31 changer transitions 0/201 dead transitions. [2024-06-03 22:09:34,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 201 transitions, 2267 flow [2024-06-03 22:09:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:09:34,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:09:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-03 22:09:34,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-03 22:09:34,626 INFO L175 Difference]: Start difference. First operand has 159 places, 181 transitions, 1753 flow. Second operand 9 states and 155 transitions. [2024-06-03 22:09:34,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 201 transitions, 2267 flow [2024-06-03 22:09:34,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 201 transitions, 2097 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 22:09:34,713 INFO L231 Difference]: Finished difference. Result has 159 places, 184 transitions, 1735 flow [2024-06-03 22:09:34,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1735, PETRI_PLACES=159, PETRI_TRANSITIONS=184} [2024-06-03 22:09:34,713 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places. [2024-06-03 22:09:34,714 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 184 transitions, 1735 flow [2024-06-03 22:09:34,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:34,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:34,714 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-03 22:09:34,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:09:34,714 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:09:34,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash 738582988, now seen corresponding path program 3 times [2024-06-03 22:09:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822789211] [2024-06-03 22:09:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:34,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:45,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:45,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822789211] [2024-06-03 22:09:45,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822789211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:45,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:45,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:09:45,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946221296] [2024-06-03 22:09:45,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:45,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:09:45,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:45,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:09:45,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:09:45,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:09:45,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 184 transitions, 1735 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:45,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:45,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:09:45,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:46,286 INFO L124 PetriNetUnfolderBase]: 1705/2782 cut-off events. [2024-06-03 22:09:46,286 INFO L125 PetriNetUnfolderBase]: For 108549/108549 co-relation queries the response was YES. [2024-06-03 22:09:46,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18754 conditions, 2782 events. 1705/2782 cut-off events. For 108549/108549 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15594 event pairs, 794 based on Foata normal form. 1/2781 useless extension candidates. Maximal degree in co-relation 18681. Up to 2601 conditions per place. [2024-06-03 22:09:46,309 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 174 selfloop transitions, 18 changer transitions 0/197 dead transitions. [2024-06-03 22:09:46,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 197 transitions, 2227 flow [2024-06-03 22:09:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:09:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:09:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-03 22:09:46,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-03 22:09:46,311 INFO L175 Difference]: Start difference. First operand has 159 places, 184 transitions, 1735 flow. Second operand 8 states and 132 transitions. [2024-06-03 22:09:46,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 197 transitions, 2227 flow [2024-06-03 22:09:46,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 197 transitions, 2097 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-03 22:09:46,411 INFO L231 Difference]: Finished difference. Result has 160 places, 187 transitions, 1737 flow [2024-06-03 22:09:46,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1737, PETRI_PLACES=160, PETRI_TRANSITIONS=187} [2024-06-03 22:09:46,411 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places. [2024-06-03 22:09:46,411 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 187 transitions, 1737 flow [2024-06-03 22:09:46,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:46,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:46,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:09:46,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:09:46,412 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:09:46,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash 725684415, now seen corresponding path program 4 times [2024-06-03 22:09:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806109456] [2024-06-03 22:09:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:56,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-03 22:09:56,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:56,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806109456] [2024-06-03 22:09:56,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806109456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:56,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:56,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:09:56,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978673436] [2024-06-03 22:09:56,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:56,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:09:56,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:56,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:09:56,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:09:56,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:09:56,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 187 transitions, 1737 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:56,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:56,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:09:56,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:57,536 INFO L124 PetriNetUnfolderBase]: 1752/2842 cut-off events. [2024-06-03 22:09:57,536 INFO L125 PetriNetUnfolderBase]: For 121033/121036 co-relation queries the response was YES. [2024-06-03 22:09:57,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19682 conditions, 2842 events. 1752/2842 cut-off events. For 121033/121036 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15809 event pairs, 455 based on Foata normal form. 5/2844 useless extension candidates. Maximal degree in co-relation 19608. Up to 2285 conditions per place. [2024-06-03 22:09:57,557 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 138 selfloop transitions, 80 changer transitions 0/223 dead transitions. [2024-06-03 22:09:57,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 223 transitions, 2775 flow [2024-06-03 22:09:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:09:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:09:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-03 22:09:57,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46612466124661245 [2024-06-03 22:09:57,558 INFO L175 Difference]: Start difference. First operand has 160 places, 187 transitions, 1737 flow. Second operand 9 states and 172 transitions. [2024-06-03 22:09:57,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 223 transitions, 2775 flow [2024-06-03 22:09:57,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 223 transitions, 2665 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-03 22:09:57,642 INFO L231 Difference]: Finished difference. Result has 164 places, 199 transitions, 2103 flow [2024-06-03 22:09:57,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2103, PETRI_PLACES=164, PETRI_TRANSITIONS=199} [2024-06-03 22:09:57,643 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 122 predicate places. [2024-06-03 22:09:57,643 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 199 transitions, 2103 flow [2024-06-03 22:09:57,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:57,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:57,643 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-03 22:09:57,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:09:57,643 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:09:57,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash 725695575, now seen corresponding path program 5 times [2024-06-03 22:09:57,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:57,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157848858] [2024-06-03 22:09:57,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:57,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:07,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:07,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157848858] [2024-06-03 22:10:07,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157848858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:07,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:07,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:10:07,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609783614] [2024-06-03 22:10:07,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:07,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:10:07,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:07,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:10:07,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:10:07,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:10:07,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 199 transitions, 2103 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:07,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:07,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:10:07,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:08,539 INFO L124 PetriNetUnfolderBase]: 1803/2925 cut-off events. [2024-06-03 22:10:08,540 INFO L125 PetriNetUnfolderBase]: For 133031/133034 co-relation queries the response was YES. [2024-06-03 22:10:08,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21408 conditions, 2925 events. 1803/2925 cut-off events. For 133031/133034 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16346 event pairs, 457 based on Foata normal form. 5/2927 useless extension candidates. Maximal degree in co-relation 21332. Up to 2328 conditions per place. [2024-06-03 22:10:08,565 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 143 selfloop transitions, 83 changer transitions 0/231 dead transitions. [2024-06-03 22:10:08,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 231 transitions, 3090 flow [2024-06-03 22:10:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:10:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:10:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-03 22:10:08,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46612466124661245 [2024-06-03 22:10:08,567 INFO L175 Difference]: Start difference. First operand has 164 places, 199 transitions, 2103 flow. Second operand 9 states and 172 transitions. [2024-06-03 22:10:08,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 231 transitions, 3090 flow [2024-06-03 22:10:08,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 231 transitions, 2851 flow, removed 73 selfloop flow, removed 5 redundant places. [2024-06-03 22:10:08,689 INFO L231 Difference]: Finished difference. Result has 169 places, 207 transitions, 2258 flow [2024-06-03 22:10:08,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2258, PETRI_PLACES=169, PETRI_TRANSITIONS=207} [2024-06-03 22:10:08,690 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places. [2024-06-03 22:10:08,690 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 207 transitions, 2258 flow [2024-06-03 22:10:08,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:08,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:08,690 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-03 22:10:08,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:10:08,690 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:10:08,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:08,691 INFO L85 PathProgramCache]: Analyzing trace with hash 738582585, now seen corresponding path program 6 times [2024-06-03 22:10:08,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:08,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621455386] [2024-06-03 22:10:08,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:18,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:18,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621455386] [2024-06-03 22:10:18,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621455386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:18,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:18,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:18,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070866274] [2024-06-03 22:10:18,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:18,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:18,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:18,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:18,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:10:18,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 207 transitions, 2258 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:18,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:18,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:10:18,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:19,408 INFO L124 PetriNetUnfolderBase]: 1798/2935 cut-off events. [2024-06-03 22:10:19,408 INFO L125 PetriNetUnfolderBase]: For 132690/132693 co-relation queries the response was YES. [2024-06-03 22:10:19,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20970 conditions, 2935 events. 1798/2935 cut-off events. For 132690/132693 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16731 event pairs, 801 based on Foata normal form. 5/2937 useless extension candidates. Maximal degree in co-relation 20892. Up to 2655 conditions per place. [2024-06-03 22:10:19,433 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 183 selfloop transitions, 34 changer transitions 0/222 dead transitions. [2024-06-03 22:10:19,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 222 transitions, 2836 flow [2024-06-03 22:10:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 22:10:19,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-03 22:10:19,434 INFO L175 Difference]: Start difference. First operand has 169 places, 207 transitions, 2258 flow. Second operand 8 states and 143 transitions. [2024-06-03 22:10:19,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 222 transitions, 2836 flow [2024-06-03 22:10:19,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 222 transitions, 2563 flow, removed 76 selfloop flow, removed 5 redundant places. [2024-06-03 22:10:19,543 INFO L231 Difference]: Finished difference. Result has 172 places, 207 transitions, 2061 flow [2024-06-03 22:10:19,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2061, PETRI_PLACES=172, PETRI_TRANSITIONS=207} [2024-06-03 22:10:19,544 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places. [2024-06-03 22:10:19,544 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 207 transitions, 2061 flow [2024-06-03 22:10:19,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:19,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:19,544 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-03 22:10:19,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:10:19,545 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-03 22:10:19,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 739028458, now seen corresponding path program 4 times [2024-06-03 22:10:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:19,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966031736] [2024-06-03 22:10:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:29,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:29,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966031736] [2024-06-03 22:10:29,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966031736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:29,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:29,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:29,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873314786] [2024-06-03 22:10:29,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:29,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:29,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:29,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:29,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:29,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:10:29,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 207 transitions, 2061 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:29,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:29,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:10:29,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:30,944 INFO L124 PetriNetUnfolderBase]: 1795/2926 cut-off events. [2024-06-03 22:10:30,945 INFO L125 PetriNetUnfolderBase]: For 135184/135184 co-relation queries the response was YES. [2024-06-03 22:10:30,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20515 conditions, 2926 events. 1795/2926 cut-off events. For 135184/135184 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16603 event pairs, 809 based on Foata normal form. 1/2925 useless extension candidates. Maximal degree in co-relation 20436. Up to 2721 conditions per place. [2024-06-03 22:10:30,969 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 192 selfloop transitions, 24 changer transitions 0/221 dead transitions. [2024-06-03 22:10:30,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 221 transitions, 2611 flow [2024-06-03 22:10:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:10:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:10:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-03 22:10:30,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3956639566395664 [2024-06-03 22:10:30,970 INFO L175 Difference]: Start difference. First operand has 172 places, 207 transitions, 2061 flow. Second operand 9 states and 146 transitions. [2024-06-03 22:10:30,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 221 transitions, 2611 flow [2024-06-03 22:10:31,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 221 transitions, 2395 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-03 22:10:31,086 INFO L231 Difference]: Finished difference. Result has 171 places, 210 transitions, 2001 flow [2024-06-03 22:10:31,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2001, PETRI_PLACES=171, PETRI_TRANSITIONS=210} [2024-06-03 22:10:31,086 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-03 22:10:31,086 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 210 transitions, 2001 flow [2024-06-03 22:10:31,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:31,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:31,086 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-03 22:10:31,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:10:31,086 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-03 22:10:31,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash -464693974, now seen corresponding path program 1 times [2024-06-03 22:10:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:31,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505609185] [2024-06-03 22:10:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:41,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505609185] [2024-06-03 22:10:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505609185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221856285] [2024-06-03 22:10:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:41,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:41,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:10:41,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 210 transitions, 2001 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:41,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:41,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:10:41,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:42,960 INFO L124 PetriNetUnfolderBase]: 1805/2942 cut-off events. [2024-06-03 22:10:42,961 INFO L125 PetriNetUnfolderBase]: For 141388/141388 co-relation queries the response was YES. [2024-06-03 22:10:42,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20461 conditions, 2942 events. 1805/2942 cut-off events. For 141388/141388 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16690 event pairs, 804 based on Foata normal form. 2/2942 useless extension candidates. Maximal degree in co-relation 20385. Up to 2724 conditions per place. [2024-06-03 22:10:42,986 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 205 selfloop transitions, 19 changer transitions 0/229 dead transitions. [2024-06-03 22:10:42,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 229 transitions, 2555 flow [2024-06-03 22:10:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-03 22:10:42,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-03 22:10:42,988 INFO L175 Difference]: Start difference. First operand has 171 places, 210 transitions, 2001 flow. Second operand 8 states and 138 transitions. [2024-06-03 22:10:42,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 229 transitions, 2555 flow [2024-06-03 22:10:43,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 229 transitions, 2435 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-03 22:10:43,103 INFO L231 Difference]: Finished difference. Result has 172 places, 214 transitions, 1992 flow [2024-06-03 22:10:43,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1992, PETRI_PLACES=172, PETRI_TRANSITIONS=214} [2024-06-03 22:10:43,104 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places. [2024-06-03 22:10:43,104 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 214 transitions, 1992 flow [2024-06-03 22:10:43,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:43,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:43,105 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-03 22:10:43,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:10:43,105 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-03 22:10:43,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash 731415850, now seen corresponding path program 2 times [2024-06-03 22:10:43,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:43,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081648564] [2024-06-03 22:10:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:10:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081648564] [2024-06-03 22:10:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081648564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:53,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:53,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:10:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507507477] [2024-06-03 22:10:53,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:53,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:10:53,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:53,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:10:53,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:10:53,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:10:53,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 214 transitions, 1992 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:53,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:53,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:10:53,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:54,289 INFO L124 PetriNetUnfolderBase]: 1815/2963 cut-off events. [2024-06-03 22:10:54,289 INFO L125 PetriNetUnfolderBase]: For 145671/145674 co-relation queries the response was YES. [2024-06-03 22:10:54,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21006 conditions, 2963 events. 1815/2963 cut-off events. For 145671/145674 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16911 event pairs, 804 based on Foata normal form. 3/2963 useless extension candidates. Maximal degree in co-relation 20929. Up to 2734 conditions per place. [2024-06-03 22:10:54,317 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 207 selfloop transitions, 28 changer transitions 0/240 dead transitions. [2024-06-03 22:10:54,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 240 transitions, 2645 flow [2024-06-03 22:10:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:10:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:10:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 22:10:54,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:10:54,318 INFO L175 Difference]: Start difference. First operand has 172 places, 214 transitions, 1992 flow. Second operand 8 states and 136 transitions. [2024-06-03 22:10:54,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 240 transitions, 2645 flow [2024-06-03 22:10:54,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 240 transitions, 2544 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-03 22:10:54,446 INFO L231 Difference]: Finished difference. Result has 176 places, 229 transitions, 2143 flow [2024-06-03 22:10:54,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2143, PETRI_PLACES=176, PETRI_TRANSITIONS=229} [2024-06-03 22:10:54,447 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 134 predicate places. [2024-06-03 22:10:54,447 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 229 transitions, 2143 flow [2024-06-03 22:10:54,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:54,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:54,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:10:54,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:10:54,447 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-03 22:10:54,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash 739034410, now seen corresponding path program 3 times [2024-06-03 22:10:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300229835] [2024-06-03 22:10:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:05,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300229835] [2024-06-03 22:11:05,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300229835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:05,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:05,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:05,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862866598] [2024-06-03 22:11:05,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:05,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:05,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:05,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:05,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:05,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:11:05,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 229 transitions, 2143 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:05,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:05,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:11:05,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:06,322 INFO L124 PetriNetUnfolderBase]: 1828/2977 cut-off events. [2024-06-03 22:11:06,322 INFO L125 PetriNetUnfolderBase]: For 152689/152692 co-relation queries the response was YES. [2024-06-03 22:11:06,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21576 conditions, 2977 events. 1828/2977 cut-off events. For 152689/152692 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16910 event pairs, 804 based on Foata normal form. 3/2977 useless extension candidates. Maximal degree in co-relation 21496. Up to 2714 conditions per place. [2024-06-03 22:11:06,349 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 194 selfloop transitions, 50 changer transitions 0/249 dead transitions. [2024-06-03 22:11:06,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 249 transitions, 2901 flow [2024-06-03 22:11:06,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:11:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:11:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-03 22:11:06,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-03 22:11:06,352 INFO L175 Difference]: Start difference. First operand has 176 places, 229 transitions, 2143 flow. Second operand 8 states and 140 transitions. [2024-06-03 22:11:06,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 249 transitions, 2901 flow [2024-06-03 22:11:06,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 249 transitions, 2812 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-06-03 22:11:06,500 INFO L231 Difference]: Finished difference. Result has 183 places, 236 transitions, 2328 flow [2024-06-03 22:11:06,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2328, PETRI_PLACES=183, PETRI_TRANSITIONS=236} [2024-06-03 22:11:06,500 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2024-06-03 22:11:06,500 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 236 transitions, 2328 flow [2024-06-03 22:11:06,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:06,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:06,501 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-03 22:11:06,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:11:06,501 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-03 22:11:06,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 738767500, now seen corresponding path program 4 times [2024-06-03 22:11:06,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:06,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804086898] [2024-06-03 22:11:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:06,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:17,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:17,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804086898] [2024-06-03 22:11:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804086898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174854082] [2024-06-03 22:11:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:17,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:17,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:17,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:17,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:11:17,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 236 transitions, 2328 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:17,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:17,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:11:17,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:18,960 INFO L124 PetriNetUnfolderBase]: 1835/2991 cut-off events. [2024-06-03 22:11:18,960 INFO L125 PetriNetUnfolderBase]: For 160717/160720 co-relation queries the response was YES. [2024-06-03 22:11:18,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22197 conditions, 2991 events. 1835/2991 cut-off events. For 160717/160720 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 17051 event pairs, 804 based on Foata normal form. 4/2992 useless extension candidates. Maximal degree in co-relation 22114. Up to 2740 conditions per place. [2024-06-03 22:11:18,987 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 208 selfloop transitions, 41 changer transitions 0/254 dead transitions. [2024-06-03 22:11:18,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 254 transitions, 2960 flow [2024-06-03 22:11:18,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:11:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:11:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 22:11:18,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-03 22:11:18,990 INFO L175 Difference]: Start difference. First operand has 183 places, 236 transitions, 2328 flow. Second operand 8 states and 139 transitions. [2024-06-03 22:11:18,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 254 transitions, 2960 flow [2024-06-03 22:11:19,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 254 transitions, 2847 flow, removed 35 selfloop flow, removed 4 redundant places. [2024-06-03 22:11:19,129 INFO L231 Difference]: Finished difference. Result has 187 places, 242 transitions, 2411 flow [2024-06-03 22:11:19,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2411, PETRI_PLACES=187, PETRI_TRANSITIONS=242} [2024-06-03 22:11:19,129 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 145 predicate places. [2024-06-03 22:11:19,129 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 242 transitions, 2411 flow [2024-06-03 22:11:19,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:19,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:19,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:19,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:11:19,130 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-03 22:11:19,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1699819182, now seen corresponding path program 1 times [2024-06-03 22:11:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:19,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727761567] [2024-06-03 22:11:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:28,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:28,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727761567] [2024-06-03 22:11:28,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727761567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:28,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:28,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:28,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991707100] [2024-06-03 22:11:28,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:28,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:28,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:28,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:28,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:28,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:11:28,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 242 transitions, 2411 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:28,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:28,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:11:28,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:29,578 INFO L124 PetriNetUnfolderBase]: 1900/3101 cut-off events. [2024-06-03 22:11:29,578 INFO L125 PetriNetUnfolderBase]: For 175518/175527 co-relation queries the response was YES. [2024-06-03 22:11:29,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22715 conditions, 3101 events. 1900/3101 cut-off events. For 175518/175527 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 17585 event pairs, 349 based on Foata normal form. 18/3117 useless extension candidates. Maximal degree in co-relation 22630. Up to 2707 conditions per place. [2024-06-03 22:11:29,604 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 249 selfloop transitions, 31 changer transitions 0/285 dead transitions. [2024-06-03 22:11:29,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 285 transitions, 3197 flow [2024-06-03 22:11:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-03 22:11:29,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-03 22:11:29,606 INFO L175 Difference]: Start difference. First operand has 187 places, 242 transitions, 2411 flow. Second operand 9 states and 174 transitions. [2024-06-03 22:11:29,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 285 transitions, 3197 flow [2024-06-03 22:11:29,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 285 transitions, 3073 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-03 22:11:29,806 INFO L231 Difference]: Finished difference. Result has 193 places, 251 transitions, 2487 flow [2024-06-03 22:11:29,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2287, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2487, PETRI_PLACES=193, PETRI_TRANSITIONS=251} [2024-06-03 22:11:29,806 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2024-06-03 22:11:29,806 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 251 transitions, 2487 flow [2024-06-03 22:11:29,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:29,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:29,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:29,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:11:29,807 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-03 22:11:29,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:29,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2034178704, now seen corresponding path program 2 times [2024-06-03 22:11:29,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:29,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626794826] [2024-06-03 22:11:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:39,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626794826] [2024-06-03 22:11:39,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626794826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:39,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:39,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095836357] [2024-06-03 22:11:39,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:39,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:39,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:39,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:39,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:11:39,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 251 transitions, 2487 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:39,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:39,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:11:39,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:40,405 INFO L124 PetriNetUnfolderBase]: 2112/3448 cut-off events. [2024-06-03 22:11:40,405 INFO L125 PetriNetUnfolderBase]: For 187660/187669 co-relation queries the response was YES. [2024-06-03 22:11:40,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25448 conditions, 3448 events. 2112/3448 cut-off events. For 187660/187669 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19823 event pairs, 489 based on Foata normal form. 16/3457 useless extension candidates. Maximal degree in co-relation 25360. Up to 2949 conditions per place. [2024-06-03 22:11:40,438 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 262 selfloop transitions, 45 changer transitions 0/312 dead transitions. [2024-06-03 22:11:40,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 312 transitions, 3657 flow [2024-06-03 22:11:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-03 22:11:40,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-03 22:11:40,439 INFO L175 Difference]: Start difference. First operand has 193 places, 251 transitions, 2487 flow. Second operand 9 states and 174 transitions. [2024-06-03 22:11:40,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 312 transitions, 3657 flow [2024-06-03 22:11:40,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 312 transitions, 3464 flow, removed 71 selfloop flow, removed 4 redundant places. [2024-06-03 22:11:40,640 INFO L231 Difference]: Finished difference. Result has 202 places, 278 transitions, 2874 flow [2024-06-03 22:11:40,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2386, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2874, PETRI_PLACES=202, PETRI_TRANSITIONS=278} [2024-06-03 22:11:40,641 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-03 22:11:40,641 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 278 transitions, 2874 flow [2024-06-03 22:11:40,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:40,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:40,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:40,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:11:40,642 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:11:40,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2034565124, now seen corresponding path program 3 times [2024-06-03 22:11:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:40,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246050272] [2024-06-03 22:11:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:40,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:49,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:49,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246050272] [2024-06-03 22:11:49,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246050272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:49,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:49,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851946809] [2024-06-03 22:11:49,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:49,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:49,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:49,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:49,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:49,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:11:49,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 278 transitions, 2874 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:49,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:49,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:11:49,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:50,997 INFO L124 PetriNetUnfolderBase]: 2268/3707 cut-off events. [2024-06-03 22:11:50,997 INFO L125 PetriNetUnfolderBase]: For 192950/192959 co-relation queries the response was YES. [2024-06-03 22:11:51,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27377 conditions, 3707 events. 2268/3707 cut-off events. For 192950/192959 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21544 event pairs, 574 based on Foata normal form. 18/3723 useless extension candidates. Maximal degree in co-relation 27283. Up to 3171 conditions per place. [2024-06-03 22:11:51,035 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 269 selfloop transitions, 59 changer transitions 0/333 dead transitions. [2024-06-03 22:11:51,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 333 transitions, 3997 flow [2024-06-03 22:11:51,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:11:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:11:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-03 22:11:51,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742547425474255 [2024-06-03 22:11:51,042 INFO L175 Difference]: Start difference. First operand has 202 places, 278 transitions, 2874 flow. Second operand 9 states and 175 transitions. [2024-06-03 22:11:51,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 333 transitions, 3997 flow [2024-06-03 22:11:51,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 333 transitions, 3851 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-03 22:11:51,280 INFO L231 Difference]: Finished difference. Result has 209 places, 300 transitions, 3249 flow [2024-06-03 22:11:51,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2782, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3249, PETRI_PLACES=209, PETRI_TRANSITIONS=300} [2024-06-03 22:11:51,281 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places. [2024-06-03 22:11:51,281 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 300 transitions, 3249 flow [2024-06-03 22:11:51,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:51,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:51,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:51,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:11:51,281 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:11:51,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:51,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1888470164, now seen corresponding path program 4 times [2024-06-03 22:11:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:51,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225176621] [2024-06-03 22:11:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:00,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:00,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225176621] [2024-06-03 22:12:00,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225176621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:00,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:00,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:12:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949360213] [2024-06-03 22:12:00,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:00,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:12:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:12:00,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:12:00,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:12:00,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 300 transitions, 3249 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:00,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:00,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:12:00,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:01,985 INFO L124 PetriNetUnfolderBase]: 2327/3798 cut-off events. [2024-06-03 22:12:01,985 INFO L125 PetriNetUnfolderBase]: For 203207/203214 co-relation queries the response was YES. [2024-06-03 22:12:02,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28440 conditions, 3798 events. 2327/3798 cut-off events. For 203207/203214 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22129 event pairs, 631 based on Foata normal form. 18/3814 useless extension candidates. Maximal degree in co-relation 28344. Up to 3346 conditions per place. [2024-06-03 22:12:02,023 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 280 selfloop transitions, 51 changer transitions 0/336 dead transitions. [2024-06-03 22:12:02,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 336 transitions, 4164 flow [2024-06-03 22:12:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:12:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:12:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-03 22:12:02,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46883468834688347 [2024-06-03 22:12:02,024 INFO L175 Difference]: Start difference. First operand has 209 places, 300 transitions, 3249 flow. Second operand 9 states and 173 transitions. [2024-06-03 22:12:02,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 336 transitions, 4164 flow [2024-06-03 22:12:02,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 336 transitions, 4027 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-03 22:12:02,343 INFO L231 Difference]: Finished difference. Result has 214 places, 306 transitions, 3339 flow [2024-06-03 22:12:02,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3112, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3339, PETRI_PLACES=214, PETRI_TRANSITIONS=306} [2024-06-03 22:12:02,344 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places. [2024-06-03 22:12:02,344 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 306 transitions, 3339 flow [2024-06-03 22:12:02,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:02,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12: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, 1] [2024-06-03 22:12:02,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:12:02,344 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:12:02,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2024397682, now seen corresponding path program 1 times [2024-06-03 22:12:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120462150] [2024-06-03 22:12:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:12,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:12,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120462150] [2024-06-03 22:12:12,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120462150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:12,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:12,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:12,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965027039] [2024-06-03 22:12:12,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:12,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:12,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:12,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:12,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:13,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:12:13,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 306 transitions, 3339 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:13,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:13,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:12:13,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:14,325 INFO L124 PetriNetUnfolderBase]: 2357/3844 cut-off events. [2024-06-03 22:12:14,325 INFO L125 PetriNetUnfolderBase]: For 198580/198587 co-relation queries the response was YES. [2024-06-03 22:12:14,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28906 conditions, 3844 events. 2357/3844 cut-off events. For 198580/198587 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22446 event pairs, 639 based on Foata normal form. 9/3851 useless extension candidates. Maximal degree in co-relation 28808. Up to 3416 conditions per place. [2024-06-03 22:12:14,359 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 279 selfloop transitions, 58 changer transitions 0/342 dead transitions. [2024-06-03 22:12:14,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 342 transitions, 4281 flow [2024-06-03 22:12:14,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:12:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:12:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-03 22:12:14,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560975609756098 [2024-06-03 22:12:14,360 INFO L175 Difference]: Start difference. First operand has 214 places, 306 transitions, 3339 flow. Second operand 10 states and 187 transitions. [2024-06-03 22:12:14,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 342 transitions, 4281 flow [2024-06-03 22:12:14,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 342 transitions, 4135 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-03 22:12:14,625 INFO L231 Difference]: Finished difference. Result has 219 places, 315 transitions, 3492 flow [2024-06-03 22:12:14,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3193, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3492, PETRI_PLACES=219, PETRI_TRANSITIONS=315} [2024-06-03 22:12:14,625 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 177 predicate places. [2024-06-03 22:12:14,626 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 315 transitions, 3492 flow [2024-06-03 22:12:14,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:14,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:14,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:14,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:12:14,626 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-03 22:12:14,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:14,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2025607824, now seen corresponding path program 5 times [2024-06-03 22:12:14,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:14,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605728652] [2024-06-03 22:12:14,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:14,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605728652] [2024-06-03 22:12:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605728652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:24,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:24,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:12:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105743690] [2024-06-03 22:12:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:24,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:12:24,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:24,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:12:24,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:12:24,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:12:24,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 315 transitions, 3492 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:24,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:24,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:12:24,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:25,650 INFO L124 PetriNetUnfolderBase]: 2475/4026 cut-off events. [2024-06-03 22:12:25,651 INFO L125 PetriNetUnfolderBase]: For 220644/220651 co-relation queries the response was YES. [2024-06-03 22:12:25,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30603 conditions, 4026 events. 2475/4026 cut-off events. For 220644/220651 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 23652 event pairs, 575 based on Foata normal form. 18/4042 useless extension candidates. Maximal degree in co-relation 30503. Up to 3513 conditions per place. [2024-06-03 22:12:25,694 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 298 selfloop transitions, 53 changer transitions 0/356 dead transitions. [2024-06-03 22:12:25,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 356 transitions, 4539 flow [2024-06-03 22:12:25,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:12:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:12:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-03 22:12:25,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46612466124661245 [2024-06-03 22:12:25,696 INFO L175 Difference]: Start difference. First operand has 219 places, 315 transitions, 3492 flow. Second operand 9 states and 172 transitions. [2024-06-03 22:12:25,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 356 transitions, 4539 flow [2024-06-03 22:12:26,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 356 transitions, 4313 flow, removed 57 selfloop flow, removed 7 redundant places. [2024-06-03 22:12:26,007 INFO L231 Difference]: Finished difference. Result has 222 places, 327 transitions, 3603 flow [2024-06-03 22:12:26,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3273, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3603, PETRI_PLACES=222, PETRI_TRANSITIONS=327} [2024-06-03 22:12:26,007 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places. [2024-06-03 22:12:26,008 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 327 transitions, 3603 flow [2024-06-03 22:12:26,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:26,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:26,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:26,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:12:26,008 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-03 22:12:26,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1738720494, now seen corresponding path program 6 times [2024-06-03 22:12:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266232209] [2024-06-03 22:12:26,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:36,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266232209] [2024-06-03 22:12:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266232209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:12:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830201044] [2024-06-03 22:12:36,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:36,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:12:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:36,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:12:36,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:12:36,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:12:36,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 327 transitions, 3603 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:36,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:36,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:12:36,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:37,719 INFO L124 PetriNetUnfolderBase]: 2589/4223 cut-off events. [2024-06-03 22:12:37,719 INFO L125 PetriNetUnfolderBase]: For 231519/231522 co-relation queries the response was YES. [2024-06-03 22:12:37,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31955 conditions, 4223 events. 2589/4223 cut-off events. For 231519/231522 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25082 event pairs, 569 based on Foata normal form. 14/4235 useless extension candidates. Maximal degree in co-relation 31853. Up to 3660 conditions per place. [2024-06-03 22:12:37,764 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 305 selfloop transitions, 64 changer transitions 0/374 dead transitions. [2024-06-03 22:12:37,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 374 transitions, 4732 flow [2024-06-03 22:12:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:12:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:12:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-03 22:12:37,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070460704607047 [2024-06-03 22:12:37,765 INFO L175 Difference]: Start difference. First operand has 222 places, 327 transitions, 3603 flow. Second operand 9 states and 170 transitions. [2024-06-03 22:12:37,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 374 transitions, 4732 flow [2024-06-03 22:12:38,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 374 transitions, 4590 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-03 22:12:38,101 INFO L231 Difference]: Finished difference. Result has 227 places, 346 transitions, 3888 flow [2024-06-03 22:12:38,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3461, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3888, PETRI_PLACES=227, PETRI_TRANSITIONS=346} [2024-06-03 22:12:38,102 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 185 predicate places. [2024-06-03 22:12:38,102 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 346 transitions, 3888 flow [2024-06-03 22:12:38,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:38,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:38,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:38,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:12:38,102 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-03 22:12:38,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:38,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2020688750, now seen corresponding path program 1 times [2024-06-03 22:12:38,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:38,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509959083] [2024-06-03 22:12:38,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:38,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:12:48,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:48,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509959083] [2024-06-03 22:12:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509959083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:48,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:48,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:12:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361243750] [2024-06-03 22:12:48,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:48,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:12:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:48,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:12:48,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:12:48,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:12:48,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 346 transitions, 3888 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:48,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:48,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:12:48,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:50,327 INFO L124 PetriNetUnfolderBase]: 2667/4333 cut-off events. [2024-06-03 22:12:50,328 INFO L125 PetriNetUnfolderBase]: For 223389/223392 co-relation queries the response was YES. [2024-06-03 22:12:50,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33033 conditions, 4333 events. 2667/4333 cut-off events. For 223389/223392 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 25730 event pairs, 591 based on Foata normal form. 4/4335 useless extension candidates. Maximal degree in co-relation 32928. Up to 3833 conditions per place. [2024-06-03 22:12:50,372 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 334 selfloop transitions, 55 changer transitions 0/394 dead transitions. [2024-06-03 22:12:50,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 394 transitions, 5071 flow [2024-06-03 22:12:50,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:12:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:12:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-03 22:12:50,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:12:50,374 INFO L175 Difference]: Start difference. First operand has 227 places, 346 transitions, 3888 flow. Second operand 9 states and 171 transitions. [2024-06-03 22:12:50,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 394 transitions, 5071 flow [2024-06-03 22:12:50,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 394 transitions, 4917 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-03 22:12:50,701 INFO L231 Difference]: Finished difference. Result has 234 places, 367 transitions, 4223 flow [2024-06-03 22:12:50,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3739, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4223, PETRI_PLACES=234, PETRI_TRANSITIONS=367} [2024-06-03 22:12:50,701 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2024-06-03 22:12:50,702 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 367 transitions, 4223 flow [2024-06-03 22:12:50,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:50,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:50,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:50,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:12:50,702 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:12:50,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:50,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2052589686, now seen corresponding path program 1 times [2024-06-03 22:12:50,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:50,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493507092] [2024-06-03 22:12:50,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:50,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:00,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:00,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493507092] [2024-06-03 22:13:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493507092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:00,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:13:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894328993] [2024-06-03 22:13:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:00,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:13:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:00,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:13:00,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:13:00,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:13:00,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 367 transitions, 4223 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:00,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:00,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:13:00,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:02,041 INFO L124 PetriNetUnfolderBase]: 2707/4404 cut-off events. [2024-06-03 22:13:02,041 INFO L125 PetriNetUnfolderBase]: For 234591/234594 co-relation queries the response was YES. [2024-06-03 22:13:02,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33983 conditions, 4404 events. 2707/4404 cut-off events. For 234591/234594 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 26249 event pairs, 571 based on Foata normal form. 6/4408 useless extension candidates. Maximal degree in co-relation 33874. Up to 3926 conditions per place. [2024-06-03 22:13:02,090 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 342 selfloop transitions, 52 changer transitions 0/399 dead transitions. [2024-06-03 22:13:02,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 399 transitions, 5242 flow [2024-06-03 22:13:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:13:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:13:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-03 22:13:02,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-03 22:13:02,091 INFO L175 Difference]: Start difference. First operand has 234 places, 367 transitions, 4223 flow. Second operand 9 states and 169 transitions. [2024-06-03 22:13:02,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 399 transitions, 5242 flow [2024-06-03 22:13:02,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 399 transitions, 5129 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-06-03 22:13:02,533 INFO L231 Difference]: Finished difference. Result has 241 places, 375 transitions, 4361 flow [2024-06-03 22:13:02,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4110, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4361, PETRI_PLACES=241, PETRI_TRANSITIONS=375} [2024-06-03 22:13:02,534 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places. [2024-06-03 22:13:02,534 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 375 transitions, 4361 flow [2024-06-03 22:13:02,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:02,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:02,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:13:02,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:13:02,534 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-03 22:13:02,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1878788892, now seen corresponding path program 2 times [2024-06-03 22:13:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:02,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013964439] [2024-06-03 22:13:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:12,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013964439] [2024-06-03 22:13:12,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013964439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:12,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:12,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:13:12,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158267644] [2024-06-03 22:13:12,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:12,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:13:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:12,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:13:12,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:13:12,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:13:12,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 375 transitions, 4361 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:12,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:12,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:13:12,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:13,440 INFO L124 PetriNetUnfolderBase]: 2813/4575 cut-off events. [2024-06-03 22:13:13,440 INFO L125 PetriNetUnfolderBase]: For 252297/252300 co-relation queries the response was YES. [2024-06-03 22:13:13,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35628 conditions, 4575 events. 2813/4575 cut-off events. For 252297/252300 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 27431 event pairs, 577 based on Foata normal form. 6/4579 useless extension candidates. Maximal degree in co-relation 35516. Up to 3869 conditions per place. [2024-06-03 22:13:13,490 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 326 selfloop transitions, 91 changer transitions 0/422 dead transitions. [2024-06-03 22:13:13,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 422 transitions, 5713 flow [2024-06-03 22:13:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:13:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:13:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-03 22:13:13,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070460704607047 [2024-06-03 22:13:13,492 INFO L175 Difference]: Start difference. First operand has 241 places, 375 transitions, 4361 flow. Second operand 9 states and 170 transitions. [2024-06-03 22:13:13,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 422 transitions, 5713 flow [2024-06-03 22:13:13,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 422 transitions, 5591 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-03 22:13:13,852 INFO L231 Difference]: Finished difference. Result has 246 places, 396 transitions, 4739 flow [2024-06-03 22:13:13,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4239, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4739, PETRI_PLACES=246, PETRI_TRANSITIONS=396} [2024-06-03 22:13:13,853 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 204 predicate places. [2024-06-03 22:13:13,853 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 396 transitions, 4739 flow [2024-06-03 22:13:13,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:13,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:13,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:13:13,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:13:13,854 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-03 22:13:13,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1875458166, now seen corresponding path program 3 times [2024-06-03 22:13:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:13,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440979190] [2024-06-03 22:13:13,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:13,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440979190] [2024-06-03 22:13:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440979190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:13:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084099199] [2024-06-03 22:13:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:23,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:13:23,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:23,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:13:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:13:23,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:13:23,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 396 transitions, 4739 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:23,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:23,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:13:23,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:25,158 INFO L124 PetriNetUnfolderBase]: 2833/4613 cut-off events. [2024-06-03 22:13:25,159 INFO L125 PetriNetUnfolderBase]: For 262803/262806 co-relation queries the response was YES. [2024-06-03 22:13:25,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36380 conditions, 4613 events. 2833/4613 cut-off events. For 262803/262806 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 27758 event pairs, 596 based on Foata normal form. 6/4617 useless extension candidates. Maximal degree in co-relation 36266. Up to 3885 conditions per place. [2024-06-03 22:13:25,208 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 328 selfloop transitions, 93 changer transitions 0/426 dead transitions. [2024-06-03 22:13:25,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 426 transitions, 5962 flow [2024-06-03 22:13:25,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:13:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:13:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-03 22:13:25,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:13:25,209 INFO L175 Difference]: Start difference. First operand has 246 places, 396 transitions, 4739 flow. Second operand 9 states and 171 transitions. [2024-06-03 22:13:25,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 426 transitions, 5962 flow [2024-06-03 22:13:25,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 426 transitions, 5816 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-03 22:13:25,561 INFO L231 Difference]: Finished difference. Result has 251 places, 401 transitions, 4945 flow [2024-06-03 22:13:25,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4593, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4945, PETRI_PLACES=251, PETRI_TRANSITIONS=401} [2024-06-03 22:13:25,561 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 209 predicate places. [2024-06-03 22:13:25,561 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 401 transitions, 4945 flow [2024-06-03 22:13:25,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:25,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:25,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:13:25,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:13:25,562 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-03 22:13:25,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:25,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1235793728, now seen corresponding path program 2 times [2024-06-03 22:13:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:25,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874467828] [2024-06-03 22:13:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:25,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:36,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:36,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874467828] [2024-06-03 22:13:36,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874467828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:36,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:36,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:13:36,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113818276] [2024-06-03 22:13:36,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:36,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:13:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:36,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:13:36,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:13:36,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:13:36,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 401 transitions, 4945 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:36,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:36,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:13:36,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:38,106 INFO L124 PetriNetUnfolderBase]: 2878/4661 cut-off events. [2024-06-03 22:13:38,107 INFO L125 PetriNetUnfolderBase]: For 268493/268500 co-relation queries the response was YES. [2024-06-03 22:13:38,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37368 conditions, 4661 events. 2878/4661 cut-off events. For 268493/268500 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 27946 event pairs, 616 based on Foata normal form. 9/4668 useless extension candidates. Maximal degree in co-relation 37251. Up to 4135 conditions per place. [2024-06-03 22:13:38,164 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 364 selfloop transitions, 71 changer transitions 0/440 dead transitions. [2024-06-03 22:13:38,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 440 transitions, 6150 flow [2024-06-03 22:13:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:13:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:13:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-03 22:13:38,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45365853658536587 [2024-06-03 22:13:38,165 INFO L175 Difference]: Start difference. First operand has 251 places, 401 transitions, 4945 flow. Second operand 10 states and 186 transitions. [2024-06-03 22:13:38,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 440 transitions, 6150 flow [2024-06-03 22:13:38,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 440 transitions, 5974 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-03 22:13:38,599 INFO L231 Difference]: Finished difference. Result has 257 places, 415 transitions, 5188 flow [2024-06-03 22:13:38,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4772, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5188, PETRI_PLACES=257, PETRI_TRANSITIONS=415} [2024-06-03 22:13:38,599 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2024-06-03 22:13:38,599 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 415 transitions, 5188 flow [2024-06-03 22:13:38,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:38,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:38,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:13:38,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:13:38,600 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:13:38,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1875224612, now seen corresponding path program 3 times [2024-06-03 22:13:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:38,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746314475] [2024-06-03 22:13:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:48,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-03 22:13:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746314475] [2024-06-03 22:13:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746314475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:48,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:48,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:13:48,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219464683] [2024-06-03 22:13:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:48,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:13:48,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:48,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:13:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:13:48,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:13:48,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 415 transitions, 5188 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:48,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:48,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:13:48,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:50,183 INFO L124 PetriNetUnfolderBase]: 2890/4697 cut-off events. [2024-06-03 22:13:50,184 INFO L125 PetriNetUnfolderBase]: For 279256/279259 co-relation queries the response was YES. [2024-06-03 22:13:50,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38232 conditions, 4697 events. 2890/4697 cut-off events. For 279256/279259 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 28298 event pairs, 575 based on Foata normal form. 4/4699 useless extension candidates. Maximal degree in co-relation 38113. Up to 4067 conditions per place. [2024-06-03 22:13:50,239 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 393 selfloop transitions, 87 changer transitions 0/485 dead transitions. [2024-06-03 22:13:50,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 485 transitions, 7178 flow [2024-06-03 22:13:50,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:13:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:13:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-03 22:13:50,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2024-06-03 22:13:50,240 INFO L175 Difference]: Start difference. First operand has 257 places, 415 transitions, 5188 flow. Second operand 10 states and 182 transitions. [2024-06-03 22:13:50,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 485 transitions, 7178 flow [2024-06-03 22:13:50,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 485 transitions, 6940 flow, removed 61 selfloop flow, removed 6 redundant places. [2024-06-03 22:13:50,698 INFO L231 Difference]: Finished difference. Result has 264 places, 460 transitions, 6067 flow [2024-06-03 22:13:50,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4958, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6067, PETRI_PLACES=264, PETRI_TRANSITIONS=460} [2024-06-03 22:13:50,698 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-03 22:13:50,698 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 460 transitions, 6067 flow [2024-06-03 22:13:50,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:50,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:50,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:13:50,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:13:50,699 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-03 22:13:50,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1875212522, now seen corresponding path program 4 times [2024-06-03 22:13:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:50,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931118477] [2024-06-03 22:13:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:01,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-03 22:14:01,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:01,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931118477] [2024-06-03 22:14:01,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931118477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:01,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:01,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:14:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053909127] [2024-06-03 22:14:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:01,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:14:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:01,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:14:01,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:14:02,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:14:02,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 460 transitions, 6067 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:02,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:02,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:14:02,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:03,645 INFO L124 PetriNetUnfolderBase]: 2954/4792 cut-off events. [2024-06-03 22:14:03,645 INFO L125 PetriNetUnfolderBase]: For 302700/302703 co-relation queries the response was YES. [2024-06-03 22:14:03,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40411 conditions, 4792 events. 2954/4792 cut-off events. For 302700/302703 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 28915 event pairs, 575 based on Foata normal form. 5/4795 useless extension candidates. Maximal degree in co-relation 40288. Up to 3929 conditions per place. [2024-06-03 22:14:03,707 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 331 selfloop transitions, 162 changer transitions 0/498 dead transitions. [2024-06-03 22:14:03,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 498 transitions, 7780 flow [2024-06-03 22:14:03,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:14:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:14:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-06-03 22:14:03,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523281596452328 [2024-06-03 22:14:03,708 INFO L175 Difference]: Start difference. First operand has 264 places, 460 transitions, 6067 flow. Second operand 11 states and 204 transitions. [2024-06-03 22:14:03,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 498 transitions, 7780 flow [2024-06-03 22:14:04,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 498 transitions, 7536 flow, removed 85 selfloop flow, removed 5 redundant places. [2024-06-03 22:14:04,280 INFO L231 Difference]: Finished difference. Result has 272 places, 473 transitions, 6625 flow [2024-06-03 22:14:04,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5827, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6625, PETRI_PLACES=272, PETRI_TRANSITIONS=473} [2024-06-03 22:14:04,281 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 230 predicate places. [2024-06-03 22:14:04,281 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 473 transitions, 6625 flow [2024-06-03 22:14:04,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:04,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:04,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:04,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:14:04,281 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-03 22:14:04,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:04,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1875570572, now seen corresponding path program 5 times [2024-06-03 22:14:04,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:04,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511628245] [2024-06-03 22:14:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:14:15,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:15,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511628245] [2024-06-03 22:14:15,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511628245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:15,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:15,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:14:15,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35198735] [2024-06-03 22:14:15,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:15,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:14:15,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:15,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:14:15,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:14:15,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:14:15,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 473 transitions, 6625 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:15,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:15,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:14:15,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:16,904 INFO L124 PetriNetUnfolderBase]: 2961/4802 cut-off events. [2024-06-03 22:14:16,904 INFO L125 PetriNetUnfolderBase]: For 313360/313363 co-relation queries the response was YES. [2024-06-03 22:14:16,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41254 conditions, 4802 events. 2961/4802 cut-off events. For 313360/313363 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 28946 event pairs, 577 based on Foata normal form. 5/4805 useless extension candidates. Maximal degree in co-relation 41128. Up to 4048 conditions per place. [2024-06-03 22:14:16,960 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 365 selfloop transitions, 131 changer transitions 0/501 dead transitions. [2024-06-03 22:14:16,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 501 transitions, 7997 flow [2024-06-03 22:14:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:14:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:14:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-03 22:14:16,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560975609756098 [2024-06-03 22:14:16,963 INFO L175 Difference]: Start difference. First operand has 272 places, 473 transitions, 6625 flow. Second operand 10 states and 187 transitions. [2024-06-03 22:14:16,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 501 transitions, 7997 flow [2024-06-03 22:14:17,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 501 transitions, 7706 flow, removed 99 selfloop flow, removed 5 redundant places. [2024-06-03 22:14:17,538 INFO L231 Difference]: Finished difference. Result has 277 places, 478 transitions, 6787 flow [2024-06-03 22:14:17,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6358, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6787, PETRI_PLACES=277, PETRI_TRANSITIONS=478} [2024-06-03 22:14:17,539 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places. [2024-06-03 22:14:17,539 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 478 transitions, 6787 flow [2024-06-03 22:14:17,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:17,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:17,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:17,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:14:17,540 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:14:17,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:17,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1738351098, now seen corresponding path program 1 times [2024-06-03 22:14:17,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:17,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404077465] [2024-06-03 22:14:17,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:17,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:14:27,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:27,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404077465] [2024-06-03 22:14:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404077465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:27,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:14:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986455978] [2024-06-03 22:14:27,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:27,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:14:27,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:27,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:14:27,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:14:27,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:14:27,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 478 transitions, 6787 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:27,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:27,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:14:27,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:29,414 INFO L124 PetriNetUnfolderBase]: 2969/4821 cut-off events. [2024-06-03 22:14:29,414 INFO L125 PetriNetUnfolderBase]: For 319072/319076 co-relation queries the response was YES. [2024-06-03 22:14:29,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41547 conditions, 4821 events. 2969/4821 cut-off events. For 319072/319076 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29229 event pairs, 841 based on Foata normal form. 6/4826 useless extension candidates. Maximal degree in co-relation 41419. Up to 4440 conditions per place. [2024-06-03 22:14:29,476 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 473 selfloop transitions, 25 changer transitions 0/503 dead transitions. [2024-06-03 22:14:29,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 503 transitions, 7978 flow [2024-06-03 22:14:29,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:14:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:14:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-03 22:14:29,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:14:29,479 INFO L175 Difference]: Start difference. First operand has 277 places, 478 transitions, 6787 flow. Second operand 10 states and 170 transitions. [2024-06-03 22:14:29,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 503 transitions, 7978 flow [2024-06-03 22:14:30,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 503 transitions, 7682 flow, removed 63 selfloop flow, removed 6 redundant places. [2024-06-03 22:14:30,032 INFO L231 Difference]: Finished difference. Result has 283 places, 482 transitions, 6694 flow [2024-06-03 22:14:30,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6493, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6694, PETRI_PLACES=283, PETRI_TRANSITIONS=482} [2024-06-03 22:14:30,032 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 241 predicate places. [2024-06-03 22:14:30,032 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 482 transitions, 6694 flow [2024-06-03 22:14:30,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:30,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:30,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:30,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:14:30,033 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:14:30,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1480197940, now seen corresponding path program 7 times [2024-06-03 22:14:30,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:30,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836090314] [2024-06-03 22:14:30,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:30,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:14:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836090314] [2024-06-03 22:14:39,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836090314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:39,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:39,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:14:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954740808] [2024-06-03 22:14:39,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:39,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:14:39,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:39,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:14:39,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:14:39,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:14:39,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 482 transitions, 6694 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:39,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:39,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:14:39,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:41,302 INFO L124 PetriNetUnfolderBase]: 3005/4873 cut-off events. [2024-06-03 22:14:41,302 INFO L125 PetriNetUnfolderBase]: For 346764/346771 co-relation queries the response was YES. [2024-06-03 22:14:41,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41834 conditions, 4873 events. 3005/4873 cut-off events. For 346764/346771 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 29437 event pairs, 483 based on Foata normal form. 16/4887 useless extension candidates. Maximal degree in co-relation 41703. Up to 3945 conditions per place. [2024-06-03 22:14:41,361 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 427 selfloop transitions, 80 changer transitions 0/512 dead transitions. [2024-06-03 22:14:41,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 512 transitions, 7942 flow [2024-06-03 22:14:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:14:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:14:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-03 22:14:41,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725609756097561 [2024-06-03 22:14:41,362 INFO L175 Difference]: Start difference. First operand has 283 places, 482 transitions, 6694 flow. Second operand 8 states and 155 transitions. [2024-06-03 22:14:41,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 512 transitions, 7942 flow [2024-06-03 22:14:41,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 512 transitions, 7791 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-03 22:14:41,998 INFO L231 Difference]: Finished difference. Result has 287 places, 484 transitions, 6824 flow [2024-06-03 22:14:41,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6543, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6824, PETRI_PLACES=287, PETRI_TRANSITIONS=484} [2024-06-03 22:14:41,998 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 245 predicate places. [2024-06-03 22:14:41,999 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 484 transitions, 6824 flow [2024-06-03 22:14:41,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:41,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:41,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:41,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:14:41,999 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:14:41,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1030123274, now seen corresponding path program 8 times [2024-06-03 22:14:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659024026] [2024-06-03 22:14:41,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:41,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:14:52,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:52,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659024026] [2024-06-03 22:14:52,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659024026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:52,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:52,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:14:52,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314267109] [2024-06-03 22:14:52,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:52,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:14:52,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:52,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:14:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:14:52,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:14:52,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 484 transitions, 6824 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:52,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:52,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:14:52,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:54,534 INFO L124 PetriNetUnfolderBase]: 3049/4943 cut-off events. [2024-06-03 22:14:54,534 INFO L125 PetriNetUnfolderBase]: For 363905/363912 co-relation queries the response was YES. [2024-06-03 22:14:54,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43108 conditions, 4943 events. 3049/4943 cut-off events. For 363905/363912 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 29961 event pairs, 673 based on Foata normal form. 18/4959 useless extension candidates. Maximal degree in co-relation 42976. Up to 4217 conditions per place. [2024-06-03 22:14:54,602 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 432 selfloop transitions, 76 changer transitions 0/513 dead transitions. [2024-06-03 22:14:54,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 513 transitions, 8109 flow [2024-06-03 22:14:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:14:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:14:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-03 22:14:54,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-03 22:14:54,603 INFO L175 Difference]: Start difference. First operand has 287 places, 484 transitions, 6824 flow. Second operand 8 states and 154 transitions. [2024-06-03 22:14:54,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 513 transitions, 8109 flow [2024-06-03 22:14:55,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 513 transitions, 7878 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-03 22:14:55,363 INFO L231 Difference]: Finished difference. Result has 289 places, 486 transitions, 6868 flow [2024-06-03 22:14:55,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6605, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6868, PETRI_PLACES=289, PETRI_TRANSITIONS=486} [2024-06-03 22:14:55,364 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 247 predicate places. [2024-06-03 22:14:55,364 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 486 transitions, 6868 flow [2024-06-03 22:14:55,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:55,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:55,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:55,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:14:55,364 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-03 22:14:55,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:55,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1870140128, now seen corresponding path program 6 times [2024-06-03 22:14:55,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:55,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448133586] [2024-06-03 22:14:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:06,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448133586] [2024-06-03 22:15:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448133586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:06,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:06,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:15:06,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469290218] [2024-06-03 22:15:06,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:06,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:15:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:06,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:15:06,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:15:06,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:15:06,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 486 transitions, 6868 flow. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:06,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:06,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:15:06,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:08,330 INFO L124 PetriNetUnfolderBase]: 3081/4991 cut-off events. [2024-06-03 22:15:08,331 INFO L125 PetriNetUnfolderBase]: For 331398/331402 co-relation queries the response was YES. [2024-06-03 22:15:08,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43052 conditions, 4991 events. 3081/4991 cut-off events. For 331398/331402 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30340 event pairs, 701 based on Foata normal form. 8/4995 useless extension candidates. Maximal degree in co-relation 42919. Up to 4227 conditions per place. [2024-06-03 22:15:08,397 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 381 selfloop transitions, 137 changer transitions 0/523 dead transitions. [2024-06-03 22:15:08,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 523 transitions, 8474 flow [2024-06-03 22:15:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:15:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:15:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-03 22:15:08,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46883468834688347 [2024-06-03 22:15:08,399 INFO L175 Difference]: Start difference. First operand has 289 places, 486 transitions, 6868 flow. Second operand 9 states and 173 transitions. [2024-06-03 22:15:08,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 523 transitions, 8474 flow [2024-06-03 22:15:09,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 523 transitions, 8261 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-03 22:15:09,042 INFO L231 Difference]: Finished difference. Result has 294 places, 497 transitions, 7356 flow [2024-06-03 22:15:09,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6667, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7356, PETRI_PLACES=294, PETRI_TRANSITIONS=497} [2024-06-03 22:15:09,042 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 252 predicate places. [2024-06-03 22:15:09,043 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 497 transitions, 7356 flow [2024-06-03 22:15:09,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:09,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:09,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:09,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 22:15:09,043 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-03 22:15:09,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash -122993902, now seen corresponding path program 9 times [2024-06-03 22:15:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:09,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633495343] [2024-06-03 22:15:09,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:09,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:19,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:19,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633495343] [2024-06-03 22:15:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633495343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:19,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:15:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737098278] [2024-06-03 22:15:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:19,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:15:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:19,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:15:19,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:15:19,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:15:19,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 497 transitions, 7356 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:19,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:19,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:15:19,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:20,812 INFO L124 PetriNetUnfolderBase]: 3125/5067 cut-off events. [2024-06-03 22:15:20,812 INFO L125 PetriNetUnfolderBase]: For 352870/352873 co-relation queries the response was YES. [2024-06-03 22:15:20,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44372 conditions, 5067 events. 3125/5067 cut-off events. For 352870/352873 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 30897 event pairs, 585 based on Foata normal form. 14/5079 useless extension candidates. Maximal degree in co-relation 44236. Up to 4298 conditions per place. [2024-06-03 22:15:20,878 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 413 selfloop transitions, 104 changer transitions 0/522 dead transitions. [2024-06-03 22:15:20,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 522 transitions, 8657 flow [2024-06-03 22:15:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:15:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:15:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-03 22:15:20,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-06-03 22:15:20,879 INFO L175 Difference]: Start difference. First operand has 294 places, 497 transitions, 7356 flow. Second operand 8 states and 150 transitions. [2024-06-03 22:15:20,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 522 transitions, 8657 flow [2024-06-03 22:15:21,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 522 transitions, 8398 flow, removed 86 selfloop flow, removed 4 redundant places. [2024-06-03 22:15:21,628 INFO L231 Difference]: Finished difference. Result has 298 places, 499 transitions, 7406 flow [2024-06-03 22:15:21,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7097, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7406, PETRI_PLACES=298, PETRI_TRANSITIONS=499} [2024-06-03 22:15:21,628 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 256 predicate places. [2024-06-03 22:15:21,629 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 499 transitions, 7406 flow [2024-06-03 22:15:21,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:21,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:21,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:21,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 22:15:21,629 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:15:21,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash -300122260, now seen corresponding path program 2 times [2024-06-03 22:15:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:21,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115921313] [2024-06-03 22:15:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:21,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:30,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:30,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115921313] [2024-06-03 22:15:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115921313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:30,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:30,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:15:30,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47214397] [2024-06-03 22:15:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:30,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:15:30,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:30,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:15:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:15:31,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:15:31,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 499 transitions, 7406 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:31,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:31,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:15:31,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:32,765 INFO L124 PetriNetUnfolderBase]: 3135/5063 cut-off events. [2024-06-03 22:15:32,765 INFO L125 PetriNetUnfolderBase]: For 340794/340794 co-relation queries the response was YES. [2024-06-03 22:15:32,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44878 conditions, 5063 events. 3135/5063 cut-off events. For 340794/340794 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 30653 event pairs, 611 based on Foata normal form. 2/5060 useless extension candidates. Maximal degree in co-relation 44740. Up to 4424 conditions per place. [2024-06-03 22:15:32,840 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 446 selfloop transitions, 74 changer transitions 0/525 dead transitions. [2024-06-03 22:15:32,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 525 transitions, 8657 flow [2024-06-03 22:15:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:15:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:15:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-03 22:15:32,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:15:32,842 INFO L175 Difference]: Start difference. First operand has 298 places, 499 transitions, 7406 flow. Second operand 8 states and 152 transitions. [2024-06-03 22:15:32,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 525 transitions, 8657 flow [2024-06-03 22:15:33,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 525 transitions, 8400 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-03 22:15:33,542 INFO L231 Difference]: Finished difference. Result has 300 places, 503 transitions, 7438 flow [2024-06-03 22:15:33,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7149, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7438, PETRI_PLACES=300, PETRI_TRANSITIONS=503} [2024-06-03 22:15:33,543 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 258 predicate places. [2024-06-03 22:15:33,543 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 503 transitions, 7438 flow [2024-06-03 22:15:33,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:33,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:33,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:33,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 22:15:33,544 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:15:33,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:33,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2037328212, now seen corresponding path program 4 times [2024-06-03 22:15:33,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:33,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621026827] [2024-06-03 22:15:33,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:33,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:43,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621026827] [2024-06-03 22:15:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621026827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:43,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:43,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:15:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876163554] [2024-06-03 22:15:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:43,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:15:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:15:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:15:43,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:15:43,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 503 transitions, 7438 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:43,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:43,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:15:43,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:45,152 INFO L124 PetriNetUnfolderBase]: 3159/5102 cut-off events. [2024-06-03 22:15:45,152 INFO L125 PetriNetUnfolderBase]: For 360242/360245 co-relation queries the response was YES. [2024-06-03 22:15:45,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45493 conditions, 5102 events. 3159/5102 cut-off events. For 360242/360245 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 30912 event pairs, 587 based on Foata normal form. 10/5110 useless extension candidates. Maximal degree in co-relation 45354. Up to 4522 conditions per place. [2024-06-03 22:15:45,224 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 452 selfloop transitions, 78 changer transitions 0/535 dead transitions. [2024-06-03 22:15:45,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 535 transitions, 8918 flow [2024-06-03 22:15:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:15:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:15:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 22:15:45,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-03 22:15:45,225 INFO L175 Difference]: Start difference. First operand has 300 places, 503 transitions, 7438 flow. Second operand 8 states and 149 transitions. [2024-06-03 22:15:45,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 535 transitions, 8918 flow [2024-06-03 22:15:46,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 535 transitions, 8640 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-06-03 22:15:46,007 INFO L231 Difference]: Finished difference. Result has 301 places, 512 transitions, 7642 flow [2024-06-03 22:15:46,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7160, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7642, PETRI_PLACES=301, PETRI_TRANSITIONS=512} [2024-06-03 22:15:46,007 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places. [2024-06-03 22:15:46,007 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 512 transitions, 7642 flow [2024-06-03 22:15:46,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:46,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:46,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:46,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 22:15:46,008 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:15:46,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -122870584, now seen corresponding path program 5 times [2024-06-03 22:15:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:46,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906394405] [2024-06-03 22:15:46,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:55,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-03 22:15:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:55,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906394405] [2024-06-03 22:15:55,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906394405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:55,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:55,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:15:55,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012031288] [2024-06-03 22:15:55,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:55,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:15:55,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:55,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:15:55,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:15:56,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:15:56,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 512 transitions, 7642 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:56,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:56,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:15:56,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:57,742 INFO L124 PetriNetUnfolderBase]: 3195/5167 cut-off events. [2024-06-03 22:15:57,742 INFO L125 PetriNetUnfolderBase]: For 365894/365897 co-relation queries the response was YES. [2024-06-03 22:15:57,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46331 conditions, 5167 events. 3195/5167 cut-off events. For 365894/365897 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 31470 event pairs, 599 based on Foata normal form. 6/5171 useless extension candidates. Maximal degree in co-relation 46191. Up to 4218 conditions per place. [2024-06-03 22:15:57,808 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 372 selfloop transitions, 165 changer transitions 0/542 dead transitions. [2024-06-03 22:15:57,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 542 transitions, 9329 flow [2024-06-03 22:15:57,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:15:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:15:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-03 22:15:57,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:15:57,810 INFO L175 Difference]: Start difference. First operand has 301 places, 512 transitions, 7642 flow. Second operand 8 states and 152 transitions. [2024-06-03 22:15:57,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 542 transitions, 9329 flow [2024-06-03 22:15:58,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 542 transitions, 9000 flow, removed 98 selfloop flow, removed 6 redundant places. [2024-06-03 22:15:58,519 INFO L231 Difference]: Finished difference. Result has 303 places, 519 transitions, 7863 flow [2024-06-03 22:15:58,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7331, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7863, PETRI_PLACES=303, PETRI_TRANSITIONS=519} [2024-06-03 22:15:58,520 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 261 predicate places. [2024-06-03 22:15:58,520 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 519 transitions, 7863 flow [2024-06-03 22:15:58,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:58,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:58,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:58,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 22:15:58,520 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:15:58,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash -122633434, now seen corresponding path program 6 times [2024-06-03 22:15:58,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:58,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152919833] [2024-06-03 22:15:58,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:58,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:08,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:08,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152919833] [2024-06-03 22:16:08,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152919833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:08,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:08,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:16:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228992950] [2024-06-03 22:16:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:08,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:16:08,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:08,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:16:08,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:16:08,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:16:08,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 519 transitions, 7863 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:08,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:08,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:16:08,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:10,029 INFO L124 PetriNetUnfolderBase]: 3183/5153 cut-off events. [2024-06-03 22:16:10,029 INFO L125 PetriNetUnfolderBase]: For 357141/357144 co-relation queries the response was YES. [2024-06-03 22:16:10,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45865 conditions, 5153 events. 3183/5153 cut-off events. For 357141/357144 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 31420 event pairs, 584 based on Foata normal form. 6/5157 useless extension candidates. Maximal degree in co-relation 45724. Up to 4210 conditions per place. [2024-06-03 22:16:10,106 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 362 selfloop transitions, 172 changer transitions 0/539 dead transitions. [2024-06-03 22:16:10,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 539 transitions, 9194 flow [2024-06-03 22:16:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:16:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:16:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-03 22:16:10,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-06-03 22:16:10,107 INFO L175 Difference]: Start difference. First operand has 303 places, 519 transitions, 7863 flow. Second operand 8 states and 150 transitions. [2024-06-03 22:16:10,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 539 transitions, 9194 flow [2024-06-03 22:16:10,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 539 transitions, 8910 flow, removed 62 selfloop flow, removed 4 redundant places. [2024-06-03 22:16:10,999 INFO L231 Difference]: Finished difference. Result has 307 places, 519 transitions, 7946 flow [2024-06-03 22:16:10,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7579, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7946, PETRI_PLACES=307, PETRI_TRANSITIONS=519} [2024-06-03 22:16:10,999 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 265 predicate places. [2024-06-03 22:16:11,000 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 519 transitions, 7946 flow [2024-06-03 22:16:11,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:11,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:11,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:11,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 22:16:11,000 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:16:11,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:11,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1019923282, now seen corresponding path program 7 times [2024-06-03 22:16:11,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:11,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719937320] [2024-06-03 22:16:11,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:11,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:22,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:22,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719937320] [2024-06-03 22:16:22,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719937320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:22,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:22,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:16:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911799986] [2024-06-03 22:16:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:22,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:16:22,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:22,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:16:22,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:16:22,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:16:22,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 519 transitions, 7946 flow. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:22,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:22,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:16:22,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:24,278 INFO L124 PetriNetUnfolderBase]: 3247/5240 cut-off events. [2024-06-03 22:16:24,278 INFO L125 PetriNetUnfolderBase]: For 379694/379697 co-relation queries the response was YES. [2024-06-03 22:16:24,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47447 conditions, 5240 events. 3247/5240 cut-off events. For 379694/379697 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 31950 event pairs, 583 based on Foata normal form. 5/5243 useless extension candidates. Maximal degree in co-relation 47305. Up to 4093 conditions per place. [2024-06-03 22:16:24,349 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 325 selfloop transitions, 225 changer transitions 0/555 dead transitions. [2024-06-03 22:16:24,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 555 transitions, 9881 flow [2024-06-03 22:16:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:16:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:16:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-03 22:16:24,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-03 22:16:24,351 INFO L175 Difference]: Start difference. First operand has 307 places, 519 transitions, 7946 flow. Second operand 10 states and 184 transitions. [2024-06-03 22:16:24,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 555 transitions, 9881 flow [2024-06-03 22:16:25,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 555 transitions, 9617 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-03 22:16:25,128 INFO L231 Difference]: Finished difference. Result has 312 places, 532 transitions, 8607 flow [2024-06-03 22:16:25,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7682, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8607, PETRI_PLACES=312, PETRI_TRANSITIONS=532} [2024-06-03 22:16:25,128 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 270 predicate places. [2024-06-03 22:16:25,128 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 532 transitions, 8607 flow [2024-06-03 22:16:25,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:25,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:25,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:25,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 22:16:25,129 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:16:25,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:25,129 INFO L85 PathProgramCache]: Analyzing trace with hash -122624506, now seen corresponding path program 2 times [2024-06-03 22:16:25,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:25,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414252422] [2024-06-03 22:16:25,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:25,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:36,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:36,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414252422] [2024-06-03 22:16:36,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414252422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:36,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:36,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:16:36,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544983941] [2024-06-03 22:16:36,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:36,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:16:36,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:36,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:16:36,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:16:36,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:16:36,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 532 transitions, 8607 flow. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:36,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:36,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:16:36,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:38,629 INFO L124 PetriNetUnfolderBase]: 3255/5252 cut-off events. [2024-06-03 22:16:38,629 INFO L125 PetriNetUnfolderBase]: For 400183/400187 co-relation queries the response was YES. [2024-06-03 22:16:38,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49265 conditions, 5252 events. 3255/5252 cut-off events. For 400183/400187 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 32148 event pairs, 871 based on Foata normal form. 6/5257 useless extension candidates. Maximal degree in co-relation 49121. Up to 4845 conditions per place. [2024-06-03 22:16:38,699 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 512 selfloop transitions, 34 changer transitions 0/551 dead transitions. [2024-06-03 22:16:38,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 551 transitions, 9873 flow [2024-06-03 22:16:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:16:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:16:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-03 22:16:38,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41192411924119243 [2024-06-03 22:16:38,701 INFO L175 Difference]: Start difference. First operand has 312 places, 532 transitions, 8607 flow. Second operand 9 states and 152 transitions. [2024-06-03 22:16:38,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 551 transitions, 9873 flow [2024-06-03 22:16:39,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 551 transitions, 9446 flow, removed 97 selfloop flow, removed 6 redundant places. [2024-06-03 22:16:39,489 INFO L231 Difference]: Finished difference. Result has 315 places, 534 transitions, 8380 flow [2024-06-03 22:16:39,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8184, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8380, PETRI_PLACES=315, PETRI_TRANSITIONS=534} [2024-06-03 22:16:39,490 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 273 predicate places. [2024-06-03 22:16:39,490 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 534 transitions, 8380 flow [2024-06-03 22:16:39,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:39,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:39,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:39,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 22:16:39,490 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:16:39,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2137496526, now seen corresponding path program 8 times [2024-06-03 22:16:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:39,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544623341] [2024-06-03 22:16:39,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15