./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_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:00:37,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:00:37,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:00:37,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:00:37,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:00:37,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:00:37,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:00:37,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:00:37,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:00:37,818 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:00:37,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:00:37,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:00:37,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:00:37,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:00:37,820 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:00:37,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:00:37,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:00:37,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:00:37,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:00:37,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:00:37,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:00:37,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:00:37,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:00:37,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:00:37,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:00:37,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:00:37,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:00:37,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:00:37,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:00:37,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:00:37,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:00:37,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:00:37,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:00:37,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:00:37,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:00:37,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:00:37,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:00:37,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:00:37,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:00:37,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:00:37,827 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:00:37,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:00:37,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:00:37,827 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:00:38,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:00:38,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:00:38,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:00:38,042 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:00:38,043 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:00:38,043 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-06-03 22:00:38,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:00:38,239 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:00:38,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-03 22:00:39,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:00:39,502 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:00:39,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-03 22:00:39,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2173073f5/e2d07808a8534438a635a3b15117c0a5/FLAG453ec03ff [2024-06-03 22:00:39,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2173073f5/e2d07808a8534438a635a3b15117c0a5 [2024-06-03 22:00:39,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:00:39,529 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:00:39,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:00:39,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:00:39,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:00:39,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:00:38" (1/2) ... [2024-06-03 22:00:39,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b17df and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:00:39, skipping insertion in model container [2024-06-03 22:00:39,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:00:38" (1/2) ... [2024-06-03 22:00:39,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1c56d997 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:00:39, skipping insertion in model container [2024-06-03 22:00:39,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:00:39" (2/2) ... [2024-06-03 22:00:39,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b17df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:39, skipping insertion in model container [2024-06-03 22:00:39,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:00:39" (2/2) ... [2024-06-03 22:00:39,578 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:00:39,736 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:00:39,737 INFO L97 edCorrectnessWitness]: Location invariant before [L828-L828] (((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 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_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (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_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 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_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 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_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 )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (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_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && 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) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-06-03 22:00:39,738 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] (((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 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_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (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_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 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_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 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_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 )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (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_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && 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) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-06-03 22:00:39,738 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] (((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 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_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 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 )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (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_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 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_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 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_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 )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (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_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && 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) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-06-03 22:00:39,739 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:00:39,740 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-03 22:00:39,780 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:00:40,084 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:00:40,091 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:00:40,300 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:00:40,335 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:00:40,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40 WrapperNode [2024-06-03 22:00:40,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:00:40,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:00:40,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:00:40,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:00:40,342 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:00:40" (1/1) ... [2024-06-03 22:00:40,379 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:00:40" (1/1) ... [2024-06-03 22:00:40,527 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-06-03 22:00:40,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:00:40,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:00:40,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:00:40,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:00:40,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (1/1) ... [2024-06-03 22:00:40,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (1/1) ... [2024-06-03 22:00:40,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (1/1) ... [2024-06-03 22:00:40,602 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:00:40,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (1/1) ... [2024-06-03 22:00:40,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (1/1) ... [2024-06-03 22:00:40,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (1/1) ... [2024-06-03 22:00:40,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (1/1) ... [2024-06-03 22:00:40,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (1/1) ... [2024-06-03 22:00:40,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (1/1) ... [2024-06-03 22:00:40,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:00:40,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:00:40,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:00:40,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:00:40,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (1/1) ... [2024-06-03 22:00:40,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:00:40,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:00:40,707 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:00:40,724 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:00:40,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:00:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:00:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:00:40,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:00:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:00:40,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:00:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 22:00:40,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 22:00:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:00:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:00:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:00:40,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:00:40,753 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:00:40,885 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:00:40,887 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:00:41,960 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:00:41,960 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:00:42,186 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:00:42,186 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:00:42,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:00:42 BoogieIcfgContainer [2024-06-03 22:00:42,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:00:42,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:00:42,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:00:42,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:00:42,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:00:38" (1/4) ... [2024-06-03 22:00:42,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b10bf2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:00:42, skipping insertion in model container [2024-06-03 22:00:42,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:00:39" (2/4) ... [2024-06-03 22:00:42,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b10bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:00:42, skipping insertion in model container [2024-06-03 22:00:42,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:00:40" (3/4) ... [2024-06-03 22:00:42,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b10bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:00:42, skipping insertion in model container [2024-06-03 22:00:42,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:00:42" (4/4) ... [2024-06-03 22:00:42,193 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-03 22:00:42,205 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:00:42,205 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 22:00:42,206 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:00:42,293 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:00:42,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow [2024-06-03 22:00:42,389 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-06-03 22:00:42,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:00:42,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:00:42,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow [2024-06-03 22:00:42,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2024-06-03 22:00:42,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:00:42,404 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;@373831d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:00:42,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 22:00:42,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:00:42,412 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:00:42,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:00:42,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:00:42,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:00:42,414 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:00:42,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:00:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1464887810, now seen corresponding path program 1 times [2024-06-03 22:00:42,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:00:42,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855424702] [2024-06-03 22:00:42,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:00:42,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:00:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:00:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:00:48,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:00:48,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855424702] [2024-06-03 22:00:48,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855424702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:00:48,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:00:48,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:00:48,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217342068] [2024-06-03 22:00:48,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:00:48,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:00:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:00:48,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:00:48,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:00:48,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-03 22:00:48,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:00:48,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:00:48,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-03 22:00:48,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:00:49,470 INFO L124 PetriNetUnfolderBase]: 1359/2150 cut-off events. [2024-06-03 22:00:49,470 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-03 22:00:49,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 2150 events. 1359/2150 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10717 event pairs, 941 based on Foata normal form. 1/2074 useless extension candidates. Maximal degree in co-relation 4251. Up to 2029 conditions per place. [2024-06-03 22:00:49,485 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 34 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-03 22:00:49,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 179 flow [2024-06-03 22:00:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:00:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:00:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-03 22:00:49,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5736434108527132 [2024-06-03 22:00:49,496 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 74 transitions. [2024-06-03 22:00:49,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 179 flow [2024-06-03 22:00:49,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 22:00:49,500 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow [2024-06-03 22:00:49,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-03 22:00:49,503 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-06-03 22:00:49,504 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow [2024-06-03 22:00:49,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:00:49,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:00:49,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:00:49,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:00:49,505 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:00:49,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:00:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash 992120349, now seen corresponding path program 1 times [2024-06-03 22:00:49,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:00:49,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898366425] [2024-06-03 22:00:49,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:00:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:00:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:00:53,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:00:53,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:00:53,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898366425] [2024-06-03 22:00:53,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898366425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:00:53,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:00:53,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:00:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482559369] [2024-06-03 22:00:53,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:00:53,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:00:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:00:53,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:00:53,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:00:53,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:00:53,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:00:53,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:00:53,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:00:53,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:00:54,713 INFO L124 PetriNetUnfolderBase]: 1560/2388 cut-off events. [2024-06-03 22:00:54,713 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2024-06-03 22:00:54,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5406 conditions, 2388 events. 1560/2388 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11613 event pairs, 930 based on Foata normal form. 3/2353 useless extension candidates. Maximal degree in co-relation 5391. Up to 2302 conditions per place. [2024-06-03 22:00:54,724 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 42 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-06-03 22:00:54,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 248 flow [2024-06-03 22:00:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:00:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:00:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-06-03 22:00:54,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2024-06-03 22:00:54,726 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 92 transitions. [2024-06-03 22:00:54,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 248 flow [2024-06-03 22:00:54,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:00:54,728 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow [2024-06-03 22:00:54,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-06-03 22:00:54,729 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2024-06-03 22:00:54,729 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow [2024-06-03 22:00:54,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:00:54,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:00:54,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:00:54,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:00:54,730 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:00:54,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:00:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash 690960829, now seen corresponding path program 1 times [2024-06-03 22:00:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:00:54,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58459003] [2024-06-03 22:00:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:00:54,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:00:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:00:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:00:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:00:58,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58459003] [2024-06-03 22:00:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58459003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:00:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:00:58,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:00:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59486054] [2024-06-03 22:00:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:00:58,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:00:58,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:00:58,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:00:58,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:00:58,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:00:58,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:00:58,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:00:58,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:00:58,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:00:59,827 INFO L124 PetriNetUnfolderBase]: 1568/2407 cut-off events. [2024-06-03 22:00:59,827 INFO L125 PetriNetUnfolderBase]: For 1320/1320 co-relation queries the response was YES. [2024-06-03 22:00:59,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6042 conditions, 2407 events. 1568/2407 cut-off events. For 1320/1320 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11818 event pairs, 669 based on Foata normal form. 5/2391 useless extension candidates. Maximal degree in co-relation 6025. Up to 2248 conditions per place. [2024-06-03 22:00:59,839 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 16 changer transitions 0/76 dead transitions. [2024-06-03 22:00:59,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 402 flow [2024-06-03 22:00:59,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:00:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:00:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-03 22:00:59,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-06-03 22:00:59,844 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 120 transitions. [2024-06-03 22:00:59,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 402 flow [2024-06-03 22:00:59,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 388 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 22:00:59,847 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 239 flow [2024-06-03 22:00:59,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2024-06-03 22:00:59,848 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2024-06-03 22:00:59,848 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 239 flow [2024-06-03 22:00:59,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:00:59,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:00:59,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:00:59,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:00:59,849 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:00:59,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:00:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1706538564, now seen corresponding path program 1 times [2024-06-03 22:00:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:00:59,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873546122] [2024-06-03 22:00:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:00:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:00:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:01:04,622 INFO 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:01:04,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:01:04,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873546122] [2024-06-03 22:01:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873546122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:01:04,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:01:04,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:01:04,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176666200] [2024-06-03 22:01:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:01:04,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:01:04,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:01:04,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:01:04,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:01:04,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:01:04,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:01:04,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:01:04,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:01:04,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:01:05,882 INFO L124 PetriNetUnfolderBase]: 1580/2427 cut-off events. [2024-06-03 22:01:05,883 INFO L125 PetriNetUnfolderBase]: For 3142/3145 co-relation queries the response was YES. [2024-06-03 22:01:05,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7186 conditions, 2427 events. 1580/2427 cut-off events. For 3142/3145 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11935 event pairs, 481 based on Foata normal form. 12/2418 useless extension candidates. Maximal degree in co-relation 7166. Up to 2216 conditions per place. [2024-06-03 22:01:05,894 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 59 selfloop transitions, 19 changer transitions 0/83 dead transitions. [2024-06-03 22:01:05,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 505 flow [2024-06-03 22:01:05,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:01:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:01:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-03 22:01:05,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5310077519379846 [2024-06-03 22:01:05,897 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 239 flow. Second operand 6 states and 137 transitions. [2024-06-03 22:01:05,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 505 flow [2024-06-03 22:01:05,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 83 transitions, 497 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-03 22:01:05,903 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 295 flow [2024-06-03 22:01:05,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-06-03 22:01:05,905 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2024-06-03 22:01:05,905 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 295 flow [2024-06-03 22:01:05,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:01:05,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:01:05,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:01:05,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:01:05,906 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:01:05,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:01:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2005809500, now seen corresponding path program 1 times [2024-06-03 22:01:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:01:05,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656309032] [2024-06-03 22:01:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:01:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:01:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:01:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:01:12,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:01:12,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656309032] [2024-06-03 22:01:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656309032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:01:12,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:01:12,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:01:12,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970799799] [2024-06-03 22:01:12,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:01:12,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:01:12,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:01:12,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:01:12,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:01:13,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:01:13,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:01:13,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:01:13,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:01:13,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:01:14,152 INFO L124 PetriNetUnfolderBase]: 1368/2165 cut-off events. [2024-06-03 22:01:14,160 INFO L125 PetriNetUnfolderBase]: For 4021/4021 co-relation queries the response was YES. [2024-06-03 22:01:14,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6937 conditions, 2165 events. 1368/2165 cut-off events. For 4021/4021 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10910 event pairs, 562 based on Foata normal form. 2/2134 useless extension candidates. Maximal degree in co-relation 6914. Up to 2036 conditions per place. [2024-06-03 22:01:14,175 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 50 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2024-06-03 22:01:14,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 439 flow [2024-06-03 22:01:14,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:01:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:01:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-03 22:01:14,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44651162790697674 [2024-06-03 22:01:14,176 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 295 flow. Second operand 5 states and 96 transitions. [2024-06-03 22:01:14,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 439 flow [2024-06-03 22:01:14,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 389 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:01:14,180 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 269 flow [2024-06-03 22:01:14,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-06-03 22:01:14,181 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2024-06-03 22:01:14,181 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 269 flow [2024-06-03 22:01:14,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:01:14,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:01:14,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:01:14,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:01:14,182 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:01:14,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:01:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2033918504, now seen corresponding path program 1 times [2024-06-03 22:01:14,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:01:14,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952591983] [2024-06-03 22:01:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:01:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:01:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:01:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:01:25,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:01:25,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952591983] [2024-06-03 22:01:25,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952591983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:01:25,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:01:25,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:01:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253784159] [2024-06-03 22:01:25,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:01:25,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:01:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:01:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:01:25,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:01:25,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:01:25,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 269 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:01:25,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:01:25,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:01:25,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:01:26,385 INFO L124 PetriNetUnfolderBase]: 1358/2223 cut-off events. [2024-06-03 22:01:26,386 INFO L125 PetriNetUnfolderBase]: For 4716/4716 co-relation queries the response was YES. [2024-06-03 22:01:26,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6991 conditions, 2223 events. 1358/2223 cut-off events. For 4716/4716 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11558 event pairs, 526 based on Foata normal form. 4/2216 useless extension candidates. Maximal degree in co-relation 6966. Up to 2004 conditions per place. [2024-06-03 22:01:26,399 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 55 selfloop transitions, 11 changer transitions 0/72 dead transitions. [2024-06-03 22:01:26,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 459 flow [2024-06-03 22:01:26,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:01:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:01:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-03 22:01:26,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-03 22:01:26,400 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 269 flow. Second operand 6 states and 114 transitions. [2024-06-03 22:01:26,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 459 flow [2024-06-03 22:01:26,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 437 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:01:26,404 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 301 flow [2024-06-03 22:01:26,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=6, PETRI_FLOW=301, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2024-06-03 22:01:26,405 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2024-06-03 22:01:26,405 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 301 flow [2024-06-03 22:01:26,405 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:01:26,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:01:26,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:01:26,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:01:26,405 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:01:26,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:01:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash -601471343, now seen corresponding path program 1 times [2024-06-03 22:01:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:01:26,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632698204] [2024-06-03 22:01:26,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:01:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:01:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:01:37,919 INFO 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:01:37,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:01:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632698204] [2024-06-03 22:01:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632698204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:01:37,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:01:37,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:01:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011839871] [2024-06-03 22:01:37,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:01:37,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:01:37,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:01:37,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:01:37,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:01:38,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:01:38,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 301 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:01:38,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:01:38,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:01:38,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:01:39,150 INFO L124 PetriNetUnfolderBase]: 1571/2446 cut-off events. [2024-06-03 22:01:39,150 INFO L125 PetriNetUnfolderBase]: For 7146/7152 co-relation queries the response was YES. [2024-06-03 22:01:39,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8421 conditions, 2446 events. 1571/2446 cut-off events. For 7146/7152 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12126 event pairs, 635 based on Foata normal form. 8/2440 useless extension candidates. Maximal degree in co-relation 8396. Up to 2253 conditions per place. [2024-06-03 22:01:39,162 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2024-06-03 22:01:39,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 79 transitions, 545 flow [2024-06-03 22:01:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:01:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:01:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-03 22:01:39,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-03 22:01:39,164 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 301 flow. Second operand 6 states and 117 transitions. [2024-06-03 22:01:39,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 79 transitions, 545 flow [2024-06-03 22:01:39,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 515 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:01:39,168 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 343 flow [2024-06-03 22:01:39,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2024-06-03 22:01:39,169 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2024-06-03 22:01:39,169 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 343 flow [2024-06-03 22:01:39,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:01:39,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:01:39,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:01:39,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:01:39,170 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:01:39,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:01:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash -857360453, now seen corresponding path program 2 times [2024-06-03 22:01:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:01:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386986445] [2024-06-03 22:01:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:01:39,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:01:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:01:47,329 INFO 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:01:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:01:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386986445] [2024-06-03 22:01:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386986445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:01:47,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:01:47,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:01:47,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234353978] [2024-06-03 22:01:47,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:01:47,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:01:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:01:47,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:01:47,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:01:47,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:01:47,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 343 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:01:47,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:01:47,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:01:47,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:01:48,508 INFO L124 PetriNetUnfolderBase]: 1559/2419 cut-off events. [2024-06-03 22:01:48,508 INFO L125 PetriNetUnfolderBase]: For 8578/8584 co-relation queries the response was YES. [2024-06-03 22:01:48,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8590 conditions, 2419 events. 1559/2419 cut-off events. For 8578/8584 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11940 event pairs, 649 based on Foata normal form. 3/2403 useless extension candidates. Maximal degree in co-relation 8564. Up to 2237 conditions per place. [2024-06-03 22:01:48,518 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 49 selfloop transitions, 20 changer transitions 0/74 dead transitions. [2024-06-03 22:01:48,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 519 flow [2024-06-03 22:01:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:01:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:01:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-03 22:01:48,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.437984496124031 [2024-06-03 22:01:48,526 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 343 flow. Second operand 6 states and 113 transitions. [2024-06-03 22:01:48,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 519 flow [2024-06-03 22:01:48,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 490 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 22:01:48,531 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 362 flow [2024-06-03 22:01:48,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-06-03 22:01:48,531 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2024-06-03 22:01:48,531 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 362 flow [2024-06-03 22:01:48,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:01:48,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:01:48,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:01:48,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:01:48,532 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:01:48,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:01:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1798133161, now seen corresponding path program 1 times [2024-06-03 22:01:48,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:01:48,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712016344] [2024-06-03 22:01:48,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:01:48,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:01:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:02:00,195 INFO 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:00,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:02:00,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712016344] [2024-06-03 22:02:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712016344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:02:00,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:02:00,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:02:00,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498220958] [2024-06-03 22:02:00,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:02:00,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:02:00,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:02:00,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:02:00,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:02:00,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:02:00,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 362 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:00,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:02:00,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:02:00,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:02:01,484 INFO L124 PetriNetUnfolderBase]: 1733/2685 cut-off events. [2024-06-03 22:02:01,484 INFO L125 PetriNetUnfolderBase]: For 11431/11437 co-relation queries the response was YES. [2024-06-03 22:02:01,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9961 conditions, 2685 events. 1733/2685 cut-off events. For 11431/11437 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 13291 event pairs, 639 based on Foata normal form. 12/2683 useless extension candidates. Maximal degree in co-relation 9934. Up to 2337 conditions per place. [2024-06-03 22:02:01,497 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 75 selfloop transitions, 40 changer transitions 0/120 dead transitions. [2024-06-03 22:02:01,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 120 transitions, 937 flow [2024-06-03 22:02:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:02:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:02:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-03 22:02:01,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 22:02:01,520 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 362 flow. Second operand 9 states and 172 transitions. [2024-06-03 22:02:01,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 120 transitions, 937 flow [2024-06-03 22:02:01,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 120 transitions, 811 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:02:01,533 INFO L231 Difference]: Finished difference. Result has 71 places, 83 transitions, 578 flow [2024-06-03 22:02:01,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=578, PETRI_PLACES=71, PETRI_TRANSITIONS=83} [2024-06-03 22:02:01,534 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2024-06-03 22:02:01,534 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 83 transitions, 578 flow [2024-06-03 22:02:01,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:01,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:02:01,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:02:01,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:02:01,535 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:02:01,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:02:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1008737709, now seen corresponding path program 2 times [2024-06-03 22:02:01,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:02:01,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042588318] [2024-06-03 22:02:01,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:02:01,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:02:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:02:13,843 INFO 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:13,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:02:13,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042588318] [2024-06-03 22:02:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042588318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:02:13,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:02:13,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:02:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331088703] [2024-06-03 22:02:13,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:02:13,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:02:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:02:13,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:02:13,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:02:13,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:02:13,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 83 transitions, 578 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:13,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:02:13,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:02:13,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:02:15,207 INFO L124 PetriNetUnfolderBase]: 1805/2773 cut-off events. [2024-06-03 22:02:15,207 INFO L125 PetriNetUnfolderBase]: For 14798/14806 co-relation queries the response was YES. [2024-06-03 22:02:15,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11295 conditions, 2773 events. 1805/2773 cut-off events. For 14798/14806 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13596 event pairs, 545 based on Foata normal form. 16/2771 useless extension candidates. Maximal degree in co-relation 11264. Up to 2285 conditions per place. [2024-06-03 22:02:15,221 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 70 selfloop transitions, 54 changer transitions 0/129 dead transitions. [2024-06-03 22:02:15,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 129 transitions, 1060 flow [2024-06-03 22:02:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:02:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:02:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-03 22:02:15,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2024-06-03 22:02:15,241 INFO L175 Difference]: Start difference. First operand has 71 places, 83 transitions, 578 flow. Second operand 9 states and 170 transitions. [2024-06-03 22:02:15,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 129 transitions, 1060 flow [2024-06-03 22:02:15,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 129 transitions, 1026 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-03 22:02:15,257 INFO L231 Difference]: Finished difference. Result has 78 places, 93 transitions, 764 flow [2024-06-03 22:02:15,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=764, PETRI_PLACES=78, PETRI_TRANSITIONS=93} [2024-06-03 22:02:15,259 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2024-06-03 22:02:15,259 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 764 flow [2024-06-03 22:02:15,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:15,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:02:15,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:02:15,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:02:15,260 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:02:15,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:02:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash -797637939, now seen corresponding path program 3 times [2024-06-03 22:02:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:02:15,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033218461] [2024-06-03 22:02:15,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:02:15,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:02:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:02:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:02:27,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:02:27,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033218461] [2024-06-03 22:02:27,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033218461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:02:27,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:02:27,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:02:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125874780] [2024-06-03 22:02:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:02:27,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:02:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:02:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:02:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:02:27,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:02:27,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 764 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:27,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:02:27,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:02:27,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:02:28,912 INFO L124 PetriNetUnfolderBase]: 1827/2814 cut-off events. [2024-06-03 22:02:28,912 INFO L125 PetriNetUnfolderBase]: For 18330/18338 co-relation queries the response was YES. [2024-06-03 22:02:28,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12447 conditions, 2814 events. 1827/2814 cut-off events. For 18330/18338 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13858 event pairs, 553 based on Foata normal form. 5/2791 useless extension candidates. Maximal degree in co-relation 12414. Up to 2294 conditions per place. [2024-06-03 22:02:28,930 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 65 selfloop transitions, 62 changer transitions 0/132 dead transitions. [2024-06-03 22:02:28,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 132 transitions, 1278 flow [2024-06-03 22:02:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:02:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:02:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-03 22:02:28,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476744186046512 [2024-06-03 22:02:28,932 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 764 flow. Second operand 8 states and 154 transitions. [2024-06-03 22:02:28,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 132 transitions, 1278 flow [2024-06-03 22:02:28,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 132 transitions, 1171 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-03 22:02:28,954 INFO L231 Difference]: Finished difference. Result has 81 places, 101 transitions, 889 flow [2024-06-03 22:02:28,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=889, PETRI_PLACES=81, PETRI_TRANSITIONS=101} [2024-06-03 22:02:28,955 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2024-06-03 22:02:28,955 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 101 transitions, 889 flow [2024-06-03 22:02:28,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:28,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:02:28,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:02:28,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:02:28,955 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:02:28,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:02:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 385351465, now seen corresponding path program 4 times [2024-06-03 22:02:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:02:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935602259] [2024-06-03 22:02:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:02:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:02:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:02:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:02:41,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:02:41,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935602259] [2024-06-03 22:02:41,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935602259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:02:41,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:02:41,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:02:41,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946375137] [2024-06-03 22:02:41,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:02:41,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:02:41,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:02:41,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:02:41,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:02:41,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:02:41,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 101 transitions, 889 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:41,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:02:41,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:02:41,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:02:42,773 INFO L124 PetriNetUnfolderBase]: 1811/2789 cut-off events. [2024-06-03 22:02:42,773 INFO L125 PetriNetUnfolderBase]: For 17399/17407 co-relation queries the response was YES. [2024-06-03 22:02:42,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12183 conditions, 2789 events. 1811/2789 cut-off events. For 17399/17407 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13757 event pairs, 550 based on Foata normal form. 7/2768 useless extension candidates. Maximal degree in co-relation 12148. Up to 2287 conditions per place. [2024-06-03 22:02:42,788 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 71 selfloop transitions, 63 changer transitions 0/139 dead transitions. [2024-06-03 22:02:42,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 139 transitions, 1311 flow [2024-06-03 22:02:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:02:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:02:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-03 22:02:42,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43023255813953487 [2024-06-03 22:02:42,790 INFO L175 Difference]: Start difference. First operand has 81 places, 101 transitions, 889 flow. Second operand 10 states and 185 transitions. [2024-06-03 22:02:42,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 139 transitions, 1311 flow [2024-06-03 22:02:42,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 139 transitions, 1207 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-03 22:02:42,809 INFO L231 Difference]: Finished difference. Result has 87 places, 101 transitions, 922 flow [2024-06-03 22:02:42,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=922, PETRI_PLACES=87, PETRI_TRANSITIONS=101} [2024-06-03 22:02:42,810 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2024-06-03 22:02:42,810 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 922 flow [2024-06-03 22:02:42,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:02:42,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:02:42,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:02:42,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:02:42,811 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:02:42,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:02:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash 385597543, now seen corresponding path program 1 times [2024-06-03 22:02:42,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:02:42,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242491337] [2024-06-03 22:02:42,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:02:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:02:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:02:54,380 INFO 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:54,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:02:54,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242491337] [2024-06-03 22:02:54,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242491337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:02:54,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:02:54,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:02:54,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425245119] [2024-06-03 22:02:54,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:02:54,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:02:54,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:02:54,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:02:54,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:02:54,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:02:54,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 101 transitions, 922 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:02:54,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:02:54,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:02:54,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:02:55,604 INFO L124 PetriNetUnfolderBase]: 1596/2560 cut-off events. [2024-06-03 22:02:55,605 INFO L125 PetriNetUnfolderBase]: For 16795/16797 co-relation queries the response was YES. [2024-06-03 22:02:55,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11245 conditions, 2560 events. 1596/2560 cut-off events. For 16795/16797 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 13018 event pairs, 509 based on Foata normal form. 4/2545 useless extension candidates. Maximal degree in co-relation 11209. Up to 2329 conditions per place. [2024-06-03 22:02:55,616 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 105 selfloop transitions, 13 changer transitions 0/124 dead transitions. [2024-06-03 22:02:55,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 124 transitions, 1242 flow [2024-06-03 22:02:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:02:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:02:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 22:02:55,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-03 22:02:55,619 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 922 flow. Second operand 7 states and 131 transitions. [2024-06-03 22:02:55,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 124 transitions, 1242 flow [2024-06-03 22:02:55,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 124 transitions, 1069 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-03 22:02:55,639 INFO L231 Difference]: Finished difference. Result has 84 places, 103 transitions, 808 flow [2024-06-03 22:02:55,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=84, PETRI_TRANSITIONS=103} [2024-06-03 22:02:55,640 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2024-06-03 22:02:55,641 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 103 transitions, 808 flow [2024-06-03 22:02:55,641 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:02:55,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:02:55,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:02:55,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:02:55,641 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:02:55,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:02:55,642 INFO L85 PathProgramCache]: Analyzing trace with hash -171163494, now seen corresponding path program 1 times [2024-06-03 22:02:55,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:02:55,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950719451] [2024-06-03 22:02:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:02:55,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:02:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:06,803 INFO 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,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:06,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950719451] [2024-06-03 22:03:06,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950719451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:06,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:06,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:03:06,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842097235] [2024-06-03 22:03:06,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:06,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:03:06,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:06,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:03:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:03:06,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:03:06,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 103 transitions, 808 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:06,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:06,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:03:06,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:07,704 INFO L124 PetriNetUnfolderBase]: 1593/2560 cut-off events. [2024-06-03 22:03:07,705 INFO L125 PetriNetUnfolderBase]: For 17710/17712 co-relation queries the response was YES. [2024-06-03 22:03:07,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11102 conditions, 2560 events. 1593/2560 cut-off events. For 17710/17712 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 13075 event pairs, 545 based on Foata normal form. 1/2542 useless extension candidates. Maximal degree in co-relation 11065. Up to 2367 conditions per place. [2024-06-03 22:03:07,717 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 100 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2024-06-03 22:03:07,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 114 transitions, 1070 flow [2024-06-03 22:03:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:03:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:03:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-03 22:03:07,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42790697674418604 [2024-06-03 22:03:07,719 INFO L175 Difference]: Start difference. First operand has 84 places, 103 transitions, 808 flow. Second operand 5 states and 92 transitions. [2024-06-03 22:03:07,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 114 transitions, 1070 flow [2024-06-03 22:03:07,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 114 transitions, 1029 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 22:03:07,736 INFO L231 Difference]: Finished difference. Result has 84 places, 106 transitions, 817 flow [2024-06-03 22:03:07,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=817, PETRI_PLACES=84, PETRI_TRANSITIONS=106} [2024-06-03 22:03:07,737 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2024-06-03 22:03:07,737 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 106 transitions, 817 flow [2024-06-03 22:03:07,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:07,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:07,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:07,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:03:07,738 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:03:07,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:07,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2135121005, now seen corresponding path program 1 times [2024-06-03 22:03:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:07,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977726194] [2024-06-03 22:03:07,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:07,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:19,799 INFO 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:19,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:19,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977726194] [2024-06-03 22:03:19,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977726194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:19,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:19,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:03:19,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927332764] [2024-06-03 22:03:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:19,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:03:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:19,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:03:19,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:03:19,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:03:19,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 106 transitions, 817 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:19,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:19,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:03:19,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:21,210 INFO L124 PetriNetUnfolderBase]: 1844/2870 cut-off events. [2024-06-03 22:03:21,210 INFO L125 PetriNetUnfolderBase]: For 24130/24139 co-relation queries the response was YES. [2024-06-03 22:03:21,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12978 conditions, 2870 events. 1844/2870 cut-off events. For 24130/24139 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14287 event pairs, 534 based on Foata normal form. 16/2882 useless extension candidates. Maximal degree in co-relation 12940. Up to 2309 conditions per place. [2024-06-03 22:03:21,224 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 82 selfloop transitions, 68 changer transitions 0/155 dead transitions. [2024-06-03 22:03:21,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 155 transitions, 1359 flow [2024-06-03 22:03:21,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:03:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:03:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-03 22:03:21,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43953488372093025 [2024-06-03 22:03:21,226 INFO L175 Difference]: Start difference. First operand has 84 places, 106 transitions, 817 flow. Second operand 10 states and 189 transitions. [2024-06-03 22:03:21,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 155 transitions, 1359 flow [2024-06-03 22:03:21,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 155 transitions, 1331 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 22:03:21,244 INFO L231 Difference]: Finished difference. Result has 91 places, 112 transitions, 999 flow [2024-06-03 22:03:21,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=999, PETRI_PLACES=91, PETRI_TRANSITIONS=112} [2024-06-03 22:03:21,245 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2024-06-03 22:03:21,245 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 112 transitions, 999 flow [2024-06-03 22:03:21,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:21,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:21,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:21,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:03:21,246 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:03:21,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1806658007, now seen corresponding path program 2 times [2024-06-03 22:03:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:21,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436076875] [2024-06-03 22:03:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:33,654 INFO 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:33,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:33,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436076875] [2024-06-03 22:03:33,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436076875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:33,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:33,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:03:33,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588757173] [2024-06-03 22:03:33,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:33,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:03:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:33,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:03:33,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:03:33,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:03:33,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 112 transitions, 999 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:33,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:33,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:03:33,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:34,985 INFO L124 PetriNetUnfolderBase]: 1856/2892 cut-off events. [2024-06-03 22:03:34,985 INFO L125 PetriNetUnfolderBase]: For 27553/27558 co-relation queries the response was YES. [2024-06-03 22:03:34,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13684 conditions, 2892 events. 1856/2892 cut-off events. For 27553/27558 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14452 event pairs, 544 based on Foata normal form. 10/2898 useless extension candidates. Maximal degree in co-relation 13645. Up to 2320 conditions per place. [2024-06-03 22:03:35,002 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 81 selfloop transitions, 64 changer transitions 0/150 dead transitions. [2024-06-03 22:03:35,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 150 transitions, 1480 flow [2024-06-03 22:03:35,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:03:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:03:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-03 22:03:35,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2024-06-03 22:03:35,005 INFO L175 Difference]: Start difference. First operand has 91 places, 112 transitions, 999 flow. Second operand 9 states and 170 transitions. [2024-06-03 22:03:35,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 150 transitions, 1480 flow [2024-06-03 22:03:35,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 150 transitions, 1308 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-03 22:03:35,030 INFO L231 Difference]: Finished difference. Result has 92 places, 115 transitions, 1005 flow [2024-06-03 22:03:35,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1005, PETRI_PLACES=92, PETRI_TRANSITIONS=115} [2024-06-03 22:03:35,031 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2024-06-03 22:03:35,031 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 115 transitions, 1005 flow [2024-06-03 22:03:35,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:35,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:35,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:35,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:03:35,032 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:03:35,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:35,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1043028539, now seen corresponding path program 3 times [2024-06-03 22:03:35,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:35,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474564573] [2024-06-03 22:03:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:03:47,284 INFO 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:47,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:03:47,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474564573] [2024-06-03 22:03:47,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474564573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:03:47,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:03:47,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:03:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260910418] [2024-06-03 22:03:47,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:03:47,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:03:47,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:03:47,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:03:47,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:03:47,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:03:47,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 115 transitions, 1005 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:47,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:03:47,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:03:47,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:03:48,500 INFO L124 PetriNetUnfolderBase]: 1846/2878 cut-off events. [2024-06-03 22:03:48,501 INFO L125 PetriNetUnfolderBase]: For 29820/29831 co-relation queries the response was YES. [2024-06-03 22:03:48,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13688 conditions, 2878 events. 1846/2878 cut-off events. For 29820/29831 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14416 event pairs, 576 based on Foata normal form. 7/2870 useless extension candidates. Maximal degree in co-relation 13648. Up to 2312 conditions per place. [2024-06-03 22:03:48,516 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 72 selfloop transitions, 60 changer transitions 0/137 dead transitions. [2024-06-03 22:03:48,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 137 transitions, 1333 flow [2024-06-03 22:03:48,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:03:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:03:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-03 22:03:48,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2024-06-03 22:03:48,518 INFO L175 Difference]: Start difference. First operand has 92 places, 115 transitions, 1005 flow. Second operand 7 states and 132 transitions. [2024-06-03 22:03:48,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 137 transitions, 1333 flow [2024-06-03 22:03:48,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 137 transitions, 1194 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 22:03:48,543 INFO L231 Difference]: Finished difference. Result has 93 places, 115 transitions, 994 flow [2024-06-03 22:03:48,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=994, PETRI_PLACES=93, PETRI_TRANSITIONS=115} [2024-06-03 22:03:48,543 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2024-06-03 22:03:48,543 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 115 transitions, 994 flow [2024-06-03 22:03:48,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:03:48,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:03:48,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:03:48,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:03:48,544 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:03:48,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:03:48,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1011099354, now seen corresponding path program 1 times [2024-06-03 22:03:48,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:03:48,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058574136] [2024-06-03 22:03:48,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:03:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:03:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:00,644 INFO 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:00,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:00,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058574136] [2024-06-03 22:04:00,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058574136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:00,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:00,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:04:00,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631929731] [2024-06-03 22:04:00,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:00,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:04:00,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:00,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:04:00,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:04:00,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:04:00,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 115 transitions, 994 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:00,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:00,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:04:00,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:01,670 INFO L124 PetriNetUnfolderBase]: 1843/2888 cut-off events. [2024-06-03 22:04:01,670 INFO L125 PetriNetUnfolderBase]: For 32421/32423 co-relation queries the response was YES. [2024-06-03 22:04:01,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13841 conditions, 2888 events. 1843/2888 cut-off events. For 32421/32423 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14521 event pairs, 649 based on Foata normal form. 1/2886 useless extension candidates. Maximal degree in co-relation 13800. Up to 2725 conditions per place. [2024-06-03 22:04:01,683 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 111 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-06-03 22:04:01,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 127 transitions, 1290 flow [2024-06-03 22:04:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:04:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:04:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-03 22:04:01,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39147286821705424 [2024-06-03 22:04:01,686 INFO L175 Difference]: Start difference. First operand has 93 places, 115 transitions, 994 flow. Second operand 6 states and 101 transitions. [2024-06-03 22:04:01,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 127 transitions, 1290 flow [2024-06-03 22:04:01,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 127 transitions, 1155 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-03 22:04:01,740 INFO L231 Difference]: Finished difference. Result has 92 places, 118 transitions, 919 flow [2024-06-03 22:04:01,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=92, PETRI_TRANSITIONS=118} [2024-06-03 22:04:01,741 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2024-06-03 22:04:01,741 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 118 transitions, 919 flow [2024-06-03 22:04:01,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:01,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:01,742 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:01,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:04:01,742 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:01,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:01,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1882393716, now seen corresponding path program 1 times [2024-06-03 22:04:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:01,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309441813] [2024-06-03 22:04:01,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:01,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:13,801 INFO 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:13,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:13,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309441813] [2024-06-03 22:04:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309441813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:13,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:04:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96212174] [2024-06-03 22:04:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:13,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:04:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:04:13,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:04:13,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:04:13,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 118 transitions, 919 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:13,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:13,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:04:13,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:15,119 INFO L124 PetriNetUnfolderBase]: 1923/2980 cut-off events. [2024-06-03 22:04:15,119 INFO L125 PetriNetUnfolderBase]: For 41532/41537 co-relation queries the response was YES. [2024-06-03 22:04:15,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14890 conditions, 2980 events. 1923/2980 cut-off events. For 41532/41537 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14992 event pairs, 464 based on Foata normal form. 6/2982 useless extension candidates. Maximal degree in co-relation 14848. Up to 2573 conditions per place. [2024-06-03 22:04:15,136 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 106 selfloop transitions, 35 changer transitions 0/147 dead transitions. [2024-06-03 22:04:15,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 147 transitions, 1381 flow [2024-06-03 22:04:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:04:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:04:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 22:04:15,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-03 22:04:15,139 INFO L175 Difference]: Start difference. First operand has 92 places, 118 transitions, 919 flow. Second operand 7 states and 133 transitions. [2024-06-03 22:04:15,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 147 transitions, 1381 flow [2024-06-03 22:04:15,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 147 transitions, 1343 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 22:04:15,172 INFO L231 Difference]: Finished difference. Result has 95 places, 122 transitions, 1006 flow [2024-06-03 22:04:15,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1006, PETRI_PLACES=95, PETRI_TRANSITIONS=122} [2024-06-03 22:04:15,173 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2024-06-03 22:04:15,173 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 122 transitions, 1006 flow [2024-06-03 22:04:15,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:15,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:15,173 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:15,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:04:15,173 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:15,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:15,174 INFO L85 PathProgramCache]: Analyzing trace with hash 167177868, now seen corresponding path program 2 times [2024-06-03 22:04:15,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:15,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309293953] [2024-06-03 22:04:15,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:15,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:23,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:04:23,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:23,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309293953] [2024-06-03 22:04:23,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309293953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:23,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:23,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:04:23,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530596088] [2024-06-03 22:04:23,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:23,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:04:23,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:23,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:04:23,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:04:24,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:04:24,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 122 transitions, 1006 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:24,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:24,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:04:24,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:25,228 INFO L124 PetriNetUnfolderBase]: 1915/2967 cut-off events. [2024-06-03 22:04:25,228 INFO L125 PetriNetUnfolderBase]: For 45774/45779 co-relation queries the response was YES. [2024-06-03 22:04:25,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15294 conditions, 2967 events. 1915/2967 cut-off events. For 45774/45779 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14862 event pairs, 602 based on Foata normal form. 6/2969 useless extension candidates. Maximal degree in co-relation 15251. Up to 2649 conditions per place. [2024-06-03 22:04:25,248 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 103 selfloop transitions, 36 changer transitions 0/145 dead transitions. [2024-06-03 22:04:25,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 145 transitions, 1356 flow [2024-06-03 22:04:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:04:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:04:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 22:04:25,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-03 22:04:25,250 INFO L175 Difference]: Start difference. First operand has 95 places, 122 transitions, 1006 flow. Second operand 7 states and 131 transitions. [2024-06-03 22:04:25,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 145 transitions, 1356 flow [2024-06-03 22:04:25,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 145 transitions, 1293 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 22:04:25,283 INFO L231 Difference]: Finished difference. Result has 99 places, 122 transitions, 1024 flow [2024-06-03 22:04:25,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1024, PETRI_PLACES=99, PETRI_TRANSITIONS=122} [2024-06-03 22:04:25,284 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2024-06-03 22:04:25,284 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 1024 flow [2024-06-03 22:04:25,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:25,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:25,285 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:25,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:04:25,285 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:04:25,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:25,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1764060888, now seen corresponding path program 1 times [2024-06-03 22:04:25,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:25,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922771072] [2024-06-03 22:04:25,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:25,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:36,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:04:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922771072] [2024-06-03 22:04:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922771072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:36,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:36,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:04:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135165362] [2024-06-03 22:04:36,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:36,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:04:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:36,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:04:36,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:04:36,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:04:36,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 122 transitions, 1024 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:36,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:36,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:04:36,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:38,376 INFO L124 PetriNetUnfolderBase]: 2007/3113 cut-off events. [2024-06-03 22:04:38,376 INFO L125 PetriNetUnfolderBase]: For 54466/54471 co-relation queries the response was YES. [2024-06-03 22:04:38,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16221 conditions, 3113 events. 2007/3113 cut-off events. For 54466/54471 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 15840 event pairs, 542 based on Foata normal form. 24/3133 useless extension candidates. Maximal degree in co-relation 16176. Up to 2369 conditions per place. [2024-06-03 22:04:38,392 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 86 selfloop transitions, 66 changer transitions 0/158 dead transitions. [2024-06-03 22:04:38,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 158 transitions, 1460 flow [2024-06-03 22:04:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:04:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:04:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-03 22:04:38,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563953488372093 [2024-06-03 22:04:38,395 INFO L175 Difference]: Start difference. First operand has 99 places, 122 transitions, 1024 flow. Second operand 8 states and 157 transitions. [2024-06-03 22:04:38,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 158 transitions, 1460 flow [2024-06-03 22:04:38,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 158 transitions, 1379 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:04:38,430 INFO L231 Difference]: Finished difference. Result has 101 places, 124 transitions, 1117 flow [2024-06-03 22:04:38,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1117, PETRI_PLACES=101, PETRI_TRANSITIONS=124} [2024-06-03 22:04:38,431 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2024-06-03 22:04:38,431 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 124 transitions, 1117 flow [2024-06-03 22:04:38,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:04:38,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:38,432 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:38,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:04:38,432 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:04:38,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1290748935, now seen corresponding path program 1 times [2024-06-03 22:04:38,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:38,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376512033] [2024-06-03 22:04:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:04:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:04:50,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:04:50,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376512033] [2024-06-03 22:04:50,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376512033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:04:50,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:04:50,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:04:50,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833497795] [2024-06-03 22:04:50,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:04:50,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:04:50,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:04:50,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:04:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:04:50,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:04:50,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 124 transitions, 1117 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:50,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:04:50,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:04:50,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:04:51,680 INFO L124 PetriNetUnfolderBase]: 2040/3157 cut-off events. [2024-06-03 22:04:51,681 INFO L125 PetriNetUnfolderBase]: For 55733/55739 co-relation queries the response was YES. [2024-06-03 22:04:51,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17004 conditions, 3157 events. 2040/3157 cut-off events. For 55733/55739 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 15993 event pairs, 629 based on Foata normal form. 7/3161 useless extension candidates. Maximal degree in co-relation 16958. Up to 2972 conditions per place. [2024-06-03 22:04:51,698 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 124 selfloop transitions, 13 changer transitions 0/143 dead transitions. [2024-06-03 22:04:51,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 143 transitions, 1473 flow [2024-06-03 22:04:51,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:04:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:04:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-03 22:04:51,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41472868217054265 [2024-06-03 22:04:51,700 INFO L175 Difference]: Start difference. First operand has 101 places, 124 transitions, 1117 flow. Second operand 6 states and 107 transitions. [2024-06-03 22:04:51,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 143 transitions, 1473 flow [2024-06-03 22:04:51,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 143 transitions, 1333 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:04:51,741 INFO L231 Difference]: Finished difference. Result has 101 places, 127 transitions, 1044 flow [2024-06-03 22:04:51,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1044, PETRI_PLACES=101, PETRI_TRANSITIONS=127} [2024-06-03 22:04:51,741 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2024-06-03 22:04:51,741 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 127 transitions, 1044 flow [2024-06-03 22:04:51,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:51,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:04:51,742 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:51,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:04:51,742 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:04:51,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:04:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 962092038, now seen corresponding path program 2 times [2024-06-03 22:04:51,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:04:51,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139091120] [2024-06-03 22:04:51,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:04:51,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:04:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:05:01,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:01,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139091120] [2024-06-03 22:05:01,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139091120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:01,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:01,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:05:01,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887888896] [2024-06-03 22:05:01,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:01,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:05:01,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:05:01,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:05:01,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:05:01,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 127 transitions, 1044 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:01,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:01,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:05:01,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:02,821 INFO L124 PetriNetUnfolderBase]: 2057/3161 cut-off events. [2024-06-03 22:05:02,821 INFO L125 PetriNetUnfolderBase]: For 60546/60554 co-relation queries the response was YES. [2024-06-03 22:05:02,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17203 conditions, 3161 events. 2057/3161 cut-off events. For 60546/60554 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 15849 event pairs, 580 based on Foata normal form. 5/3141 useless extension candidates. Maximal degree in co-relation 17156. Up to 2583 conditions per place. [2024-06-03 22:05:02,836 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 80 selfloop transitions, 71 changer transitions 0/157 dead transitions. [2024-06-03 22:05:02,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 157 transitions, 1462 flow [2024-06-03 22:05:02,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:05:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:05:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 22:05:02,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-03 22:05:02,839 INFO L175 Difference]: Start difference. First operand has 101 places, 127 transitions, 1044 flow. Second operand 8 states and 151 transitions. [2024-06-03 22:05:02,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 157 transitions, 1462 flow [2024-06-03 22:05:02,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 157 transitions, 1419 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-03 22:05:02,880 INFO L231 Difference]: Finished difference. Result has 105 places, 129 transitions, 1186 flow [2024-06-03 22:05:02,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1186, PETRI_PLACES=105, PETRI_TRANSITIONS=129} [2024-06-03 22:05:02,881 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2024-06-03 22:05:02,881 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 129 transitions, 1186 flow [2024-06-03 22:05:02,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:02,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:02,881 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:02,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:05:02,881 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:05:02,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1183745448, now seen corresponding path program 3 times [2024-06-03 22:05:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:02,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475199472] [2024-06-03 22:05:02,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:12,694 INFO 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:12,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:12,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475199472] [2024-06-03 22:05:12,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475199472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:12,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:12,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:05:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4356723] [2024-06-03 22:05:12,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:12,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:05:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:12,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:05:12,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:05:12,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:05:12,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 129 transitions, 1186 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:12,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:12,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:05:12,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:14,335 INFO L124 PetriNetUnfolderBase]: 2074/3203 cut-off events. [2024-06-03 22:05:14,335 INFO L125 PetriNetUnfolderBase]: For 67201/67209 co-relation queries the response was YES. [2024-06-03 22:05:14,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18157 conditions, 3203 events. 2074/3203 cut-off events. For 67201/67209 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16200 event pairs, 487 based on Foata normal form. 5/3194 useless extension candidates. Maximal degree in co-relation 18109. Up to 2372 conditions per place. [2024-06-03 22:05:14,351 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 85 selfloop transitions, 80 changer transitions 0/171 dead transitions. [2024-06-03 22:05:14,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 171 transitions, 1786 flow [2024-06-03 22:05:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:05:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:05:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-03 22:05:14,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 22:05:14,354 INFO L175 Difference]: Start difference. First operand has 105 places, 129 transitions, 1186 flow. Second operand 9 states and 172 transitions. [2024-06-03 22:05:14,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 171 transitions, 1786 flow [2024-06-03 22:05:14,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 171 transitions, 1619 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-03 22:05:14,403 INFO L231 Difference]: Finished difference. Result has 108 places, 133 transitions, 1262 flow [2024-06-03 22:05:14,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1262, PETRI_PLACES=108, PETRI_TRANSITIONS=133} [2024-06-03 22:05:14,403 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 64 predicate places. [2024-06-03 22:05:14,403 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 133 transitions, 1262 flow [2024-06-03 22:05:14,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:14,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:14,404 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:14,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:05:14,404 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:05:14,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash 955605288, now seen corresponding path program 4 times [2024-06-03 22:05:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:14,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800198675] [2024-06-03 22:05:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:25,618 INFO 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:25,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:25,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800198675] [2024-06-03 22:05:25,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800198675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:25,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:05:25,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172682340] [2024-06-03 22:05:25,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:25,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:05:25,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:25,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:05:25,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:05:25,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:05:25,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 133 transitions, 1262 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:25,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:25,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:05:25,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:27,183 INFO L124 PetriNetUnfolderBase]: 2066/3176 cut-off events. [2024-06-03 22:05:27,183 INFO L125 PetriNetUnfolderBase]: For 72465/72473 co-relation queries the response was YES. [2024-06-03 22:05:27,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18374 conditions, 3176 events. 2066/3176 cut-off events. For 72465/72473 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15984 event pairs, 586 based on Foata normal form. 5/3156 useless extension candidates. Maximal degree in co-relation 18325. Up to 2595 conditions per place. [2024-06-03 22:05:27,202 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 89 selfloop transitions, 68 changer transitions 0/163 dead transitions. [2024-06-03 22:05:27,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 163 transitions, 1668 flow [2024-06-03 22:05:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:05:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:05:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-03 22:05:27,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-03 22:05:27,205 INFO L175 Difference]: Start difference. First operand has 108 places, 133 transitions, 1262 flow. Second operand 8 states and 152 transitions. [2024-06-03 22:05:27,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 163 transitions, 1668 flow [2024-06-03 22:05:27,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 163 transitions, 1478 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-03 22:05:27,268 INFO L231 Difference]: Finished difference. Result has 110 places, 133 transitions, 1216 flow [2024-06-03 22:05:27,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1216, PETRI_PLACES=110, PETRI_TRANSITIONS=133} [2024-06-03 22:05:27,268 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places. [2024-06-03 22:05:27,269 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 133 transitions, 1216 flow [2024-06-03 22:05:27,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:27,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:27,269 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,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:05:27,269 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:05:27,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:27,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1279321095, now seen corresponding path program 2 times [2024-06-03 22:05:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:27,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746024315] [2024-06-03 22:05:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:27,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:38,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:05:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:38,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746024315] [2024-06-03 22:05:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746024315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:38,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:05:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714889378] [2024-06-03 22:05:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:05:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:05:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:05:38,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:05:38,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 133 transitions, 1216 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:38,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:38,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:05:38,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:39,970 INFO L124 PetriNetUnfolderBase]: 2063/3198 cut-off events. [2024-06-03 22:05:39,971 INFO L125 PetriNetUnfolderBase]: For 75460/75478 co-relation queries the response was YES. [2024-06-03 22:05:39,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18314 conditions, 3198 events. 2063/3198 cut-off events. For 75460/75478 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16191 event pairs, 626 based on Foata normal form. 13/3204 useless extension candidates. Maximal degree in co-relation 18264. Up to 3004 conditions per place. [2024-06-03 22:05:39,989 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 123 selfloop transitions, 18 changer transitions 0/147 dead transitions. [2024-06-03 22:05:39,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 147 transitions, 1572 flow [2024-06-03 22:05:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:05:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:05:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-03 22:05:39,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3992248062015504 [2024-06-03 22:05:39,991 INFO L175 Difference]: Start difference. First operand has 110 places, 133 transitions, 1216 flow. Second operand 6 states and 103 transitions. [2024-06-03 22:05:39,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 147 transitions, 1572 flow [2024-06-03 22:05:40,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 147 transitions, 1406 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:05:40,034 INFO L231 Difference]: Finished difference. Result has 109 places, 136 transitions, 1134 flow [2024-06-03 22:05:40,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1134, PETRI_PLACES=109, PETRI_TRANSITIONS=136} [2024-06-03 22:05:40,034 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 65 predicate places. [2024-06-03 22:05:40,034 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 136 transitions, 1134 flow [2024-06-03 22:05:40,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:40,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:40,035 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:40,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:05:40,035 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:05:40,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:40,036 INFO L85 PathProgramCache]: Analyzing trace with hash 714871773, now seen corresponding path program 1 times [2024-06-03 22:05:40,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:40,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402014593] [2024-06-03 22:05:40,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:40,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:05:51,129 INFO 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:51,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:05:51,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402014593] [2024-06-03 22:05:51,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402014593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:05:51,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:05:51,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:05:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521775245] [2024-06-03 22:05:51,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:05:51,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:05:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:05:51,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:05:51,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:05:51,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:05:51,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 136 transitions, 1134 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:51,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:05:51,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:05:51,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:05:52,264 INFO L124 PetriNetUnfolderBase]: 1861/2970 cut-off events. [2024-06-03 22:05:52,264 INFO L125 PetriNetUnfolderBase]: For 69003/69005 co-relation queries the response was YES. [2024-06-03 22:05:52,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16658 conditions, 2970 events. 1861/2970 cut-off events. For 69003/69005 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15492 event pairs, 576 based on Foata normal form. 1/2968 useless extension candidates. Maximal degree in co-relation 16607. Up to 2733 conditions per place. [2024-06-03 22:05:52,279 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 133 selfloop transitions, 11 changer transitions 0/151 dead transitions. [2024-06-03 22:05:52,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 151 transitions, 1488 flow [2024-06-03 22:05:52,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:05:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:05:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-03 22:05:52,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42248062015503873 [2024-06-03 22:05:52,281 INFO L175 Difference]: Start difference. First operand has 109 places, 136 transitions, 1134 flow. Second operand 6 states and 109 transitions. [2024-06-03 22:05:52,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 151 transitions, 1488 flow [2024-06-03 22:05:52,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 151 transitions, 1426 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-03 22:05:52,324 INFO L231 Difference]: Finished difference. Result has 111 places, 139 transitions, 1136 flow [2024-06-03 22:05:52,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1136, PETRI_PLACES=111, PETRI_TRANSITIONS=139} [2024-06-03 22:05:52,325 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 67 predicate places. [2024-06-03 22:05:52,325 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 139 transitions, 1136 flow [2024-06-03 22:05:52,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:05:52,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:05:52,325 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:52,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:05:52,325 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:05:52,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:05:52,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1279315143, now seen corresponding path program 2 times [2024-06-03 22:05:52,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:05:52,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519614777] [2024-06-03 22:05:52,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:05:52,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:05:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:04,721 INFO 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:04,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519614777] [2024-06-03 22:06:04,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519614777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:04,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:04,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:06:04,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685068781] [2024-06-03 22:06:04,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:04,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:06:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:04,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:06:04,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:06:04,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:06:04,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 139 transitions, 1136 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:04,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:04,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:06:04,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:05,821 INFO L124 PetriNetUnfolderBase]: 1858/2967 cut-off events. [2024-06-03 22:06:05,822 INFO L125 PetriNetUnfolderBase]: For 73544/73549 co-relation queries the response was YES. [2024-06-03 22:06:05,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17022 conditions, 2967 events. 1858/2967 cut-off events. For 73544/73549 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 15547 event pairs, 580 based on Foata normal form. 3/2966 useless extension candidates. Maximal degree in co-relation 16970. Up to 2723 conditions per place. [2024-06-03 22:06:05,837 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 128 selfloop transitions, 16 changer transitions 0/151 dead transitions. [2024-06-03 22:06:05,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 151 transitions, 1486 flow [2024-06-03 22:06:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:06:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:06:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-03 22:06:05,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-03 22:06:05,838 INFO L175 Difference]: Start difference. First operand has 111 places, 139 transitions, 1136 flow. Second operand 6 states and 108 transitions. [2024-06-03 22:06:05,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 151 transitions, 1486 flow [2024-06-03 22:06:05,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 151 transitions, 1444 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-03 22:06:05,892 INFO L231 Difference]: Finished difference. Result has 113 places, 142 transitions, 1174 flow [2024-06-03 22:06:05,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1174, PETRI_PLACES=113, PETRI_TRANSITIONS=142} [2024-06-03 22:06:05,892 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2024-06-03 22:06:05,893 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 142 transitions, 1174 flow [2024-06-03 22:06:05,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:05,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:05,893 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:06:05,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:06:05,893 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:06:05,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:05,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1279307207, now seen corresponding path program 1 times [2024-06-03 22:06:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:05,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078290382] [2024-06-03 22:06:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:18,118 INFO 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:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:18,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078290382] [2024-06-03 22:06:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078290382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:18,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:18,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:06:18,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216902577] [2024-06-03 22:06:18,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:18,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:06:18,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:18,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:06:18,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:06:18,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:06:18,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 142 transitions, 1174 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:18,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:18,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:06:18,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:19,322 INFO L124 PetriNetUnfolderBase]: 1971/3078 cut-off events. [2024-06-03 22:06:19,322 INFO L125 PetriNetUnfolderBase]: For 78030/78032 co-relation queries the response was YES. [2024-06-03 22:06:19,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17908 conditions, 3078 events. 1971/3078 cut-off events. For 78030/78032 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 15617 event pairs, 621 based on Foata normal form. 1/3076 useless extension candidates. Maximal degree in co-relation 17855. Up to 2933 conditions per place. [2024-06-03 22:06:19,339 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 136 selfloop transitions, 14 changer transitions 0/155 dead transitions. [2024-06-03 22:06:19,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 155 transitions, 1540 flow [2024-06-03 22:06:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:06:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:06:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 22:06:19,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787375415282392 [2024-06-03 22:06:19,340 INFO L175 Difference]: Start difference. First operand has 113 places, 142 transitions, 1174 flow. Second operand 7 states and 114 transitions. [2024-06-03 22:06:19,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 155 transitions, 1540 flow [2024-06-03 22:06:19,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 155 transitions, 1482 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-03 22:06:19,384 INFO L231 Difference]: Finished difference. Result has 116 places, 145 transitions, 1194 flow [2024-06-03 22:06:19,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1194, PETRI_PLACES=116, PETRI_TRANSITIONS=145} [2024-06-03 22:06:19,387 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2024-06-03 22:06:19,387 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 145 transitions, 1194 flow [2024-06-03 22:06:19,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:19,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:19,387 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:19,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:06:19,387 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:19,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1775338006, now seen corresponding path program 1 times [2024-06-03 22:06:19,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:19,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604320546] [2024-06-03 22:06:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:19,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:32,843 INFO 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:32,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604320546] [2024-06-03 22:06:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604320546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:32,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:32,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:06:32,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564933313] [2024-06-03 22:06:32,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:32,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:06:32,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:32,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:06:32,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:06:33,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:06:33,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 145 transitions, 1194 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:33,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:33,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:06:33,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:34,387 INFO L124 PetriNetUnfolderBase]: 2188/3409 cut-off events. [2024-06-03 22:06:34,387 INFO L125 PetriNetUnfolderBase]: For 107747/107752 co-relation queries the response was YES. [2024-06-03 22:06:34,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20898 conditions, 3409 events. 2188/3409 cut-off events. For 107747/107752 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17634 event pairs, 377 based on Foata normal form. 18/3423 useless extension candidates. Maximal degree in co-relation 20844. Up to 2133 conditions per place. [2024-06-03 22:06:34,407 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 117 selfloop transitions, 71 changer transitions 0/194 dead transitions. [2024-06-03 22:06:34,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 194 transitions, 1856 flow [2024-06-03 22:06:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:06:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:06:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-03 22:06:34,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4441860465116279 [2024-06-03 22:06:34,409 INFO L175 Difference]: Start difference. First operand has 116 places, 145 transitions, 1194 flow. Second operand 10 states and 191 transitions. [2024-06-03 22:06:34,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 194 transitions, 1856 flow [2024-06-03 22:06:34,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 194 transitions, 1800 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-03 22:06:34,473 INFO L231 Difference]: Finished difference. Result has 121 places, 147 transitions, 1336 flow [2024-06-03 22:06:34,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1336, PETRI_PLACES=121, PETRI_TRANSITIONS=147} [2024-06-03 22:06:34,474 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 77 predicate places. [2024-06-03 22:06:34,474 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 147 transitions, 1336 flow [2024-06-03 22:06:34,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:34,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:34,474 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:34,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:06:34,474 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:06:34,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1863903766, now seen corresponding path program 2 times [2024-06-03 22:06:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110791658] [2024-06-03 22:06:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:45,277 INFO 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:45,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:45,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110791658] [2024-06-03 22:06:45,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110791658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:45,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:45,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:06:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638748403] [2024-06-03 22:06:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:45,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:06:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:45,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:06:45,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:06:45,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:06:45,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 147 transitions, 1336 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:45,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:45,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:06:45,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:06:46,974 INFO L124 PetriNetUnfolderBase]: 2246/3504 cut-off events. [2024-06-03 22:06:46,974 INFO L125 PetriNetUnfolderBase]: For 116246/116251 co-relation queries the response was YES. [2024-06-03 22:06:46,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21959 conditions, 3504 events. 2246/3504 cut-off events. For 116246/116251 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 18244 event pairs, 577 based on Foata normal form. 18/3518 useless extension candidates. Maximal degree in co-relation 21904. Up to 2628 conditions per place. [2024-06-03 22:06:46,995 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 118 selfloop transitions, 74 changer transitions 0/198 dead transitions. [2024-06-03 22:06:46,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 198 transitions, 1900 flow [2024-06-03 22:06:46,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:06:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:06:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-03 22:06:46,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4376321353065539 [2024-06-03 22:06:46,998 INFO L175 Difference]: Start difference. First operand has 121 places, 147 transitions, 1336 flow. Second operand 11 states and 207 transitions. [2024-06-03 22:06:46,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 198 transitions, 1900 flow [2024-06-03 22:06:47,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 198 transitions, 1806 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 22:06:47,065 INFO L231 Difference]: Finished difference. Result has 126 places, 148 transitions, 1424 flow [2024-06-03 22:06:47,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1424, PETRI_PLACES=126, PETRI_TRANSITIONS=148} [2024-06-03 22:06:47,066 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 82 predicate places. [2024-06-03 22:06:47,066 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 148 transitions, 1424 flow [2024-06-03 22:06:47,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:06:47,066 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:47,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:06:47,066 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:06:47,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:06:47,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1358808559, now seen corresponding path program 1 times [2024-06-03 22:06:47,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:06:47,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123061727] [2024-06-03 22:06:47,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:06:47,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:06:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:06:59,382 INFO 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:59,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:06:59,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123061727] [2024-06-03 22:06:59,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123061727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:06:59,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:06:59,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:06:59,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737922670] [2024-06-03 22:06:59,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:06:59,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:06:59,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:06:59,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:06:59,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:06:59,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:06:59,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 148 transitions, 1424 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:06:59,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:06:59,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:06:59,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:00,809 INFO L124 PetriNetUnfolderBase]: 2256/3529 cut-off events. [2024-06-03 22:07:00,809 INFO L125 PetriNetUnfolderBase]: For 119192/119201 co-relation queries the response was YES. [2024-06-03 22:07:00,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22581 conditions, 3529 events. 2256/3529 cut-off events. For 119192/119201 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18414 event pairs, 686 based on Foata normal form. 10/3535 useless extension candidates. Maximal degree in co-relation 22524. Up to 3208 conditions per place. [2024-06-03 22:07:00,831 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 130 selfloop transitions, 38 changer transitions 0/174 dead transitions. [2024-06-03 22:07:00,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 174 transitions, 1882 flow [2024-06-03 22:07:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:07:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:07:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 22:07:00,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-03 22:07:00,832 INFO L175 Difference]: Start difference. First operand has 126 places, 148 transitions, 1424 flow. Second operand 7 states and 131 transitions. [2024-06-03 22:07:00,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 174 transitions, 1882 flow [2024-06-03 22:07:00,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 174 transitions, 1718 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-03 22:07:00,913 INFO L231 Difference]: Finished difference. Result has 124 places, 152 transitions, 1402 flow [2024-06-03 22:07:00,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1402, PETRI_PLACES=124, PETRI_TRANSITIONS=152} [2024-06-03 22:07:00,913 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places. [2024-06-03 22:07:00,914 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 152 transitions, 1402 flow [2024-06-03 22:07:00,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:00,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:00,914 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:00,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:07:00,914 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:00,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:00,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1026075820, now seen corresponding path program 3 times [2024-06-03 22:07:00,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:00,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042347145] [2024-06-03 22:07:00,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:00,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:08,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042347145] [2024-06-03 22:07:08,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042347145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:08,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:08,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:07:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542811357] [2024-06-03 22:07:08,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:08,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:07:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:07:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:07:08,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:07:08,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 152 transitions, 1402 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:08,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:08,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:07:08,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:10,301 INFO L124 PetriNetUnfolderBase]: 2481/3846 cut-off events. [2024-06-03 22:07:10,302 INFO L125 PetriNetUnfolderBase]: For 136417/136426 co-relation queries the response was YES. [2024-06-03 22:07:10,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24597 conditions, 3846 events. 2481/3846 cut-off events. For 136417/136426 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20202 event pairs, 493 based on Foata normal form. 24/3866 useless extension candidates. Maximal degree in co-relation 24539. Up to 2949 conditions per place. [2024-06-03 22:07:10,327 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 129 selfloop transitions, 76 changer transitions 0/209 dead transitions. [2024-06-03 22:07:10,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 209 transitions, 2148 flow [2024-06-03 22:07:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:07:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:07:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-06-03 22:07:10,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249471458773784 [2024-06-03 22:07:10,330 INFO L175 Difference]: Start difference. First operand has 124 places, 152 transitions, 1402 flow. Second operand 11 states and 201 transitions. [2024-06-03 22:07:10,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 209 transitions, 2148 flow [2024-06-03 22:07:10,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 209 transitions, 2036 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-03 22:07:10,430 INFO L231 Difference]: Finished difference. Result has 130 places, 154 transitions, 1506 flow [2024-06-03 22:07:10,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1506, PETRI_PLACES=130, PETRI_TRANSITIONS=154} [2024-06-03 22:07:10,431 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 86 predicate places. [2024-06-03 22:07:10,431 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 154 transitions, 1506 flow [2024-06-03 22:07:10,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:10,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:10,431 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,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:07:10,431 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:10,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:10,432 INFO L85 PathProgramCache]: Analyzing trace with hash 235452828, now seen corresponding path program 4 times [2024-06-03 22:07:10,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:10,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811577435] [2024-06-03 22:07:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:10,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:17,990 INFO 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:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811577435] [2024-06-03 22:07:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811577435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:17,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:17,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:07:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895900634] [2024-06-03 22:07:17,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:17,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:07:17,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:17,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:07:17,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:07:18,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:07:18,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 154 transitions, 1506 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:07:18,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:18,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:07:18,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:19,701 INFO L124 PetriNetUnfolderBase]: 2450/3859 cut-off events. [2024-06-03 22:07:19,701 INFO L125 PetriNetUnfolderBase]: For 149301/149306 co-relation queries the response was YES. [2024-06-03 22:07:19,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25264 conditions, 3859 events. 2450/3859 cut-off events. For 149301/149306 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20870 event pairs, 662 based on Foata normal form. 20/3875 useless extension candidates. Maximal degree in co-relation 25205. Up to 3121 conditions per place. [2024-06-03 22:07:19,726 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 119 selfloop transitions, 64 changer transitions 0/189 dead transitions. [2024-06-03 22:07:19,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 189 transitions, 2006 flow [2024-06-03 22:07:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:07:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:07:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-03 22:07:19,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-03 22:07:19,728 INFO L175 Difference]: Start difference. First operand has 130 places, 154 transitions, 1506 flow. Second operand 8 states and 156 transitions. [2024-06-03 22:07:19,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 189 transitions, 2006 flow [2024-06-03 22:07:19,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 189 transitions, 1889 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-03 22:07:19,854 INFO L231 Difference]: Finished difference. Result has 131 places, 155 transitions, 1558 flow [2024-06-03 22:07:19,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1558, PETRI_PLACES=131, PETRI_TRANSITIONS=155} [2024-06-03 22:07:19,854 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 87 predicate places. [2024-06-03 22:07:19,855 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 155 transitions, 1558 flow [2024-06-03 22:07:19,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:07:19,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:19,855 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:19,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:07:19,855 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:19,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash 230090448, now seen corresponding path program 5 times [2024-06-03 22:07:19,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:19,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265142499] [2024-06-03 22:07:19,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:19,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:27,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265142499] [2024-06-03 22:07:27,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265142499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:27,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:27,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:07:27,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826928610] [2024-06-03 22:07:27,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:27,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:07:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:07:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:07:27,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:07:27,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 155 transitions, 1558 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:07:27,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:27,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:07:27,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:29,352 INFO L124 PetriNetUnfolderBase]: 2525/3990 cut-off events. [2024-06-03 22:07:29,353 INFO L125 PetriNetUnfolderBase]: For 158347/158356 co-relation queries the response was YES. [2024-06-03 22:07:29,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26204 conditions, 3990 events. 2525/3990 cut-off events. For 158347/158356 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 21825 event pairs, 686 based on Foata normal form. 26/4012 useless extension candidates. Maximal degree in co-relation 26143. Up to 3246 conditions per place. [2024-06-03 22:07:29,377 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 122 selfloop transitions, 66 changer transitions 0/194 dead transitions. [2024-06-03 22:07:29,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 194 transitions, 2086 flow [2024-06-03 22:07:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:07:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:07:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-03 22:07:29,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-03 22:07:29,395 INFO L175 Difference]: Start difference. First operand has 131 places, 155 transitions, 1558 flow. Second operand 8 states and 160 transitions. [2024-06-03 22:07:29,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 194 transitions, 2086 flow [2024-06-03 22:07:29,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 194 transitions, 1947 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:07:29,485 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 1592 flow [2024-06-03 22:07:29,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1592, PETRI_PLACES=133, PETRI_TRANSITIONS=156} [2024-06-03 22:07:29,486 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places. [2024-06-03 22:07:29,486 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 1592 flow [2024-06-03 22:07:29,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:07:29,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:29,486 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:29,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:07:29,487 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:07:29,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1148688192, now seen corresponding path program 1 times [2024-06-03 22:07:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:29,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713148252] [2024-06-03 22:07:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:29,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:41,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:41,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713148252] [2024-06-03 22:07:41,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713148252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:41,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:41,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:07:41,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698255843] [2024-06-03 22:07:41,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:41,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:07:41,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:41,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:07:41,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:07:41,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:07:41,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 156 transitions, 1592 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:41,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:41,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:07:41,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:43,449 INFO L124 PetriNetUnfolderBase]: 2566/4065 cut-off events. [2024-06-03 22:07:43,449 INFO L125 PetriNetUnfolderBase]: For 163641/163646 co-relation queries the response was YES. [2024-06-03 22:07:43,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26756 conditions, 4065 events. 2566/4065 cut-off events. For 163641/163646 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 22469 event pairs, 678 based on Foata normal form. 12/4073 useless extension candidates. Maximal degree in co-relation 26694. Up to 2912 conditions per place. [2024-06-03 22:07:43,476 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 120 selfloop transitions, 67 changer transitions 0/193 dead transitions. [2024-06-03 22:07:43,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 193 transitions, 2110 flow [2024-06-03 22:07:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:07:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:07:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-03 22:07:43,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563953488372093 [2024-06-03 22:07:43,483 INFO L175 Difference]: Start difference. First operand has 133 places, 156 transitions, 1592 flow. Second operand 8 states and 157 transitions. [2024-06-03 22:07:43,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 193 transitions, 2110 flow [2024-06-03 22:07:43,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 193 transitions, 1965 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 22:07:43,704 INFO L231 Difference]: Finished difference. Result has 135 places, 157 transitions, 1620 flow [2024-06-03 22:07:43,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1620, PETRI_PLACES=135, PETRI_TRANSITIONS=157} [2024-06-03 22:07:43,705 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places. [2024-06-03 22:07:43,705 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 157 transitions, 1620 flow [2024-06-03 22:07:43,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:43,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:43,705 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:43,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:07:43,705 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:07:43,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:43,706 INFO L85 PathProgramCache]: Analyzing trace with hash -408579181, now seen corresponding path program 1 times [2024-06-03 22:07:43,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:43,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898754237] [2024-06-03 22:07:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:07:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:07:56,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:07:56,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898754237] [2024-06-03 22:07:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898754237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:07:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:07:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:07:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683684095] [2024-06-03 22:07:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:07:56,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:07:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:07:56,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:07:56,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:07:56,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:07:56,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 157 transitions, 1620 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:56,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:07:56,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:07:56,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:07:57,860 INFO L124 PetriNetUnfolderBase]: 2677/4180 cut-off events. [2024-06-03 22:07:57,860 INFO L125 PetriNetUnfolderBase]: For 165182/165188 co-relation queries the response was YES. [2024-06-03 22:07:57,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27455 conditions, 4180 events. 2677/4180 cut-off events. For 165182/165188 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 22710 event pairs, 838 based on Foata normal form. 7/4184 useless extension candidates. Maximal degree in co-relation 27392. Up to 4049 conditions per place. [2024-06-03 22:07:57,886 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 157 selfloop transitions, 16 changer transitions 0/177 dead transitions. [2024-06-03 22:07:57,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 177 transitions, 2064 flow [2024-06-03 22:07:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:07:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:07:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 22:07:57,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787375415282392 [2024-06-03 22:07:57,887 INFO L175 Difference]: Start difference. First operand has 135 places, 157 transitions, 1620 flow. Second operand 7 states and 114 transitions. [2024-06-03 22:07:57,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 177 transitions, 2064 flow [2024-06-03 22:07:58,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 177 transitions, 1911 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-03 22:07:58,045 INFO L231 Difference]: Finished difference. Result has 136 places, 160 transitions, 1553 flow [2024-06-03 22:07:58,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1553, PETRI_PLACES=136, PETRI_TRANSITIONS=160} [2024-06-03 22:07:58,046 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 92 predicate places. [2024-06-03 22:07:58,046 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 160 transitions, 1553 flow [2024-06-03 22:07:58,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:07:58,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:07:58,046 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:58,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:07:58,047 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:07:58,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:07:58,047 INFO L85 PathProgramCache]: Analyzing trace with hash -408579553, now seen corresponding path program 2 times [2024-06-03 22:07:58,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:07:58,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989306586] [2024-06-03 22:07:58,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:07:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:07:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:09,896 INFO 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:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989306586] [2024-06-03 22:08:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989306586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:09,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:09,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:08:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397883124] [2024-06-03 22:08:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:09,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:08:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:08:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:08:10,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:08:10,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 160 transitions, 1553 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:10,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:10,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:08:10,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:11,446 INFO L124 PetriNetUnfolderBase]: 2611/4130 cut-off events. [2024-06-03 22:08:11,446 INFO L125 PetriNetUnfolderBase]: For 174339/174344 co-relation queries the response was YES. [2024-06-03 22:08:11,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27440 conditions, 4130 events. 2611/4130 cut-off events. For 174339/174344 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22892 event pairs, 798 based on Foata normal form. 4/4130 useless extension candidates. Maximal degree in co-relation 27376. Up to 3748 conditions per place. [2024-06-03 22:08:11,474 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 136 selfloop transitions, 41 changer transitions 0/184 dead transitions. [2024-06-03 22:08:11,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 184 transitions, 2139 flow [2024-06-03 22:08:11,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:08:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:08:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 22:08:11,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-03 22:08:11,475 INFO L175 Difference]: Start difference. First operand has 136 places, 160 transitions, 1553 flow. Second operand 7 states and 127 transitions. [2024-06-03 22:08:11,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 184 transitions, 2139 flow [2024-06-03 22:08:11,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 184 transitions, 2075 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 22:08:11,651 INFO L231 Difference]: Finished difference. Result has 139 places, 168 transitions, 1722 flow [2024-06-03 22:08:11,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1722, PETRI_PLACES=139, PETRI_TRANSITIONS=168} [2024-06-03 22:08:11,652 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 95 predicate places. [2024-06-03 22:08:11,652 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 168 transitions, 1722 flow [2024-06-03 22:08:11,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:11,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:11,652 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:08:11,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:08:11,652 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:08:11,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash -50670318, now seen corresponding path program 6 times [2024-06-03 22:08:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154025331] [2024-06-03 22:08:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:08:19,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154025331] [2024-06-03 22:08:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154025331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:19,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:08:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665993867] [2024-06-03 22:08:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:19,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:08:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:19,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:08:19,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:08:19,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:08:19,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 168 transitions, 1722 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:08:19,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:19,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:08:19,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:21,189 INFO L124 PetriNetUnfolderBase]: 2575/4074 cut-off events. [2024-06-03 22:08:21,189 INFO L125 PetriNetUnfolderBase]: For 185117/185128 co-relation queries the response was YES. [2024-06-03 22:08:21,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27462 conditions, 4074 events. 2575/4074 cut-off events. For 185117/185128 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 22447 event pairs, 693 based on Foata normal form. 23/4082 useless extension candidates. Maximal degree in co-relation 27396. Up to 3332 conditions per place. [2024-06-03 22:08:21,215 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 131 selfloop transitions, 61 changer transitions 0/199 dead transitions. [2024-06-03 22:08:21,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 199 transitions, 2204 flow [2024-06-03 22:08:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:08:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:08:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 22:08:21,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-03 22:08:21,219 INFO L175 Difference]: Start difference. First operand has 139 places, 168 transitions, 1722 flow. Second operand 8 states and 151 transitions. [2024-06-03 22:08:21,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 199 transitions, 2204 flow [2024-06-03 22:08:21,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 199 transitions, 2099 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-06-03 22:08:21,392 INFO L231 Difference]: Finished difference. Result has 144 places, 168 transitions, 1746 flow [2024-06-03 22:08:21,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1746, PETRI_PLACES=144, PETRI_TRANSITIONS=168} [2024-06-03 22:08:21,394 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places. [2024-06-03 22:08:21,394 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 168 transitions, 1746 flow [2024-06-03 22:08:21,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:08:21,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:21,394 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:08:21,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:08:21,394 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:08:21,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1512892958, now seen corresponding path program 2 times [2024-06-03 22:08:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:21,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416782916] [2024-06-03 22:08:21,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:31,967 INFO 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:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416782916] [2024-06-03 22:08:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416782916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:31,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:31,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:08:31,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663034795] [2024-06-03 22:08:31,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:31,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:08:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:31,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:08:31,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:08:32,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:08:32,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 168 transitions, 1746 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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:32,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:32,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:08:32,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:33,826 INFO L124 PetriNetUnfolderBase]: 2555/4042 cut-off events. [2024-06-03 22:08:33,826 INFO L125 PetriNetUnfolderBase]: For 181762/181773 co-relation queries the response was YES. [2024-06-03 22:08:33,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27272 conditions, 4042 events. 2555/4042 cut-off events. For 181762/181773 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 22227 event pairs, 664 based on Foata normal form. 15/4042 useless extension candidates. Maximal degree in co-relation 27204. Up to 3213 conditions per place. [2024-06-03 22:08:33,854 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 131 selfloop transitions, 63 changer transitions 0/201 dead transitions. [2024-06-03 22:08:33,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 201 transitions, 2244 flow [2024-06-03 22:08:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:08:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:08:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-03 22:08:33,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44476744186046513 [2024-06-03 22:08:33,857 INFO L175 Difference]: Start difference. First operand has 144 places, 168 transitions, 1746 flow. Second operand 8 states and 153 transitions. [2024-06-03 22:08:33,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 201 transitions, 2244 flow [2024-06-03 22:08:34,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 201 transitions, 2093 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:08:34,032 INFO L231 Difference]: Finished difference. Result has 145 places, 168 transitions, 1727 flow [2024-06-03 22:08:34,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1727, PETRI_PLACES=145, PETRI_TRANSITIONS=168} [2024-06-03 22:08:34,033 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 101 predicate places. [2024-06-03 22:08:34,033 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 168 transitions, 1727 flow [2024-06-03 22:08:34,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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:34,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:34,034 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:08:34,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:08:34,034 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:08:34,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:34,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1761984158, now seen corresponding path program 3 times [2024-06-03 22:08:34,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:34,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826733551] [2024-06-03 22:08:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:43,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:08:43,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:43,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826733551] [2024-06-03 22:08:43,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826733551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:43,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:43,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:08:43,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141203198] [2024-06-03 22:08:43,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:43,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:08:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:43,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:08:43,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:08:43,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:08:43,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 168 transitions, 1727 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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:43,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:43,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:08:43,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:45,298 INFO L124 PetriNetUnfolderBase]: 2535/4010 cut-off events. [2024-06-03 22:08:45,298 INFO L125 PetriNetUnfolderBase]: For 182077/182088 co-relation queries the response was YES. [2024-06-03 22:08:45,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26759 conditions, 4010 events. 2535/4010 cut-off events. For 182077/182088 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 22007 event pairs, 598 based on Foata normal form. 15/4010 useless extension candidates. Maximal degree in co-relation 26690. Up to 2531 conditions per place. [2024-06-03 22:08:45,328 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 122 selfloop transitions, 71 changer transitions 0/200 dead transitions. [2024-06-03 22:08:45,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 200 transitions, 2163 flow [2024-06-03 22:08:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:08:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:08:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 22:08:45,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-03 22:08:45,332 INFO L175 Difference]: Start difference. First operand has 145 places, 168 transitions, 1727 flow. Second operand 8 states and 151 transitions. [2024-06-03 22:08:45,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 200 transitions, 2163 flow [2024-06-03 22:08:45,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 200 transitions, 1941 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:08:45,507 INFO L231 Difference]: Finished difference. Result has 144 places, 167 transitions, 1591 flow [2024-06-03 22:08:45,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1591, PETRI_PLACES=144, PETRI_TRANSITIONS=167} [2024-06-03 22:08:45,508 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places. [2024-06-03 22:08:45,508 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 167 transitions, 1591 flow [2024-06-03 22:08:45,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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:45,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:45,509 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:08:45,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:08:45,509 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:08:45,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1003830907, now seen corresponding path program 2 times [2024-06-03 22:08:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836451355] [2024-06-03 22:08:45,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:45,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:08:57,874 INFO 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:57,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:08:57,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836451355] [2024-06-03 22:08:57,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836451355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:08:57,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:08:57,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:08:57,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582525558] [2024-06-03 22:08:57,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:08:57,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:08:57,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:08:57,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:08:57,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:08:58,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:08:58,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 167 transitions, 1591 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:58,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:08:58,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:08:58,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:08:59,297 INFO L124 PetriNetUnfolderBase]: 2634/4116 cut-off events. [2024-06-03 22:08:59,298 INFO L125 PetriNetUnfolderBase]: For 182039/182057 co-relation queries the response was YES. [2024-06-03 22:08:59,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27015 conditions, 4116 events. 2634/4116 cut-off events. For 182039/182057 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 22268 event pairs, 783 based on Foata normal form. 13/4122 useless extension candidates. Maximal degree in co-relation 26946. Up to 3959 conditions per place. [2024-06-03 22:08:59,327 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 153 selfloop transitions, 29 changer transitions 0/186 dead transitions. [2024-06-03 22:08:59,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 186 transitions, 2181 flow [2024-06-03 22:08:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:08:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:08:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-03 22:08:59,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3687707641196013 [2024-06-03 22:08:59,329 INFO L175 Difference]: Start difference. First operand has 144 places, 167 transitions, 1591 flow. Second operand 7 states and 111 transitions. [2024-06-03 22:08:59,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 186 transitions, 2181 flow [2024-06-03 22:08:59,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 186 transitions, 1982 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-03 22:08:59,521 INFO L231 Difference]: Finished difference. Result has 144 places, 173 transitions, 1566 flow [2024-06-03 22:08:59,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1566, PETRI_PLACES=144, PETRI_TRANSITIONS=173} [2024-06-03 22:08:59,522 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places. [2024-06-03 22:08:59,522 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 173 transitions, 1566 flow [2024-06-03 22:08:59,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:08:59,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:08:59,523 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:08:59,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:08:59,523 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:08:59,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:08:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash -398402563, now seen corresponding path program 3 times [2024-06-03 22:08:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:08:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541923795] [2024-06-03 22:08:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:08:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:08:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:11,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:11,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541923795] [2024-06-03 22:09:11,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541923795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:11,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:11,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:09:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871494289] [2024-06-03 22:09:11,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:11,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:09:11,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:11,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:09:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:09:11,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:09:11,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 173 transitions, 1566 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:11,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:11,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:09:11,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:13,063 INFO L124 PetriNetUnfolderBase]: 2544/4024 cut-off events. [2024-06-03 22:09:13,064 INFO L125 PetriNetUnfolderBase]: For 190857/190868 co-relation queries the response was YES. [2024-06-03 22:09:13,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26308 conditions, 4024 events. 2544/4024 cut-off events. For 190857/190868 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22111 event pairs, 769 based on Foata normal form. 5/4014 useless extension candidates. Maximal degree in co-relation 26239. Up to 3608 conditions per place. [2024-06-03 22:09:13,095 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 130 selfloop transitions, 54 changer transitions 0/193 dead transitions. [2024-06-03 22:09:13,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 193 transitions, 2264 flow [2024-06-03 22:09:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 22:09:13,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119601328903654 [2024-06-03 22:09:13,096 INFO L175 Difference]: Start difference. First operand has 144 places, 173 transitions, 1566 flow. Second operand 7 states and 124 transitions. [2024-06-03 22:09:13,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 193 transitions, 2264 flow [2024-06-03 22:09:13,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 193 transitions, 2193 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-03 22:09:13,262 INFO L231 Difference]: Finished difference. Result has 149 places, 181 transitions, 1765 flow [2024-06-03 22:09:13,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1765, PETRI_PLACES=149, PETRI_TRANSITIONS=181} [2024-06-03 22:09:13,262 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 105 predicate places. [2024-06-03 22:09:13,262 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 181 transitions, 1765 flow [2024-06-03 22:09:13,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:13,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:13,263 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:09:13,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:09:13,263 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:13,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:13,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1004246617, now seen corresponding path program 3 times [2024-06-03 22:09:13,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:13,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731253872] [2024-06-03 22:09:13,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:13,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:26,271 INFO 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:26,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:26,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731253872] [2024-06-03 22:09:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731253872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:26,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:26,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:09:26,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139703626] [2024-06-03 22:09:26,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:26,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:09:26,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:26,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:09:26,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:09:26,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:09:26,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 181 transitions, 1765 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:26,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:26,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:09:26,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:27,649 INFO L124 PetriNetUnfolderBase]: 2635/4119 cut-off events. [2024-06-03 22:09:27,649 INFO L125 PetriNetUnfolderBase]: For 200705/200723 co-relation queries the response was YES. [2024-06-03 22:09:27,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27615 conditions, 4119 events. 2635/4119 cut-off events. For 200705/200723 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22289 event pairs, 782 based on Foata normal form. 13/4125 useless extension candidates. Maximal degree in co-relation 27543. Up to 3962 conditions per place. [2024-06-03 22:09:27,679 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 161 selfloop transitions, 28 changer transitions 0/193 dead transitions. [2024-06-03 22:09:27,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 193 transitions, 2183 flow [2024-06-03 22:09:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-03 22:09:27,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3687707641196013 [2024-06-03 22:09:27,681 INFO L175 Difference]: Start difference. First operand has 149 places, 181 transitions, 1765 flow. Second operand 7 states and 111 transitions. [2024-06-03 22:09:27,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 193 transitions, 2183 flow [2024-06-03 22:09:27,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 193 transitions, 1983 flow, removed 59 selfloop flow, removed 4 redundant places. [2024-06-03 22:09:27,911 INFO L231 Difference]: Finished difference. Result has 152 places, 181 transitions, 1627 flow [2024-06-03 22:09:27,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1627, PETRI_PLACES=152, PETRI_TRANSITIONS=181} [2024-06-03 22:09:27,911 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 108 predicate places. [2024-06-03 22:09:27,911 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 181 transitions, 1627 flow [2024-06-03 22:09:27,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:27,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:27,912 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:09:27,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:09:27,912 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:09:27,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:27,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1181313781, now seen corresponding path program 1 times [2024-06-03 22:09:27,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:27,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564496594] [2024-06-03 22:09:27,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:27,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:39,568 INFO 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:39,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564496594] [2024-06-03 22:09:39,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564496594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:39,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:39,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:09:39,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837518823] [2024-06-03 22:09:39,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:39,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:09:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:39,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:09:39,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:09:39,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:09:39,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 181 transitions, 1627 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:09:39,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:39,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:09:39,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:40,999 INFO L124 PetriNetUnfolderBase]: 2347/3800 cut-off events. [2024-06-03 22:09:41,000 INFO L125 PetriNetUnfolderBase]: For 177843/177845 co-relation queries the response was YES. [2024-06-03 22:09:41,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24393 conditions, 3800 events. 2347/3800 cut-off events. For 177843/177845 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 21378 event pairs, 661 based on Foata normal form. 2/3799 useless extension candidates. Maximal degree in co-relation 24320. Up to 3507 conditions per place. [2024-06-03 22:09:41,027 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 177 selfloop transitions, 17 changer transitions 0/204 dead transitions. [2024-06-03 22:09:41,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 204 transitions, 2121 flow [2024-06-03 22:09:41,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 22:09:41,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-03 22:09:41,028 INFO L175 Difference]: Start difference. First operand has 152 places, 181 transitions, 1627 flow. Second operand 7 states and 127 transitions. [2024-06-03 22:09:41,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 204 transitions, 2121 flow [2024-06-03 22:09:41,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 204 transitions, 2047 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 22:09:41,215 INFO L231 Difference]: Finished difference. Result has 154 places, 187 transitions, 1661 flow [2024-06-03 22:09:41,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1661, PETRI_PLACES=154, PETRI_TRANSITIONS=187} [2024-06-03 22:09:41,217 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places. [2024-06-03 22:09:41,217 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 187 transitions, 1661 flow [2024-06-03 22:09:41,217 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:09:41,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:41,217 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:09:41,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:09:41,217 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:09:41,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:41,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1181193625, now seen corresponding path program 1 times [2024-06-03 22:09:41,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:41,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705851058] [2024-06-03 22:09:41,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:41,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:09:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:09:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:09:53,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705851058] [2024-06-03 22:09:53,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705851058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:09:53,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:09:53,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:09:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062597215] [2024-06-03 22:09:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:09:53,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:09:53,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:09:53,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:09:53,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:09:53,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:09:53,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 187 transitions, 1661 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:53,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:09:53,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:09:53,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:09:54,698 INFO L124 PetriNetUnfolderBase]: 2446/3893 cut-off events. [2024-06-03 22:09:54,698 INFO L125 PetriNetUnfolderBase]: For 183900/183902 co-relation queries the response was YES. [2024-06-03 22:09:54,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25584 conditions, 3893 events. 2446/3893 cut-off events. For 183900/183902 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21448 event pairs, 694 based on Foata normal form. 1/3891 useless extension candidates. Maximal degree in co-relation 25509. Up to 3718 conditions per place. [2024-06-03 22:09:54,727 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 184 selfloop transitions, 14 changer transitions 0/203 dead transitions. [2024-06-03 22:09:54,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 203 transitions, 2141 flow [2024-06-03 22:09:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:09:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:09:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 22:09:54,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3853820598006645 [2024-06-03 22:09:54,729 INFO L175 Difference]: Start difference. First operand has 154 places, 187 transitions, 1661 flow. Second operand 7 states and 116 transitions. [2024-06-03 22:09:54,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 203 transitions, 2141 flow [2024-06-03 22:09:54,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 203 transitions, 2087 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-03 22:09:54,955 INFO L231 Difference]: Finished difference. Result has 158 places, 190 transitions, 1693 flow [2024-06-03 22:09:54,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1693, PETRI_PLACES=158, PETRI_TRANSITIONS=190} [2024-06-03 22:09:54,956 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 114 predicate places. [2024-06-03 22:09:54,956 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 190 transitions, 1693 flow [2024-06-03 22:09:54,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:09:54,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:09:54,956 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:09:54,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:09:54,957 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:09:54,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:09:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash 537456023, now seen corresponding path program 2 times [2024-06-03 22:09:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:09:54,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067574004] [2024-06-03 22:09:54,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:09:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:09:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:07,657 INFO 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,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:07,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067574004] [2024-06-03 22:10:07,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067574004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:07,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:07,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:10:07,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302830212] [2024-06-03 22:10:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:07,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:10:07,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:07,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:10:07,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:10:07,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:10:07,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 190 transitions, 1693 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:10:07,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:07,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:10:07,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:09,148 INFO L124 PetriNetUnfolderBase]: 2380/3834 cut-off events. [2024-06-03 22:10:09,149 INFO L125 PetriNetUnfolderBase]: For 195649/195651 co-relation queries the response was YES. [2024-06-03 22:10:09,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25849 conditions, 3834 events. 2380/3834 cut-off events. For 195649/195651 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21460 event pairs, 660 based on Foata normal form. 2/3833 useless extension candidates. Maximal degree in co-relation 25773. Up to 3534 conditions per place. [2024-06-03 22:10:09,174 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 177 selfloop transitions, 24 changer transitions 0/212 dead transitions. [2024-06-03 22:10:09,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 212 transitions, 2333 flow [2024-06-03 22:10:09,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:10:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:10:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-03 22:10:09,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42524916943521596 [2024-06-03 22:10:09,175 INFO L175 Difference]: Start difference. First operand has 158 places, 190 transitions, 1693 flow. Second operand 7 states and 128 transitions. [2024-06-03 22:10:09,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 212 transitions, 2333 flow [2024-06-03 22:10:09,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 212 transitions, 2269 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-03 22:10:09,346 INFO L231 Difference]: Finished difference. Result has 160 places, 196 transitions, 1789 flow [2024-06-03 22:10:09,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1789, PETRI_PLACES=160, PETRI_TRANSITIONS=196} [2024-06-03 22:10:09,347 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 116 predicate places. [2024-06-03 22:10:09,347 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 196 transitions, 1789 flow [2024-06-03 22:10:09,347 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:10:09,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:09,348 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:10:09,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:10:09,348 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:09,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash -148755451, now seen corresponding path program 2 times [2024-06-03 22:10:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:09,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485896827] [2024-06-03 22:10:09,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:09,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:21,521 INFO 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:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:21,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485896827] [2024-06-03 22:10:21,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485896827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:21,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:10:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930448178] [2024-06-03 22:10:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:21,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:10:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:21,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:10:21,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:10:21,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:10:21,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 196 transitions, 1789 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:21,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:21,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:10:21,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:22,996 INFO L124 PetriNetUnfolderBase]: 2469/3926 cut-off events. [2024-06-03 22:10:22,996 INFO L125 PetriNetUnfolderBase]: For 203113/203121 co-relation queries the response was YES. [2024-06-03 22:10:23,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26776 conditions, 3926 events. 2469/3926 cut-off events. For 203113/203121 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 21676 event pairs, 714 based on Foata normal form. 5/3927 useless extension candidates. Maximal degree in co-relation 26699. Up to 3734 conditions per place. [2024-06-03 22:10:23,024 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 182 selfloop transitions, 26 changer transitions 0/213 dead transitions. [2024-06-03 22:10:23,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 213 transitions, 2435 flow [2024-06-03 22:10:23,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:10:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:10:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 22:10:23,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3920265780730897 [2024-06-03 22:10:23,026 INFO L175 Difference]: Start difference. First operand has 160 places, 196 transitions, 1789 flow. Second operand 7 states and 118 transitions. [2024-06-03 22:10:23,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 213 transitions, 2435 flow [2024-06-03 22:10:23,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 213 transitions, 2361 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-03 22:10:23,230 INFO L231 Difference]: Finished difference. Result has 163 places, 202 transitions, 1887 flow [2024-06-03 22:10:23,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1887, PETRI_PLACES=163, PETRI_TRANSITIONS=202} [2024-06-03 22:10:23,231 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 119 predicate places. [2024-06-03 22:10:23,231 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 202 transitions, 1887 flow [2024-06-03 22:10:23,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:23,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:23,231 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:10:23,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:10:23,232 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:23,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1176552181, now seen corresponding path program 3 times [2024-06-03 22:10:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:23,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287941513] [2024-06-03 22:10:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:35,489 INFO 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:35,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:35,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287941513] [2024-06-03 22:10:35,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287941513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:35,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:35,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:10:35,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164762050] [2024-06-03 22:10:35,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:35,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:10:35,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:35,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:10:35,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:10:35,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-03 22:10:35,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 202 transitions, 1887 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:10:35,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:35,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-03 22:10:35,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:36,896 INFO L124 PetriNetUnfolderBase]: 2356/3833 cut-off events. [2024-06-03 22:10:36,896 INFO L125 PetriNetUnfolderBase]: For 213216/213224 co-relation queries the response was YES. [2024-06-03 22:10:36,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26482 conditions, 3833 events. 2356/3833 cut-off events. For 213216/213224 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21725 event pairs, 669 based on Foata normal form. 3/3832 useless extension candidates. Maximal degree in co-relation 26404. Up to 3496 conditions per place. [2024-06-03 22:10:36,925 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 174 selfloop transitions, 31 changer transitions 0/218 dead transitions. [2024-06-03 22:10:36,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 218 transitions, 2485 flow [2024-06-03 22:10:36,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:10:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:10:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 22:10:36,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-03 22:10:36,927 INFO L175 Difference]: Start difference. First operand has 163 places, 202 transitions, 1887 flow. Second operand 7 states and 127 transitions. [2024-06-03 22:10:36,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 218 transitions, 2485 flow [2024-06-03 22:10:37,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 218 transitions, 2411 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-03 22:10:37,251 INFO L231 Difference]: Finished difference. Result has 167 places, 205 transitions, 1943 flow [2024-06-03 22:10:37,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1943, PETRI_PLACES=167, PETRI_TRANSITIONS=205} [2024-06-03 22:10:37,252 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 123 predicate places. [2024-06-03 22:10:37,252 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 205 transitions, 1943 flow [2024-06-03 22:10:37,252 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:10:37,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:37,252 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:10:37,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:10:37,253 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:10:37,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:37,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1003824955, now seen corresponding path program 3 times [2024-06-03 22:10:37,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:37,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745862724] [2024-06-03 22:10:37,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:10:49,061 INFO 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:49,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:10:49,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745862724] [2024-06-03 22:10:49,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745862724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:10:49,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:10:49,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:10:49,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008981105] [2024-06-03 22:10:49,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:10:49,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:10:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:10:49,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:10:49,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:10:49,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:10:49,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 205 transitions, 1943 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:49,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:10:49,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:10:49,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:10:50,429 INFO L124 PetriNetUnfolderBase]: 2460/3914 cut-off events. [2024-06-03 22:10:50,429 INFO L125 PetriNetUnfolderBase]: For 215079/215087 co-relation queries the response was YES. [2024-06-03 22:10:50,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27351 conditions, 3914 events. 2460/3914 cut-off events. For 215079/215087 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21579 event pairs, 713 based on Foata normal form. 5/3915 useless extension candidates. Maximal degree in co-relation 27271. Up to 3723 conditions per place. [2024-06-03 22:10:50,458 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 183 selfloop transitions, 27 changer transitions 0/215 dead transitions. [2024-06-03 22:10:50,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 215 transitions, 2391 flow [2024-06-03 22:10:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:10:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:10:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 22:10:50,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3853820598006645 [2024-06-03 22:10:50,459 INFO L175 Difference]: Start difference. First operand has 167 places, 205 transitions, 1943 flow. Second operand 7 states and 116 transitions. [2024-06-03 22:10:50,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 215 transitions, 2391 flow [2024-06-03 22:10:50,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 215 transitions, 2251 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-03 22:10:50,709 INFO L231 Difference]: Finished difference. Result has 169 places, 205 transitions, 1863 flow [2024-06-03 22:10:50,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1803, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1863, PETRI_PLACES=169, PETRI_TRANSITIONS=205} [2024-06-03 22:10:50,713 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 125 predicate places. [2024-06-03 22:10:50,713 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 205 transitions, 1863 flow [2024-06-03 22:10:50,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:10:50,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:10:50,718 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:50,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:10:50,719 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:10:50,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:10:50,719 INFO L85 PathProgramCache]: Analyzing trace with hash 826609295, now seen corresponding path program 1 times [2024-06-03 22:10:50,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:10:50,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614679776] [2024-06-03 22:10:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:10:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:10:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:03,467 INFO 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:03,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:03,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614679776] [2024-06-03 22:11:03,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614679776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:03,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:03,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:03,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965339707] [2024-06-03 22:11:03,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:03,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:03,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:03,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:03,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:11:03,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 205 transitions, 1863 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:03,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:03,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:11:03,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:05,039 INFO L124 PetriNetUnfolderBase]: 2674/4169 cut-off events. [2024-06-03 22:11:05,039 INFO L125 PetriNetUnfolderBase]: For 265869/265881 co-relation queries the response was YES. [2024-06-03 22:11:05,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30307 conditions, 4169 events. 2674/4169 cut-off events. For 265869/265881 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22540 event pairs, 746 based on Foata normal form. 12/4177 useless extension candidates. Maximal degree in co-relation 30226. Up to 3909 conditions per place. [2024-06-03 22:11:05,070 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 186 selfloop transitions, 42 changer transitions 0/232 dead transitions. [2024-06-03 22:11:05,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 232 transitions, 2465 flow [2024-06-03 22:11:05,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:11:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:11:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-03 22:11:05,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39825581395348836 [2024-06-03 22:11:05,076 INFO L175 Difference]: Start difference. First operand has 169 places, 205 transitions, 1863 flow. Second operand 8 states and 137 transitions. [2024-06-03 22:11:05,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 232 transitions, 2465 flow [2024-06-03 22:11:05,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 232 transitions, 2401 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 22:11:05,317 INFO L231 Difference]: Finished difference. Result has 171 places, 209 transitions, 1970 flow [2024-06-03 22:11:05,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1799, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1970, PETRI_PLACES=171, PETRI_TRANSITIONS=209} [2024-06-03 22:11:05,318 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 127 predicate places. [2024-06-03 22:11:05,318 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 209 transitions, 1970 flow [2024-06-03 22:11:05,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:05,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:05,318 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:05,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:11:05,318 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:05,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash 213227116, now seen corresponding path program 1 times [2024-06-03 22:11:05,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:05,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427987781] [2024-06-03 22:11:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:05,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:18,089 INFO 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:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427987781] [2024-06-03 22:11:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427987781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:18,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:18,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:11:18,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609461518] [2024-06-03 22:11:18,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:18,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:11:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:18,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:11:18,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:11:18,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:11:18,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 209 transitions, 1970 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:18,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:18,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:11:18,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:19,640 INFO L124 PetriNetUnfolderBase]: 2612/4106 cut-off events. [2024-06-03 22:11:19,641 INFO L125 PetriNetUnfolderBase]: For 279033/279041 co-relation queries the response was YES. [2024-06-03 22:11:19,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30900 conditions, 4106 events. 2612/4106 cut-off events. For 279033/279041 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22531 event pairs, 719 based on Foata normal form. 6/4108 useless extension candidates. Maximal degree in co-relation 30818. Up to 3754 conditions per place. [2024-06-03 22:11:19,675 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 181 selfloop transitions, 38 changer transitions 0/232 dead transitions. [2024-06-03 22:11:19,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 232 transitions, 2525 flow [2024-06-03 22:11:19,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:11:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:11:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 22:11:19,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-03 22:11:19,677 INFO L175 Difference]: Start difference. First operand has 171 places, 209 transitions, 1970 flow. Second operand 7 states and 127 transitions. [2024-06-03 22:11:19,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 232 transitions, 2525 flow [2024-06-03 22:11:20,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 232 transitions, 2382 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-03 22:11:20,022 INFO L231 Difference]: Finished difference. Result has 172 places, 213 transitions, 1977 flow [2024-06-03 22:11:20,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1827, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1977, PETRI_PLACES=172, PETRI_TRANSITIONS=213} [2024-06-03 22:11:20,023 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 128 predicate places. [2024-06-03 22:11:20,023 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 213 transitions, 1977 flow [2024-06-03 22:11:20,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:20,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:20,024 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:20,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:11:20,024 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:20,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:20,024 INFO L85 PathProgramCache]: Analyzing trace with hash 835867352, now seen corresponding path program 2 times [2024-06-03 22:11:20,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:20,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187102756] [2024-06-03 22:11:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:20,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:32,722 INFO 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:32,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:32,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187102756] [2024-06-03 22:11:32,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187102756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:32,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:32,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:11:32,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190889858] [2024-06-03 22:11:32,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:32,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:11:32,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:32,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:11:32,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:11:32,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:11:32,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 213 transitions, 1977 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:32,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:32,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:11:32,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:34,238 INFO L124 PetriNetUnfolderBase]: 2614/4108 cut-off events. [2024-06-03 22:11:34,239 INFO L125 PetriNetUnfolderBase]: For 287989/287997 co-relation queries the response was YES. [2024-06-03 22:11:34,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31017 conditions, 4108 events. 2614/4108 cut-off events. For 287989/287997 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22477 event pairs, 720 based on Foata normal form. 6/4110 useless extension candidates. Maximal degree in co-relation 30934. Up to 3717 conditions per place. [2024-06-03 22:11:34,270 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 172 selfloop transitions, 47 changer transitions 0/232 dead transitions. [2024-06-03 22:11:34,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 232 transitions, 2619 flow [2024-06-03 22:11:34,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:11:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:11:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-03 22:11:34,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-03 22:11:34,272 INFO L175 Difference]: Start difference. First operand has 172 places, 213 transitions, 1977 flow. Second operand 7 states and 126 transitions. [2024-06-03 22:11:34,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 232 transitions, 2619 flow [2024-06-03 22:11:34,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 232 transitions, 2514 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 22:11:34,625 INFO L231 Difference]: Finished difference. Result has 174 places, 216 transitions, 2033 flow [2024-06-03 22:11:34,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2033, PETRI_PLACES=174, PETRI_TRANSITIONS=216} [2024-06-03 22:11:34,626 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 130 predicate places. [2024-06-03 22:11:34,626 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 216 transitions, 2033 flow [2024-06-03 22:11:34,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:34,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:34,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:11:34,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:11:34,626 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:34,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash -693068215, now seen corresponding path program 2 times [2024-06-03 22:11:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:34,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956992229] [2024-06-03 22:11:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:11:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:11:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:11:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956992229] [2024-06-03 22:11:46,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956992229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:11:46,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:11:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:11:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091563553] [2024-06-03 22:11:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:11:46,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:11:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:11:46,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:11:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:11:46,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:11:46,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 216 transitions, 2033 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:46,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:11:46,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:11:46,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:11:48,011 INFO L124 PetriNetUnfolderBase]: 2722/4237 cut-off events. [2024-06-03 22:11:48,011 INFO L125 PetriNetUnfolderBase]: For 301639/301647 co-relation queries the response was YES. [2024-06-03 22:11:48,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32107 conditions, 4237 events. 2722/4237 cut-off events. For 301639/301647 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22986 event pairs, 753 based on Foata normal form. 6/4239 useless extension candidates. Maximal degree in co-relation 32023. Up to 3891 conditions per place. [2024-06-03 22:11:48,046 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 183 selfloop transitions, 56 changer transitions 0/243 dead transitions. [2024-06-03 22:11:48,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 243 transitions, 2953 flow [2024-06-03 22:11:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:11:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:11:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 22:11:48,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39244186046511625 [2024-06-03 22:11:48,053 INFO L175 Difference]: Start difference. First operand has 174 places, 216 transitions, 2033 flow. Second operand 8 states and 135 transitions. [2024-06-03 22:11:48,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 243 transitions, 2953 flow [2024-06-03 22:11:48,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 243 transitions, 2847 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-03 22:11:48,439 INFO L231 Difference]: Finished difference. Result has 179 places, 224 transitions, 2225 flow [2024-06-03 22:11:48,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2225, PETRI_PLACES=179, PETRI_TRANSITIONS=224} [2024-06-03 22:11:48,440 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places. [2024-06-03 22:11:48,440 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 224 transitions, 2225 flow [2024-06-03 22:11:48,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:11:48,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:11:48,440 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:48,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:11:48,440 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:11:48,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:11:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash 835875288, now seen corresponding path program 1 times [2024-06-03 22:11:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:11:48,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496069552] [2024-06-03 22:11:48,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:11:48,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:11:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:01,449 INFO 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:01,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:01,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496069552] [2024-06-03 22:12:01,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496069552] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:01,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:01,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:12:01,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464467517] [2024-06-03 22:12:01,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:01,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:12:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:01,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:12:01,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:12:01,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:12:01,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 224 transitions, 2225 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:01,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:01,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:12:01,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:03,048 INFO L124 PetriNetUnfolderBase]: 2727/4246 cut-off events. [2024-06-03 22:12:03,048 INFO L125 PetriNetUnfolderBase]: For 315793/315799 co-relation queries the response was YES. [2024-06-03 22:12:03,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33019 conditions, 4246 events. 2727/4246 cut-off events. For 315793/315799 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 23061 event pairs, 757 based on Foata normal form. 7/4250 useless extension candidates. Maximal degree in co-relation 32933. Up to 4103 conditions per place. [2024-06-03 22:12:03,086 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 222 selfloop transitions, 19 changer transitions 0/245 dead transitions. [2024-06-03 22:12:03,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 245 transitions, 2827 flow [2024-06-03 22:12:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:12:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:12:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-03 22:12:03,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633720930232558 [2024-06-03 22:12:03,087 INFO L175 Difference]: Start difference. First operand has 179 places, 224 transitions, 2225 flow. Second operand 8 states and 125 transitions. [2024-06-03 22:12:03,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 245 transitions, 2827 flow [2024-06-03 22:12:03,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 245 transitions, 2678 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-03 22:12:03,619 INFO L231 Difference]: Finished difference. Result has 183 places, 227 transitions, 2188 flow [2024-06-03 22:12:03,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2188, PETRI_PLACES=183, PETRI_TRANSITIONS=227} [2024-06-03 22:12:03,620 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 139 predicate places. [2024-06-03 22:12:03,620 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 227 transitions, 2188 flow [2024-06-03 22:12:03,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:03,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:03,620 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:12:03,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:12:03,620 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:03,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1437781873, now seen corresponding path program 3 times [2024-06-03 22:12:03,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:03,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457686304] [2024-06-03 22:12:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:15,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:12:15,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:15,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457686304] [2024-06-03 22:12:15,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457686304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:15,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:15,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:12:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240354700] [2024-06-03 22:12:15,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:15,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:12:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:12:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:12:15,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:12:15,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 227 transitions, 2188 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:15,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:15,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:12:15,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:17,433 INFO L124 PetriNetUnfolderBase]: 2731/4250 cut-off events. [2024-06-03 22:12:17,433 INFO L125 PetriNetUnfolderBase]: For 322931/322939 co-relation queries the response was YES. [2024-06-03 22:12:17,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33354 conditions, 4250 events. 2731/4250 cut-off events. For 322931/322939 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 23040 event pairs, 744 based on Foata normal form. 6/4252 useless extension candidates. Maximal degree in co-relation 33266. Up to 3905 conditions per place. [2024-06-03 22:12:17,463 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 184 selfloop transitions, 60 changer transitions 0/248 dead transitions. [2024-06-03 22:12:17,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 248 transitions, 2909 flow [2024-06-03 22:12:17,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:12:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:12:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 22:12:17,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39244186046511625 [2024-06-03 22:12:17,465 INFO L175 Difference]: Start difference. First operand has 183 places, 227 transitions, 2188 flow. Second operand 8 states and 135 transitions. [2024-06-03 22:12:17,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 248 transitions, 2909 flow [2024-06-03 22:12:17,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 248 transitions, 2819 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-03 22:12:17,943 INFO L231 Difference]: Finished difference. Result has 185 places, 231 transitions, 2304 flow [2024-06-03 22:12:17,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2304, PETRI_PLACES=185, PETRI_TRANSITIONS=231} [2024-06-03 22:12:17,943 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 141 predicate places. [2024-06-03 22:12:17,944 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 231 transitions, 2304 flow [2024-06-03 22:12:17,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:17,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:17,944 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:12:17,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:12:17,944 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:17,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1427859160, now seen corresponding path program 3 times [2024-06-03 22:12:17,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:17,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503295810] [2024-06-03 22:12:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:17,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:30,688 INFO 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:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503295810] [2024-06-03 22:12:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503295810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:30,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:12:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372126371] [2024-06-03 22:12:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:30,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:12:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:30,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:12:30,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:12:30,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:12:30,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 231 transitions, 2304 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:30,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:30,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:12:30,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:32,334 INFO L124 PetriNetUnfolderBase]: 2652/4167 cut-off events. [2024-06-03 22:12:32,334 INFO L125 PetriNetUnfolderBase]: For 333092/333094 co-relation queries the response was YES. [2024-06-03 22:12:32,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33318 conditions, 4167 events. 2652/4167 cut-off events. For 333092/333094 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22740 event pairs, 719 based on Foata normal form. 3/4157 useless extension candidates. Maximal degree in co-relation 33229. Up to 3804 conditions per place. [2024-06-03 22:12:32,364 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 194 selfloop transitions, 41 changer transitions 0/251 dead transitions. [2024-06-03 22:12:32,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 251 transitions, 2865 flow [2024-06-03 22:12:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:12:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:12:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 22:12:32,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3953488372093023 [2024-06-03 22:12:32,374 INFO L175 Difference]: Start difference. First operand has 185 places, 231 transitions, 2304 flow. Second operand 8 states and 136 transitions. [2024-06-03 22:12:32,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 251 transitions, 2865 flow [2024-06-03 22:12:32,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 251 transitions, 2692 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-03 22:12:32,872 INFO L231 Difference]: Finished difference. Result has 189 places, 233 transitions, 2248 flow [2024-06-03 22:12:32,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2135, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2248, PETRI_PLACES=189, PETRI_TRANSITIONS=233} [2024-06-03 22:12:32,872 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 145 predicate places. [2024-06-03 22:12:32,872 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 233 transitions, 2248 flow [2024-06-03 22:12:32,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:32,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:32,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:12:32,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:12:32,873 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:32,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash -518738898, now seen corresponding path program 4 times [2024-06-03 22:12:32,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:32,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459738951] [2024-06-03 22:12:32,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:32,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:12:44,942 INFO 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:44,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:12:44,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459738951] [2024-06-03 22:12:44,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459738951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:12:44,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:12:44,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:12:44,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102043629] [2024-06-03 22:12:44,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:12:44,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:12:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:12:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:12:44,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:12:45,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:12:45,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 233 transitions, 2248 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:45,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:12:45,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:12:45,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:12:46,518 INFO L124 PetriNetUnfolderBase]: 2657/4171 cut-off events. [2024-06-03 22:12:46,519 INFO L125 PetriNetUnfolderBase]: For 343988/343998 co-relation queries the response was YES. [2024-06-03 22:12:46,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33480 conditions, 4171 events. 2657/4171 cut-off events. For 343988/343998 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22807 event pairs, 720 based on Foata normal form. 3/4160 useless extension candidates. Maximal degree in co-relation 33389. Up to 3791 conditions per place. [2024-06-03 22:12:46,551 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 185 selfloop transitions, 48 changer transitions 0/249 dead transitions. [2024-06-03 22:12:46,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 249 transitions, 2806 flow [2024-06-03 22:12:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:12:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:12:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-03 22:12:46,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40863787375415284 [2024-06-03 22:12:46,553 INFO L175 Difference]: Start difference. First operand has 189 places, 233 transitions, 2248 flow. Second operand 7 states and 123 transitions. [2024-06-03 22:12:46,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 249 transitions, 2806 flow [2024-06-03 22:12:46,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 249 transitions, 2685 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:12:46,979 INFO L231 Difference]: Finished difference. Result has 190 places, 236 transitions, 2287 flow [2024-06-03 22:12:46,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2127, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2287, PETRI_PLACES=190, PETRI_TRANSITIONS=236} [2024-06-03 22:12:46,980 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 146 predicate places. [2024-06-03 22:12:46,980 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 236 transitions, 2287 flow [2024-06-03 22:12:46,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:12:46,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:12:46,980 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:12:46,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:12:46,980 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:46,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:12:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash -316463878, now seen corresponding path program 5 times [2024-06-03 22:12:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:12:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289960662] [2024-06-03 22:12:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:12:46,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:12:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:00,124 INFO 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,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:00,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289960662] [2024-06-03 22:13:00,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289960662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:00,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:00,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:13:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869787630] [2024-06-03 22:13:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:00,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:13:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:00,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:13:00,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:13:00,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:13:00,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 236 transitions, 2287 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:00,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:00,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:13:00,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:01,646 INFO L124 PetriNetUnfolderBase]: 2662/4179 cut-off events. [2024-06-03 22:13:01,647 INFO L125 PetriNetUnfolderBase]: For 355865/355881 co-relation queries the response was YES. [2024-06-03 22:13:01,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33742 conditions, 4179 events. 2662/4179 cut-off events. For 355865/355881 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22839 event pairs, 741 based on Foata normal form. 7/4171 useless extension candidates. Maximal degree in co-relation 33649. Up to 3734 conditions per place. [2024-06-03 22:13:01,685 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 165 selfloop transitions, 68 changer transitions 0/249 dead transitions. [2024-06-03 22:13:01,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 249 transitions, 2951 flow [2024-06-03 22:13:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:13:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:13:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 22:13:01,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053156146179402 [2024-06-03 22:13:01,687 INFO L175 Difference]: Start difference. First operand has 190 places, 236 transitions, 2287 flow. Second operand 7 states and 122 transitions. [2024-06-03 22:13:01,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 249 transitions, 2951 flow [2024-06-03 22:13:02,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 249 transitions, 2823 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-03 22:13:02,182 INFO L231 Difference]: Finished difference. Result has 192 places, 239 transitions, 2359 flow [2024-06-03 22:13:02,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2159, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2359, PETRI_PLACES=192, PETRI_TRANSITIONS=239} [2024-06-03 22:13:02,183 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 148 predicate places. [2024-06-03 22:13:02,183 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 239 transitions, 2359 flow [2024-06-03 22:13:02,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:02,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:02,183 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:13:02,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:13:02,183 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,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:02,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1061373766, now seen corresponding path program 6 times [2024-06-03 22:13:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:02,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548278509] [2024-06-03 22:13:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:14,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:14,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548278509] [2024-06-03 22:13:14,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548278509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:14,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:14,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:13:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105912597] [2024-06-03 22:13:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:14,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:13:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:14,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:13:14,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:13:14,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-03 22:13:14,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 239 transitions, 2359 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:14,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:14,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-03 22:13:14,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:16,006 INFO L124 PetriNetUnfolderBase]: 2654/4169 cut-off events. [2024-06-03 22:13:16,006 INFO L125 PetriNetUnfolderBase]: For 365523/365539 co-relation queries the response was YES. [2024-06-03 22:13:16,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33758 conditions, 4169 events. 2654/4169 cut-off events. For 365523/365539 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22799 event pairs, 742 based on Foata normal form. 8/4162 useless extension candidates. Maximal degree in co-relation 33664. Up to 3726 conditions per place. [2024-06-03 22:13:16,043 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 168 selfloop transitions, 64 changer transitions 0/248 dead transitions. [2024-06-03 22:13:16,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 248 transitions, 2847 flow [2024-06-03 22:13:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:13:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:13:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 22:13:16,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053156146179402 [2024-06-03 22:13:16,044 INFO L175 Difference]: Start difference. First operand has 192 places, 239 transitions, 2359 flow. Second operand 7 states and 122 transitions. [2024-06-03 22:13:16,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 248 transitions, 2847 flow [2024-06-03 22:13:16,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 248 transitions, 2646 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-03 22:13:16,577 INFO L231 Difference]: Finished difference. Result has 195 places, 239 transitions, 2294 flow [2024-06-03 22:13:16,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2294, PETRI_PLACES=195, PETRI_TRANSITIONS=239} [2024-06-03 22:13:16,578 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places. [2024-06-03 22:13:16,578 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 239 transitions, 2294 flow [2024-06-03 22:13:16,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:16,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:16,578 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:13:16,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:13:16,579 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:16,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:16,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1066484550, now seen corresponding path program 2 times [2024-06-03 22:13:16,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:16,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136041581] [2024-06-03 22:13:16,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:16,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:30,141 INFO 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:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136041581] [2024-06-03 22:13:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136041581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:30,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:30,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:13:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361347783] [2024-06-03 22:13:30,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:30,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:13:30,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:30,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:13:30,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:13:30,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:13:30,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 239 transitions, 2294 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:30,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:30,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:13:30,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:31,958 INFO L124 PetriNetUnfolderBase]: 2731/4256 cut-off events. [2024-06-03 22:13:31,958 INFO L125 PetriNetUnfolderBase]: For 373557/373575 co-relation queries the response was YES. [2024-06-03 22:13:31,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34271 conditions, 4256 events. 2731/4256 cut-off events. For 373557/373575 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 23003 event pairs, 751 based on Foata normal form. 13/4262 useless extension candidates. Maximal degree in co-relation 34176. Up to 4082 conditions per place. [2024-06-03 22:13:31,990 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 217 selfloop transitions, 39 changer transitions 0/260 dead transitions. [2024-06-03 22:13:31,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 260 transitions, 3115 flow [2024-06-03 22:13:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:13:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:13:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-03 22:13:31,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36046511627906974 [2024-06-03 22:13:31,992 INFO L175 Difference]: Start difference. First operand has 195 places, 239 transitions, 2294 flow. Second operand 8 states and 124 transitions. [2024-06-03 22:13:31,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 260 transitions, 3115 flow [2024-06-03 22:13:32,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 260 transitions, 2960 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-03 22:13:32,635 INFO L231 Difference]: Finished difference. Result has 197 places, 247 transitions, 2393 flow [2024-06-03 22:13:32,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2139, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2393, PETRI_PLACES=197, PETRI_TRANSITIONS=247} [2024-06-03 22:13:32,636 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 153 predicate places. [2024-06-03 22:13:32,636 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 247 transitions, 2393 flow [2024-06-03 22:13:32,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:32,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:32,636 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:13:32,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:13:32,637 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:32,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:32,637 INFO L85 PathProgramCache]: Analyzing trace with hash -309282852, now seen corresponding path program 3 times [2024-06-03 22:13:32,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:32,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923260158] [2024-06-03 22:13:32,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:32,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:13:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:13:45,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:13:45,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923260158] [2024-06-03 22:13:45,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923260158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:13:45,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:13:45,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:13:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364024886] [2024-06-03 22:13:45,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:13:45,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:13:45,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:13:45,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:13:45,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:13:45,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:13:45,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 247 transitions, 2393 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:45,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:13:45,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:13:45,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:13:46,794 INFO L124 PetriNetUnfolderBase]: 2736/4261 cut-off events. [2024-06-03 22:13:46,794 INFO L125 PetriNetUnfolderBase]: For 387372/387390 co-relation queries the response was YES. [2024-06-03 22:13:46,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34739 conditions, 4261 events. 2736/4261 cut-off events. For 387372/387390 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 23012 event pairs, 751 based on Foata normal form. 13/4267 useless extension candidates. Maximal degree in co-relation 34642. Up to 4088 conditions per place. [2024-06-03 22:13:46,827 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 219 selfloop transitions, 40 changer transitions 0/263 dead transitions. [2024-06-03 22:13:46,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 263 transitions, 3153 flow [2024-06-03 22:13:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:13:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:13:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-03 22:13:46,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633720930232558 [2024-06-03 22:13:46,829 INFO L175 Difference]: Start difference. First operand has 197 places, 247 transitions, 2393 flow. Second operand 8 states and 125 transitions. [2024-06-03 22:13:46,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 263 transitions, 3153 flow [2024-06-03 22:13:47,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 263 transitions, 3030 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-03 22:13:47,281 INFO L231 Difference]: Finished difference. Result has 201 places, 250 transitions, 2435 flow [2024-06-03 22:13:47,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2435, PETRI_PLACES=201, PETRI_TRANSITIONS=250} [2024-06-03 22:13:47,282 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 157 predicate places. [2024-06-03 22:13:47,282 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 250 transitions, 2435 flow [2024-06-03 22:13:47,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:13:47,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:13:47,282 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:13:47,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:13:47,282 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:47,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:13:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1389730753, now seen corresponding path program 4 times [2024-06-03 22:13:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:13:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182176806] [2024-06-03 22:13:47,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:13:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:13:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:14:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:00,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182176806] [2024-06-03 22:14:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182176806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:14:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008629418] [2024-06-03 22:14:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:00,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:14:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:14:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:14:00,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:14:00,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 250 transitions, 2435 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:00,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:00,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:14:00,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:01,986 INFO L124 PetriNetUnfolderBase]: 2754/4280 cut-off events. [2024-06-03 22:14:01,987 INFO L125 PetriNetUnfolderBase]: For 402133/402149 co-relation queries the response was YES. [2024-06-03 22:14:02,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35232 conditions, 4280 events. 2754/4280 cut-off events. For 402133/402149 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 23119 event pairs, 773 based on Foata normal form. 8/4273 useless extension candidates. Maximal degree in co-relation 35133. Up to 3845 conditions per place. [2024-06-03 22:14:02,023 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 178 selfloop transitions, 93 changer transitions 0/275 dead transitions. [2024-06-03 22:14:02,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 275 transitions, 3647 flow [2024-06-03 22:14:02,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:14:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:14:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 22:14:02,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39244186046511625 [2024-06-03 22:14:02,025 INFO L175 Difference]: Start difference. First operand has 201 places, 250 transitions, 2435 flow. Second operand 8 states and 135 transitions. [2024-06-03 22:14:02,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 275 transitions, 3647 flow [2024-06-03 22:14:02,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 275 transitions, 3536 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-03 22:14:02,620 INFO L231 Difference]: Finished difference. Result has 205 places, 262 transitions, 2825 flow [2024-06-03 22:14:02,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2825, PETRI_PLACES=205, PETRI_TRANSITIONS=262} [2024-06-03 22:14:02,620 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 161 predicate places. [2024-06-03 22:14:02,620 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 262 transitions, 2825 flow [2024-06-03 22:14:02,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:02,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:02,621 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:14:02,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:14:02,621 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:14:02,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1066872763, now seen corresponding path program 5 times [2024-06-03 22:14:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:02,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269397869] [2024-06-03 22:14:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:15,956 INFO 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,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269397869] [2024-06-03 22:14:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269397869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:15,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:15,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:14:15,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474448744] [2024-06-03 22:14:15,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:15,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:14:15,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:15,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:14:15,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:14:16,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:14:16,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 262 transitions, 2825 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:16,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:16,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:14:16,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:17,560 INFO L124 PetriNetUnfolderBase]: 2782/4324 cut-off events. [2024-06-03 22:14:17,560 INFO L125 PetriNetUnfolderBase]: For 422801/422814 co-relation queries the response was YES. [2024-06-03 22:14:17,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36751 conditions, 4324 events. 2782/4324 cut-off events. For 422801/422814 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23337 event pairs, 775 based on Foata normal form. 7/4316 useless extension candidates. Maximal degree in co-relation 36650. Up to 3873 conditions per place. [2024-06-03 22:14:17,598 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 183 selfloop transitions, 96 changer transitions 0/283 dead transitions. [2024-06-03 22:14:17,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 283 transitions, 3986 flow [2024-06-03 22:14:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:14:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:14:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 22:14:17,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39244186046511625 [2024-06-03 22:14:17,600 INFO L175 Difference]: Start difference. First operand has 205 places, 262 transitions, 2825 flow. Second operand 8 states and 135 transitions. [2024-06-03 22:14:17,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 283 transitions, 3986 flow [2024-06-03 22:14:18,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 283 transitions, 3680 flow, removed 95 selfloop flow, removed 4 redundant places. [2024-06-03 22:14:18,329 INFO L231 Difference]: Finished difference. Result has 210 places, 270 transitions, 2937 flow [2024-06-03 22:14:18,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2567, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2937, PETRI_PLACES=210, PETRI_TRANSITIONS=270} [2024-06-03 22:14:18,329 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 166 predicate places. [2024-06-03 22:14:18,330 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 270 transitions, 2937 flow [2024-06-03 22:14:18,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:18,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:18,330 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:14:18,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:14:18,330 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:18,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1053985753, now seen corresponding path program 6 times [2024-06-03 22:14:18,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:18,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192491264] [2024-06-03 22:14:18,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:18,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:31,005 INFO 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:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192491264] [2024-06-03 22:14:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192491264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:31,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:31,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:14:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955466109] [2024-06-03 22:14:31,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:31,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:14:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:14:31,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:14:31,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-03 22:14:31,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 270 transitions, 2937 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:31,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:31,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-03 22:14:31,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:32,746 INFO L124 PetriNetUnfolderBase]: 2778/4320 cut-off events. [2024-06-03 22:14:32,747 INFO L125 PetriNetUnfolderBase]: For 427640/427653 co-relation queries the response was YES. [2024-06-03 22:14:32,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36207 conditions, 4320 events. 2778/4320 cut-off events. For 427640/427653 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 23340 event pairs, 773 based on Foata normal form. 7/4312 useless extension candidates. Maximal degree in co-relation 36104. Up to 3871 conditions per place. [2024-06-03 22:14:32,782 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 176 selfloop transitions, 102 changer transitions 0/282 dead transitions. [2024-06-03 22:14:32,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 282 transitions, 3775 flow [2024-06-03 22:14:32,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:14:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:14:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-03 22:14:32,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3866279069767442 [2024-06-03 22:14:32,783 INFO L175 Difference]: Start difference. First operand has 210 places, 270 transitions, 2937 flow. Second operand 8 states and 133 transitions. [2024-06-03 22:14:32,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 282 transitions, 3775 flow [2024-06-03 22:14:33,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 282 transitions, 3505 flow, removed 62 selfloop flow, removed 4 redundant places. [2024-06-03 22:14:33,518 INFO L231 Difference]: Finished difference. Result has 214 places, 270 transitions, 2879 flow [2024-06-03 22:14:33,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2667, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2879, PETRI_PLACES=214, PETRI_TRANSITIONS=270} [2024-06-03 22:14:33,518 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 170 predicate places. [2024-06-03 22:14:33,518 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 270 transitions, 2879 flow [2024-06-03 22:14:33,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:33,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:33,519 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:14:33,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:14:33,519 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:33,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash -322169862, now seen corresponding path program 4 times [2024-06-03 22:14:33,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:33,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008494157] [2024-06-03 22:14:33,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:33,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15