./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-04 17:26:37,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:26:37,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:26:37,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:26:37,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:26:37,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:26:37,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:26:37,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:26:37,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:26:37,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:26:37,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:26:37,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:26:37,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:26:37,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:26:37,795 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:26:37,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:26:37,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:26:37,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:26:37,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:26:37,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:26:37,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:26:37,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:26:37,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:26:37,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:26:37,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:26:37,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:26:37,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:26:37,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:26:37,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:26:37,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:26:37,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:26:37,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:26:37,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:26:37,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:26:37,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:26:37,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:26:37,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:26:37,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:26:37,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:26:37,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:26:37,801 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:26:37,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:26:37,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:26:37,802 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-04 17:26:37,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:26:38,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:26:38,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:26:38,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:26:38,013 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:26:38,014 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-04 17:26:38,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:26:39,193 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:26:39,194 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-04 17:26:39,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640ca3bba/a1b36fa5b74540f1adee6253fb3a8e11/FLAG891855001 [2024-06-04 17:26:39,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640ca3bba/a1b36fa5b74540f1adee6253fb3a8e11 [2024-06-04 17:26:39,223 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:26:39,223 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:26:39,224 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-04 17:26:39,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:26:39,433 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:26:39,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:26:39,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:26:39,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:26:39,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:26:39" (1/2) ... [2024-06-04 17:26:39,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa0b15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:26:39, skipping insertion in model container [2024-06-04 17:26:39,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:26:39" (1/2) ... [2024-06-04 17:26:39,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5de1e199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:26:39, skipping insertion in model container [2024-06-04 17:26:39,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:26:39" (2/2) ... [2024-06-04 17:26:39,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa0b15a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:39, skipping insertion in model container [2024-06-04 17:26:39,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:26:39" (2/2) ... [2024-06-04 17:26:39,441 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:26:39,513 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:26:39,514 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-04 17:26:39,515 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-04 17:26:39,516 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-04 17:26:39,516 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:26:39,516 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-04 17:26:39,552 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:26:39,831 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:26:39,844 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:26:40,142 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:26:40,169 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:26:40,169 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40 WrapperNode [2024-06-04 17:26:40,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:26:40,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:26:40,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:26:40,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:26:40,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,365 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-06-04 17:26:40,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:26:40,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:26:40,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:26:40,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:26:40,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,461 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-04 17:26:40,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:26:40,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:26:40,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:26:40,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:26:40,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (1/1) ... [2024-06-04 17:26:40,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:26:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:26:40,583 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-04 17:26:40,592 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-04 17:26:40,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:26:40,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:26:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:26:40,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:26:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:26:40,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:26:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 17:26:40,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 17:26:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:26:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:26:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:26:40,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:26:40,611 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 17:26:40,748 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:26:40,750 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:26:41,944 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:26:41,946 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:26:42,215 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:26:42,216 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:26:42,216 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:26:42 BoogieIcfgContainer [2024-06-04 17:26:42,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:26:42,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:26:42,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:26:42,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:26:42,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:26:39" (1/4) ... [2024-06-04 17:26:42,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb81409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:26:42, skipping insertion in model container [2024-06-04 17:26:42,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:26:39" (2/4) ... [2024-06-04 17:26:42,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb81409 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:26:42, skipping insertion in model container [2024-06-04 17:26:42,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:26:40" (3/4) ... [2024-06-04 17:26:42,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb81409 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:26:42, skipping insertion in model container [2024-06-04 17:26:42,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:26:42" (4/4) ... [2024-06-04 17:26:42,224 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-04 17:26:42,237 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:26:42,237 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 17:26:42,238 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:26:42,339 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:26:42,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow [2024-06-04 17:26:42,434 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-06-04 17:26:42,434 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:26:42,436 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-04 17:26:42,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow [2024-06-04 17:26:42,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2024-06-04 17:26:42,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:26:42,456 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;@d6f145b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:26:42,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 17:26:42,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:26:42,464 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:26:42,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:26:42,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:42,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:26:42,466 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-04 17:26:42,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1464887810, now seen corresponding path program 1 times [2024-06-04 17:26:42,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:42,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324308553] [2024-06-04 17:26:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:48,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:48,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324308553] [2024-06-04 17:26:48,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324308553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:48,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:48,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:26:48,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159799410] [2024-06-04 17:26:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:48,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:26:48,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:48,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:26:48,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:26:48,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 17:26:48,361 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-04 17:26:48,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:48,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 17:26:48,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:49,299 INFO L124 PetriNetUnfolderBase]: 1359/2150 cut-off events. [2024-06-04 17:26:49,300 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-04 17:26:49,306 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-04 17:26:49,316 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 34 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-04 17:26:49,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 179 flow [2024-06-04 17:26:49,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:26:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:26:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-04 17:26:49,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5736434108527132 [2024-06-04 17:26:49,328 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 74 transitions. [2024-06-04 17:26:49,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 179 flow [2024-06-04 17:26:49,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 17:26:49,334 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow [2024-06-04 17:26:49,336 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-04 17:26:49,338 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-06-04 17:26:49,339 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow [2024-06-04 17:26:49,339 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-04 17:26:49,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:49,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:49,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:26:49,340 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-04 17:26:49,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:49,340 INFO L85 PathProgramCache]: Analyzing trace with hash 992120349, now seen corresponding path program 1 times [2024-06-04 17:26:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:49,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680093149] [2024-06-04 17:26:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:49,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:53,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:53,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680093149] [2024-06-04 17:26:53,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680093149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:53,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:53,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:26:53,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040842300] [2024-06-04 17:26:53,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:53,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:26:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:26:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:26:53,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:26:53,873 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-04 17:26:53,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:53,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:26:53,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:54,694 INFO L124 PetriNetUnfolderBase]: 1560/2388 cut-off events. [2024-06-04 17:26:54,694 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2024-06-04 17:26:54,697 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-04 17:26:54,707 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 42 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-06-04 17:26:54,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 248 flow [2024-06-04 17:26:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:26:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:26:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-06-04 17:26:54,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2024-06-04 17:26:54,710 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 92 transitions. [2024-06-04 17:26:54,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 248 flow [2024-06-04 17:26:54,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:26:54,714 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow [2024-06-04 17:26:54,715 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-04 17:26:54,715 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2024-06-04 17:26:54,715 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow [2024-06-04 17:26:54,716 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-04 17:26:54,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:54,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:54,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:26:54,718 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-04 17:26:54,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:54,719 INFO L85 PathProgramCache]: Analyzing trace with hash 690960829, now seen corresponding path program 1 times [2024-06-04 17:26:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:54,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962343345] [2024-06-04 17:26:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:58,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-04 17:26:58,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962343345] [2024-06-04 17:26:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962343345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:58,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:26:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584458636] [2024-06-04 17:26:58,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:58,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:26:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:58,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:26:58,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:26:58,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:26:58,727 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-04 17:26:58,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:58,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:26:58,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:59,627 INFO L124 PetriNetUnfolderBase]: 1568/2407 cut-off events. [2024-06-04 17:26:59,628 INFO L125 PetriNetUnfolderBase]: For 1320/1320 co-relation queries the response was YES. [2024-06-04 17:26:59,630 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-04 17:26:59,637 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 16 changer transitions 0/76 dead transitions. [2024-06-04 17:26:59,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 402 flow [2024-06-04 17:26:59,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:26:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:26:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-04 17:26:59,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-06-04 17:26:59,640 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 120 transitions. [2024-06-04 17:26:59,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 402 flow [2024-06-04 17:26:59,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 388 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 17:26:59,642 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 239 flow [2024-06-04 17:26:59,643 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-04 17:26:59,643 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2024-06-04 17:26:59,643 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 239 flow [2024-06-04 17:26:59,643 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-04 17:26:59,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:59,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:59,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:26:59,644 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-04 17:26:59,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1706538564, now seen corresponding path program 1 times [2024-06-04 17:26:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188056371] [2024-06-04 17:26:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:04,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:04,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188056371] [2024-06-04 17:27:04,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188056371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:04,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:04,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:27:04,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289057171] [2024-06-04 17:27:04,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:04,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:27:04,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:04,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:27:04,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:27:04,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:27:04,321 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-04 17:27:04,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:04,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:27:04,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:05,269 INFO L124 PetriNetUnfolderBase]: 1580/2427 cut-off events. [2024-06-04 17:27:05,269 INFO L125 PetriNetUnfolderBase]: For 3142/3145 co-relation queries the response was YES. [2024-06-04 17:27:05,274 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-04 17:27:05,283 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 59 selfloop transitions, 19 changer transitions 0/83 dead transitions. [2024-06-04 17:27:05,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 505 flow [2024-06-04 17:27:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:27:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:27:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-04 17:27:05,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5310077519379846 [2024-06-04 17:27:05,285 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 239 flow. Second operand 6 states and 137 transitions. [2024-06-04 17:27:05,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 505 flow [2024-06-04 17:27:05,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 83 transitions, 497 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 17:27:05,289 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 295 flow [2024-06-04 17:27:05,289 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-04 17:27:05,289 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2024-06-04 17:27:05,290 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 295 flow [2024-06-04 17:27:05,290 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-04 17:27:05,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:05,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:05,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:27:05,290 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-04 17:27:05,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2005809500, now seen corresponding path program 1 times [2024-06-04 17:27:05,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:05,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321969725] [2024-06-04 17:27:05,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:11,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:11,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321969725] [2024-06-04 17:27:11,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321969725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:11,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:11,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:27:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17559308] [2024-06-04 17:27:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:11,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:27:11,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:11,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:27:11,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:27:11,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:27:11,943 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-04 17:27:11,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:11,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:27:11,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:12,819 INFO L124 PetriNetUnfolderBase]: 1368/2165 cut-off events. [2024-06-04 17:27:12,819 INFO L125 PetriNetUnfolderBase]: For 4021/4021 co-relation queries the response was YES. [2024-06-04 17:27:12,822 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-04 17:27:12,829 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 50 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2024-06-04 17:27:12,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 439 flow [2024-06-04 17:27:12,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:27:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:27:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-04 17:27:12,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44651162790697674 [2024-06-04 17:27:12,831 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 295 flow. Second operand 5 states and 96 transitions. [2024-06-04 17:27:12,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 439 flow [2024-06-04 17:27:12,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 389 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 17:27:12,835 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 269 flow [2024-06-04 17:27:12,835 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-04 17:27:12,836 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2024-06-04 17:27:12,836 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 269 flow [2024-06-04 17:27:12,836 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-04 17:27:12,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:12,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:12,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:27:12,836 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-04 17:27:12,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2033918504, now seen corresponding path program 1 times [2024-06-04 17:27:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:12,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245039847] [2024-06-04 17:27:12,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:23,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245039847] [2024-06-04 17:27:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245039847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:23,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:27:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068421382] [2024-06-04 17:27:23,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:23,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:27:23,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:27:23,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:27:23,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:27:23,890 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-04 17:27:23,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:23,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:27:23,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:24,791 INFO L124 PetriNetUnfolderBase]: 1358/2223 cut-off events. [2024-06-04 17:27:24,791 INFO L125 PetriNetUnfolderBase]: For 4716/4716 co-relation queries the response was YES. [2024-06-04 17:27:24,795 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-04 17:27:24,805 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 55 selfloop transitions, 11 changer transitions 0/72 dead transitions. [2024-06-04 17:27:24,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 459 flow [2024-06-04 17:27:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:27:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:27:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-04 17:27:24,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-04 17:27:24,808 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 269 flow. Second operand 6 states and 114 transitions. [2024-06-04 17:27:24,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 459 flow [2024-06-04 17:27:24,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 437 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:27:24,813 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 301 flow [2024-06-04 17:27:24,813 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-04 17:27:24,816 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2024-06-04 17:27:24,816 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 301 flow [2024-06-04 17:27:24,816 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-04 17:27:24,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:24,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:24,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:27:24,817 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-04 17:27:24,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash -601471343, now seen corresponding path program 1 times [2024-06-04 17:27:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:24,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128803598] [2024-06-04 17:27:24,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:24,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:35,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:35,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128803598] [2024-06-04 17:27:35,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128803598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:35,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:35,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:27:35,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408296376] [2024-06-04 17:27:35,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:35,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:27:35,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:35,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:27:35,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:27:35,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:27:35,876 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-04 17:27:35,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:35,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:27:35,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:36,973 INFO L124 PetriNetUnfolderBase]: 1571/2446 cut-off events. [2024-06-04 17:27:36,973 INFO L125 PetriNetUnfolderBase]: For 7146/7152 co-relation queries the response was YES. [2024-06-04 17:27:36,977 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-04 17:27:36,984 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2024-06-04 17:27:36,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 79 transitions, 545 flow [2024-06-04 17:27:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:27:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:27:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-04 17:27:36,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-04 17:27:36,985 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 301 flow. Second operand 6 states and 117 transitions. [2024-06-04 17:27:36,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 79 transitions, 545 flow [2024-06-04 17:27:36,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 515 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 17:27:36,989 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 343 flow [2024-06-04 17:27:36,989 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-04 17:27:36,990 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2024-06-04 17:27:36,990 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 343 flow [2024-06-04 17:27:36,990 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-04 17:27:36,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:36,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:36,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:27:36,990 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-04 17:27:36,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash -857360453, now seen corresponding path program 2 times [2024-06-04 17:27:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:36,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664579652] [2024-06-04 17:27:36,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:44,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:44,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664579652] [2024-06-04 17:27:44,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664579652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:44,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:44,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:27:44,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528570456] [2024-06-04 17:27:44,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:44,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:27:44,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:44,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:27:44,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:27:44,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:27:44,675 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-04 17:27:44,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:44,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:27:44,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:45,656 INFO L124 PetriNetUnfolderBase]: 1559/2419 cut-off events. [2024-06-04 17:27:45,656 INFO L125 PetriNetUnfolderBase]: For 8578/8584 co-relation queries the response was YES. [2024-06-04 17:27:45,659 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-04 17:27:45,666 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 49 selfloop transitions, 20 changer transitions 0/74 dead transitions. [2024-06-04 17:27:45,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 519 flow [2024-06-04 17:27:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:27:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:27:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-04 17:27:45,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.437984496124031 [2024-06-04 17:27:45,668 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 343 flow. Second operand 6 states and 113 transitions. [2024-06-04 17:27:45,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 519 flow [2024-06-04 17:27:45,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 490 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 17:27:45,673 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 362 flow [2024-06-04 17:27:45,673 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-04 17:27:45,675 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2024-06-04 17:27:45,675 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 362 flow [2024-06-04 17:27:45,676 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-04 17:27:45,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:45,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:45,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:27:45,676 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-04 17:27:45,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:45,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1798133161, now seen corresponding path program 1 times [2024-06-04 17:27:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:45,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706400137] [2024-06-04 17:27:45,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:45,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:56,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:56,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706400137] [2024-06-04 17:27:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706400137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:56,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:56,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:27:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574606883] [2024-06-04 17:27:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:56,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:27:56,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:27:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:27:56,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:27:56,851 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-04 17:27:56,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:56,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:27:56,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:57,919 INFO L124 PetriNetUnfolderBase]: 1733/2685 cut-off events. [2024-06-04 17:27:57,919 INFO L125 PetriNetUnfolderBase]: For 11431/11437 co-relation queries the response was YES. [2024-06-04 17:27:57,924 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-04 17:27:57,932 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 75 selfloop transitions, 40 changer transitions 0/120 dead transitions. [2024-06-04 17:27:57,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 120 transitions, 937 flow [2024-06-04 17:27:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:27:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:27:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-04 17:27:57,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 17:27:57,933 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 362 flow. Second operand 9 states and 172 transitions. [2024-06-04 17:27:57,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 120 transitions, 937 flow [2024-06-04 17:27:57,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 120 transitions, 811 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:27:57,945 INFO L231 Difference]: Finished difference. Result has 71 places, 83 transitions, 578 flow [2024-06-04 17:27:57,945 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-04 17:27:57,946 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2024-06-04 17:27:57,946 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 83 transitions, 578 flow [2024-06-04 17:27:57,946 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-04 17:27:57,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:57,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:27:57,946 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-04 17:27:57,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1008737709, now seen corresponding path program 2 times [2024-06-04 17:27:57,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:57,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482066131] [2024-06-04 17:27:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:57,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:28:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:28:09,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:28:09,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482066131] [2024-06-04 17:28:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482066131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:28:09,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:28:09,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:28:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012343844] [2024-06-04 17:28:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:28:09,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:28:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:28:09,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:28:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:28:09,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:28:09,918 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-04 17:28:09,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:28:09,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:28:09,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:28:11,127 INFO L124 PetriNetUnfolderBase]: 1805/2773 cut-off events. [2024-06-04 17:28:11,128 INFO L125 PetriNetUnfolderBase]: For 14798/14806 co-relation queries the response was YES. [2024-06-04 17:28:11,133 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-04 17:28:11,142 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 70 selfloop transitions, 54 changer transitions 0/129 dead transitions. [2024-06-04 17:28:11,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 129 transitions, 1060 flow [2024-06-04 17:28:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:28:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:28:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-04 17:28:11,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2024-06-04 17:28:11,144 INFO L175 Difference]: Start difference. First operand has 71 places, 83 transitions, 578 flow. Second operand 9 states and 170 transitions. [2024-06-04 17:28:11,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 129 transitions, 1060 flow [2024-06-04 17:28:11,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 129 transitions, 1026 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-04 17:28:11,156 INFO L231 Difference]: Finished difference. Result has 78 places, 93 transitions, 764 flow [2024-06-04 17:28:11,156 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-04 17:28:11,157 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2024-06-04 17:28:11,159 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 764 flow [2024-06-04 17:28:11,159 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-04 17:28:11,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:28:11,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:28:11,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:28:11,160 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-04 17:28:11,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:28:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash -797637939, now seen corresponding path program 3 times [2024-06-04 17:28:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:28:11,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579314191] [2024-06-04 17:28:11,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:28:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:28:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:28:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:28:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:28:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579314191] [2024-06-04 17:28:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579314191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:28:22,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:28:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:28:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708670946] [2024-06-04 17:28:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:28:22,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:28:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:28:22,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:28:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:28:22,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:28:22,911 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-04 17:28:22,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:28:22,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:28:22,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:28:24,036 INFO L124 PetriNetUnfolderBase]: 1827/2814 cut-off events. [2024-06-04 17:28:24,036 INFO L125 PetriNetUnfolderBase]: For 18330/18338 co-relation queries the response was YES. [2024-06-04 17:28:24,042 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-04 17:28:24,052 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 65 selfloop transitions, 62 changer transitions 0/132 dead transitions. [2024-06-04 17:28:24,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 132 transitions, 1278 flow [2024-06-04 17:28:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:28:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:28:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-04 17:28:24,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476744186046512 [2024-06-04 17:28:24,054 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 764 flow. Second operand 8 states and 154 transitions. [2024-06-04 17:28:24,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 132 transitions, 1278 flow [2024-06-04 17:28:24,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 132 transitions, 1171 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-04 17:28:24,068 INFO L231 Difference]: Finished difference. Result has 81 places, 101 transitions, 889 flow [2024-06-04 17:28:24,068 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-04 17:28:24,069 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2024-06-04 17:28:24,069 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 101 transitions, 889 flow [2024-06-04 17:28:24,069 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-04 17:28:24,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:28:24,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:28:24,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:28:24,070 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-04 17:28:24,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:28:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 385351465, now seen corresponding path program 4 times [2024-06-04 17:28:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:28:24,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744797802] [2024-06-04 17:28:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:28:24,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:28:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:28:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:28:35,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:28:35,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744797802] [2024-06-04 17:28:35,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744797802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:28:35,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:28:35,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:28:35,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525951627] [2024-06-04 17:28:35,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:28:35,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:28:35,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:28:35,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:28:35,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:28:35,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:28:35,971 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-04 17:28:35,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:28:35,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:28:35,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:28:37,124 INFO L124 PetriNetUnfolderBase]: 1811/2789 cut-off events. [2024-06-04 17:28:37,124 INFO L125 PetriNetUnfolderBase]: For 17399/17407 co-relation queries the response was YES. [2024-06-04 17:28:37,130 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-04 17:28:37,138 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 71 selfloop transitions, 63 changer transitions 0/139 dead transitions. [2024-06-04 17:28:37,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 139 transitions, 1311 flow [2024-06-04 17:28:37,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:28:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:28:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-04 17:28:37,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43023255813953487 [2024-06-04 17:28:37,139 INFO L175 Difference]: Start difference. First operand has 81 places, 101 transitions, 889 flow. Second operand 10 states and 185 transitions. [2024-06-04 17:28:37,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 139 transitions, 1311 flow [2024-06-04 17:28:37,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 139 transitions, 1207 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-04 17:28:37,154 INFO L231 Difference]: Finished difference. Result has 87 places, 101 transitions, 922 flow [2024-06-04 17:28:37,154 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-04 17:28:37,155 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2024-06-04 17:28:37,155 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 922 flow [2024-06-04 17:28:37,155 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-04 17:28:37,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:28:37,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:28:37,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:28:37,156 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-04 17:28:37,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:28:37,156 INFO L85 PathProgramCache]: Analyzing trace with hash 385597543, now seen corresponding path program 1 times [2024-06-04 17:28:37,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:28:37,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85037563] [2024-06-04 17:28:37,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:28:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:28:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:28:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:28:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:28:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85037563] [2024-06-04 17:28:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85037563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:28:48,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:28:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:28:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052715428] [2024-06-04 17:28:48,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:28:48,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:28:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:28:48,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:28:48,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:28:48,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:28:48,212 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-04 17:28:48,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:28:48,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:28:48,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:28:49,223 INFO L124 PetriNetUnfolderBase]: 1596/2560 cut-off events. [2024-06-04 17:28:49,224 INFO L125 PetriNetUnfolderBase]: For 16795/16797 co-relation queries the response was YES. [2024-06-04 17:28:49,229 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-04 17:28:49,236 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 105 selfloop transitions, 13 changer transitions 0/124 dead transitions. [2024-06-04 17:28:49,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 124 transitions, 1242 flow [2024-06-04 17:28:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:28:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:28:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 17:28:49,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-04 17:28:49,237 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 922 flow. Second operand 7 states and 131 transitions. [2024-06-04 17:28:49,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 124 transitions, 1242 flow [2024-06-04 17:28:49,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 124 transitions, 1069 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:28:49,249 INFO L231 Difference]: Finished difference. Result has 84 places, 103 transitions, 808 flow [2024-06-04 17:28:49,250 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-04 17:28:49,250 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2024-06-04 17:28:49,250 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 103 transitions, 808 flow [2024-06-04 17:28:49,250 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-04 17:28:49,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:28:49,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:28:49,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:28:49,251 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-04 17:28:49,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:28:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash -171163494, now seen corresponding path program 1 times [2024-06-04 17:28:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:28:49,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702513194] [2024-06-04 17:28:49,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:28:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:28:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:28:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:28:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:28:59,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702513194] [2024-06-04 17:28:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702513194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:28:59,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:28:59,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:28:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737919833] [2024-06-04 17:28:59,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:28:59,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:28:59,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:28:59,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:28:59,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:28:59,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:28:59,841 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-04 17:28:59,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:28:59,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:28:59,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:29:00,641 INFO L124 PetriNetUnfolderBase]: 1593/2560 cut-off events. [2024-06-04 17:29:00,641 INFO L125 PetriNetUnfolderBase]: For 17710/17712 co-relation queries the response was YES. [2024-06-04 17:29:00,647 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-04 17:29:00,654 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 100 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2024-06-04 17:29:00,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 114 transitions, 1070 flow [2024-06-04 17:29:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:29:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:29:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-04 17:29:00,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42790697674418604 [2024-06-04 17:29:00,656 INFO L175 Difference]: Start difference. First operand has 84 places, 103 transitions, 808 flow. Second operand 5 states and 92 transitions. [2024-06-04 17:29:00,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 114 transitions, 1070 flow [2024-06-04 17:29:00,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 114 transitions, 1029 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 17:29:00,672 INFO L231 Difference]: Finished difference. Result has 84 places, 106 transitions, 817 flow [2024-06-04 17:29:00,672 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-04 17:29:00,673 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2024-06-04 17:29:00,673 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 106 transitions, 817 flow [2024-06-04 17:29:00,674 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-04 17:29:00,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:29:00,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:29:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:29:00,675 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-04 17:29:00,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:29:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2135121005, now seen corresponding path program 1 times [2024-06-04 17:29:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:29:00,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677780708] [2024-06-04 17:29:00,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:29:00,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:29:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:29:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:29:12,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:29:12,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677780708] [2024-06-04 17:29:12,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677780708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:29:12,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:29:12,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:29:12,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187189038] [2024-06-04 17:29:12,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:29:12,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:29:12,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:29:12,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:29:12,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:29:12,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:29:12,455 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-04 17:29:12,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:29:12,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:29:12,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:29:13,674 INFO L124 PetriNetUnfolderBase]: 1844/2870 cut-off events. [2024-06-04 17:29:13,674 INFO L125 PetriNetUnfolderBase]: For 24130/24139 co-relation queries the response was YES. [2024-06-04 17:29:13,680 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-04 17:29:13,687 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 82 selfloop transitions, 68 changer transitions 0/155 dead transitions. [2024-06-04 17:29:13,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 155 transitions, 1359 flow [2024-06-04 17:29:13,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:29:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:29:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-04 17:29:13,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43953488372093025 [2024-06-04 17:29:13,688 INFO L175 Difference]: Start difference. First operand has 84 places, 106 transitions, 817 flow. Second operand 10 states and 189 transitions. [2024-06-04 17:29:13,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 155 transitions, 1359 flow [2024-06-04 17:29:13,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 155 transitions, 1331 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-04 17:29:13,701 INFO L231 Difference]: Finished difference. Result has 91 places, 112 transitions, 999 flow [2024-06-04 17:29:13,701 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-04 17:29:13,701 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2024-06-04 17:29:13,702 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 112 transitions, 999 flow [2024-06-04 17:29:13,702 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-04 17:29:13,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:29:13,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:29:13,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:29:13,702 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-04 17:29:13,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:29:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1806658007, now seen corresponding path program 2 times [2024-06-04 17:29:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:29:13,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439160769] [2024-06-04 17:29:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:29:13,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:29:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:29:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:29:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:29:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439160769] [2024-06-04 17:29:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439160769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:29:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:29:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:29:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133919289] [2024-06-04 17:29:25,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:29:25,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:29:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:29:25,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:29:25,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:29:25,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:29:25,525 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-04 17:29:25,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:29:25,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:29:25,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:29:26,619 INFO L124 PetriNetUnfolderBase]: 1856/2892 cut-off events. [2024-06-04 17:29:26,619 INFO L125 PetriNetUnfolderBase]: For 27553/27558 co-relation queries the response was YES. [2024-06-04 17:29:26,626 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-04 17:29:26,634 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 81 selfloop transitions, 64 changer transitions 0/150 dead transitions. [2024-06-04 17:29:26,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 150 transitions, 1480 flow [2024-06-04 17:29:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:29:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:29:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-04 17:29:26,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2024-06-04 17:29:26,636 INFO L175 Difference]: Start difference. First operand has 91 places, 112 transitions, 999 flow. Second operand 9 states and 170 transitions. [2024-06-04 17:29:26,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 150 transitions, 1480 flow [2024-06-04 17:29:26,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 150 transitions, 1308 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 17:29:26,654 INFO L231 Difference]: Finished difference. Result has 92 places, 115 transitions, 1005 flow [2024-06-04 17:29:26,654 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-04 17:29:26,655 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2024-06-04 17:29:26,655 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 115 transitions, 1005 flow [2024-06-04 17:29:26,655 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-04 17:29:26,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:29:26,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:29:26,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:29:26,655 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-04 17:29:26,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:29:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1043028539, now seen corresponding path program 3 times [2024-06-04 17:29:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:29:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525459570] [2024-06-04 17:29:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:29:26,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:29:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:29:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:29:38,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:29:38,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525459570] [2024-06-04 17:29:38,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525459570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:29:38,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:29:38,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:29:38,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424320666] [2024-06-04 17:29:38,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:29:38,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:29:38,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:29:38,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:29:38,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:29:38,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:29:38,218 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-04 17:29:38,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:29:38,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:29:38,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:29:39,292 INFO L124 PetriNetUnfolderBase]: 1846/2878 cut-off events. [2024-06-04 17:29:39,292 INFO L125 PetriNetUnfolderBase]: For 29820/29831 co-relation queries the response was YES. [2024-06-04 17:29:39,298 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-04 17:29:39,306 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 72 selfloop transitions, 60 changer transitions 0/137 dead transitions. [2024-06-04 17:29:39,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 137 transitions, 1333 flow [2024-06-04 17:29:39,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:29:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:29:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-04 17:29:39,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2024-06-04 17:29:39,307 INFO L175 Difference]: Start difference. First operand has 92 places, 115 transitions, 1005 flow. Second operand 7 states and 132 transitions. [2024-06-04 17:29:39,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 137 transitions, 1333 flow [2024-06-04 17:29:39,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 137 transitions, 1194 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 17:29:39,326 INFO L231 Difference]: Finished difference. Result has 93 places, 115 transitions, 994 flow [2024-06-04 17:29:39,326 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-04 17:29:39,327 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2024-06-04 17:29:39,327 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 115 transitions, 994 flow [2024-06-04 17:29:39,327 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-04 17:29:39,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:29:39,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:29:39,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:29:39,328 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-04 17:29:39,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:29:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1011099354, now seen corresponding path program 1 times [2024-06-04 17:29:39,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:29:39,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013417444] [2024-06-04 17:29:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:29:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:29:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:29:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:29:50,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:29:50,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013417444] [2024-06-04 17:29:50,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013417444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:29:50,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:29:50,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:29:50,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165156088] [2024-06-04 17:29:50,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:29:50,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:29:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:29:50,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:29:50,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:29:51,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:29:51,127 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-04 17:29:51,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:29:51,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:29:51,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:29:51,980 INFO L124 PetriNetUnfolderBase]: 1843/2888 cut-off events. [2024-06-04 17:29:51,981 INFO L125 PetriNetUnfolderBase]: For 32421/32423 co-relation queries the response was YES. [2024-06-04 17:29:51,986 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-04 17:29:51,993 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 111 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-06-04 17:29:51,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 127 transitions, 1290 flow [2024-06-04 17:29:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:29:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:29:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-04 17:29:51,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39147286821705424 [2024-06-04 17:29:51,994 INFO L175 Difference]: Start difference. First operand has 93 places, 115 transitions, 994 flow. Second operand 6 states and 101 transitions. [2024-06-04 17:29:51,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 127 transitions, 1290 flow [2024-06-04 17:29:52,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 127 transitions, 1155 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 17:29:52,017 INFO L231 Difference]: Finished difference. Result has 92 places, 118 transitions, 919 flow [2024-06-04 17:29:52,017 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-04 17:29:52,017 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2024-06-04 17:29:52,017 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 118 transitions, 919 flow [2024-06-04 17:29:52,018 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-04 17:29:52,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:29:52,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:29:52,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:29:52,018 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-04 17:29:52,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:29:52,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1882393716, now seen corresponding path program 1 times [2024-06-04 17:29:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:29:52,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259763911] [2024-06-04 17:29:52,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:29:52,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:29:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:30:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:30:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:30:03,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259763911] [2024-06-04 17:30:03,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259763911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:30:03,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:30:03,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:30:03,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568638147] [2024-06-04 17:30:03,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:30:03,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:30:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:30:03,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:30:03,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:30:03,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:30:03,875 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-04 17:30:03,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:30:03,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:30:03,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:30:05,006 INFO L124 PetriNetUnfolderBase]: 1923/2980 cut-off events. [2024-06-04 17:30:05,006 INFO L125 PetriNetUnfolderBase]: For 41532/41537 co-relation queries the response was YES. [2024-06-04 17:30:05,014 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-04 17:30:05,023 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 106 selfloop transitions, 35 changer transitions 0/147 dead transitions. [2024-06-04 17:30:05,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 147 transitions, 1381 flow [2024-06-04 17:30:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:30:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:30:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 17:30:05,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-04 17:30:05,026 INFO L175 Difference]: Start difference. First operand has 92 places, 118 transitions, 919 flow. Second operand 7 states and 133 transitions. [2024-06-04 17:30:05,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 147 transitions, 1381 flow [2024-06-04 17:30:05,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 147 transitions, 1343 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-04 17:30:05,052 INFO L231 Difference]: Finished difference. Result has 95 places, 122 transitions, 1006 flow [2024-06-04 17:30:05,052 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-04 17:30:05,052 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2024-06-04 17:30:05,052 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 122 transitions, 1006 flow [2024-06-04 17:30:05,052 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-04 17:30:05,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:30:05,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:30:05,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:30:05,053 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-04 17:30:05,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:30:05,053 INFO L85 PathProgramCache]: Analyzing trace with hash 167177868, now seen corresponding path program 2 times [2024-06-04 17:30:05,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:30:05,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605619168] [2024-06-04 17:30:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:30:05,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:30:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:30:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:30:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:30:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605619168] [2024-06-04 17:30:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605619168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:30:13,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:30:13,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:30:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396865096] [2024-06-04 17:30:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:30:13,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:30:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:30:13,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:30:13,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:30:13,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:30:13,253 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-04 17:30:13,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:30:13,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:30:13,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:30:14,414 INFO L124 PetriNetUnfolderBase]: 1915/2967 cut-off events. [2024-06-04 17:30:14,415 INFO L125 PetriNetUnfolderBase]: For 45774/45779 co-relation queries the response was YES. [2024-06-04 17:30:14,422 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-04 17:30:14,431 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 103 selfloop transitions, 36 changer transitions 0/145 dead transitions. [2024-06-04 17:30:14,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 145 transitions, 1356 flow [2024-06-04 17:30:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:30:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:30:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 17:30:14,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-04 17:30:14,432 INFO L175 Difference]: Start difference. First operand has 95 places, 122 transitions, 1006 flow. Second operand 7 states and 131 transitions. [2024-06-04 17:30:14,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 145 transitions, 1356 flow [2024-06-04 17:30:14,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 145 transitions, 1293 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-04 17:30:14,457 INFO L231 Difference]: Finished difference. Result has 99 places, 122 transitions, 1024 flow [2024-06-04 17:30:14,457 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-04 17:30:14,458 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2024-06-04 17:30:14,458 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 1024 flow [2024-06-04 17:30:14,458 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-04 17:30:14,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:30:14,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:30:14,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:30:14,458 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-04 17:30:14,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:30:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1764060888, now seen corresponding path program 1 times [2024-06-04 17:30:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:30:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559530087] [2024-06-04 17:30:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:30:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:30:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:30:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:30:25,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:30:25,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559530087] [2024-06-04 17:30:25,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559530087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:30:25,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:30:25,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:30:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149455259] [2024-06-04 17:30:25,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:30:25,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:30:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:30:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:30:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:30:25,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:30:25,419 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-04 17:30:25,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:30:25,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:30:25,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:30:26,804 INFO L124 PetriNetUnfolderBase]: 2007/3113 cut-off events. [2024-06-04 17:30:26,804 INFO L125 PetriNetUnfolderBase]: For 54466/54471 co-relation queries the response was YES. [2024-06-04 17:30:26,813 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-04 17:30:26,822 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 86 selfloop transitions, 66 changer transitions 0/158 dead transitions. [2024-06-04 17:30:26,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 158 transitions, 1460 flow [2024-06-04 17:30:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:30:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:30:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-04 17:30:26,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563953488372093 [2024-06-04 17:30:26,825 INFO L175 Difference]: Start difference. First operand has 99 places, 122 transitions, 1024 flow. Second operand 8 states and 157 transitions. [2024-06-04 17:30:26,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 158 transitions, 1460 flow [2024-06-04 17:30:26,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 158 transitions, 1379 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 17:30:26,853 INFO L231 Difference]: Finished difference. Result has 101 places, 124 transitions, 1117 flow [2024-06-04 17:30:26,853 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-04 17:30:26,853 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2024-06-04 17:30:26,853 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 124 transitions, 1117 flow [2024-06-04 17:30:26,853 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-04 17:30:26,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:30:26,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:30:26,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:30:26,854 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-04 17:30:26,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:30:26,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1290748935, now seen corresponding path program 1 times [2024-06-04 17:30:26,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:30:26,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185712911] [2024-06-04 17:30:26,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:30:26,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:30:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:30:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:30:38,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:30:38,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185712911] [2024-06-04 17:30:38,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185712911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:30:38,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:30:38,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:30:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948651019] [2024-06-04 17:30:38,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:30:38,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:30:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:30:38,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:30:38,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:30:38,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:30:38,652 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-04 17:30:38,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:30:38,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:30:38,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:30:39,670 INFO L124 PetriNetUnfolderBase]: 2040/3157 cut-off events. [2024-06-04 17:30:39,670 INFO L125 PetriNetUnfolderBase]: For 55733/55739 co-relation queries the response was YES. [2024-06-04 17:30:39,678 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-04 17:30:39,687 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 124 selfloop transitions, 13 changer transitions 0/143 dead transitions. [2024-06-04 17:30:39,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 143 transitions, 1473 flow [2024-06-04 17:30:39,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:30:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:30:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 17:30:39,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41472868217054265 [2024-06-04 17:30:39,688 INFO L175 Difference]: Start difference. First operand has 101 places, 124 transitions, 1117 flow. Second operand 6 states and 107 transitions. [2024-06-04 17:30:39,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 143 transitions, 1473 flow [2024-06-04 17:30:39,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 143 transitions, 1333 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:30:39,718 INFO L231 Difference]: Finished difference. Result has 101 places, 127 transitions, 1044 flow [2024-06-04 17:30:39,718 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-04 17:30:39,718 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2024-06-04 17:30:39,718 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 127 transitions, 1044 flow [2024-06-04 17:30:39,718 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-04 17:30:39,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:30:39,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:30:39,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:30:39,719 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-04 17:30:39,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:30:39,719 INFO L85 PathProgramCache]: Analyzing trace with hash 962092038, now seen corresponding path program 2 times [2024-06-04 17:30:39,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:30:39,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861963390] [2024-06-04 17:30:39,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:30:39,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:30:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:30:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:30:49,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:30:49,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861963390] [2024-06-04 17:30:49,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861963390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:30:49,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:30:49,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:30:49,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487597409] [2024-06-04 17:30:49,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:30:49,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:30:49,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:30:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:30:49,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:30:49,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:30:49,297 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-04 17:30:49,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:30:49,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:30:49,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:30:50,684 INFO L124 PetriNetUnfolderBase]: 2057/3161 cut-off events. [2024-06-04 17:30:50,684 INFO L125 PetriNetUnfolderBase]: For 60546/60554 co-relation queries the response was YES. [2024-06-04 17:30:50,693 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-04 17:30:50,702 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 80 selfloop transitions, 71 changer transitions 0/157 dead transitions. [2024-06-04 17:30:50,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 157 transitions, 1462 flow [2024-06-04 17:30:50,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:30:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:30:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-04 17:30:50,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-04 17:30:50,704 INFO L175 Difference]: Start difference. First operand has 101 places, 127 transitions, 1044 flow. Second operand 8 states and 151 transitions. [2024-06-04 17:30:50,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 157 transitions, 1462 flow [2024-06-04 17:30:50,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 157 transitions, 1419 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 17:30:50,734 INFO L231 Difference]: Finished difference. Result has 105 places, 129 transitions, 1186 flow [2024-06-04 17:30:50,735 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-04 17:30:50,735 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2024-06-04 17:30:50,735 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 129 transitions, 1186 flow [2024-06-04 17:30:50,735 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-04 17:30:50,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:30:50,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:30:50,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:30:50,736 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-04 17:30:50,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:30:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1183745448, now seen corresponding path program 3 times [2024-06-04 17:30:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:30:50,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040031241] [2024-06-04 17:30:50,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:30:50,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:30:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:31:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:31:00,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:31:00,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040031241] [2024-06-04 17:31:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040031241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:31:00,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:31:00,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:31:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103461396] [2024-06-04 17:31:00,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:31:00,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:31:00,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:31:00,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:31:00,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:31:00,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:31:00,862 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-04 17:31:00,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:31:00,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:31:00,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:31:02,167 INFO L124 PetriNetUnfolderBase]: 2074/3203 cut-off events. [2024-06-04 17:31:02,167 INFO L125 PetriNetUnfolderBase]: For 67201/67209 co-relation queries the response was YES. [2024-06-04 17:31:02,176 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-04 17:31:02,185 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 85 selfloop transitions, 80 changer transitions 0/171 dead transitions. [2024-06-04 17:31:02,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 171 transitions, 1786 flow [2024-06-04 17:31:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:31:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:31:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-04 17:31:02,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 17:31:02,188 INFO L175 Difference]: Start difference. First operand has 105 places, 129 transitions, 1186 flow. Second operand 9 states and 172 transitions. [2024-06-04 17:31:02,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 171 transitions, 1786 flow [2024-06-04 17:31:02,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 171 transitions, 1619 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 17:31:02,223 INFO L231 Difference]: Finished difference. Result has 108 places, 133 transitions, 1262 flow [2024-06-04 17:31:02,223 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-04 17:31:02,224 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 64 predicate places. [2024-06-04 17:31:02,224 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 133 transitions, 1262 flow [2024-06-04 17:31:02,224 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-04 17:31:02,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:31:02,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:31:02,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:31:02,224 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-04 17:31:02,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:31:02,225 INFO L85 PathProgramCache]: Analyzing trace with hash 955605288, now seen corresponding path program 4 times [2024-06-04 17:31:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:31:02,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601724983] [2024-06-04 17:31:02,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:31:02,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:31:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:31:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:31:13,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:31:13,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601724983] [2024-06-04 17:31:13,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601724983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:31:13,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:31:13,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:31:13,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856299611] [2024-06-04 17:31:13,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:31:13,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:31:13,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:31:13,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:31:13,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:31:13,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:31:13,373 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-04 17:31:13,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:31:13,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:31:13,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:31:14,773 INFO L124 PetriNetUnfolderBase]: 2066/3176 cut-off events. [2024-06-04 17:31:14,773 INFO L125 PetriNetUnfolderBase]: For 72465/72473 co-relation queries the response was YES. [2024-06-04 17:31:14,782 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-04 17:31:14,792 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 89 selfloop transitions, 68 changer transitions 0/163 dead transitions. [2024-06-04 17:31:14,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 163 transitions, 1668 flow [2024-06-04 17:31:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:31:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:31:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-04 17:31:14,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-04 17:31:14,794 INFO L175 Difference]: Start difference. First operand has 108 places, 133 transitions, 1262 flow. Second operand 8 states and 152 transitions. [2024-06-04 17:31:14,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 163 transitions, 1668 flow [2024-06-04 17:31:14,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 163 transitions, 1478 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-04 17:31:14,837 INFO L231 Difference]: Finished difference. Result has 110 places, 133 transitions, 1216 flow [2024-06-04 17:31:14,837 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-04 17:31:14,837 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places. [2024-06-04 17:31:14,837 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 133 transitions, 1216 flow [2024-06-04 17:31:14,838 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-04 17:31:14,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:31:14,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:31:14,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:31:14,838 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-04 17:31:14,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:31:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1279321095, now seen corresponding path program 2 times [2024-06-04 17:31:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:31:14,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700100069] [2024-06-04 17:31:14,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:31:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:31:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:31:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:31:26,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:31:26,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700100069] [2024-06-04 17:31:26,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700100069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:31:26,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:31:26,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:31:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410142916] [2024-06-04 17:31:26,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:31:26,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:31:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:31:26,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:31:26,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:31:26,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:31:26,191 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-04 17:31:26,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:31:26,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:31:26,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:31:27,235 INFO L124 PetriNetUnfolderBase]: 2063/3198 cut-off events. [2024-06-04 17:31:27,235 INFO L125 PetriNetUnfolderBase]: For 75460/75478 co-relation queries the response was YES. [2024-06-04 17:31:27,246 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-04 17:31:27,256 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 123 selfloop transitions, 18 changer transitions 0/147 dead transitions. [2024-06-04 17:31:27,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 147 transitions, 1572 flow [2024-06-04 17:31:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:31:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:31:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-04 17:31:27,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3992248062015504 [2024-06-04 17:31:27,257 INFO L175 Difference]: Start difference. First operand has 110 places, 133 transitions, 1216 flow. Second operand 6 states and 103 transitions. [2024-06-04 17:31:27,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 147 transitions, 1572 flow [2024-06-04 17:31:27,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 147 transitions, 1406 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:31:27,294 INFO L231 Difference]: Finished difference. Result has 109 places, 136 transitions, 1134 flow [2024-06-04 17:31:27,294 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-04 17:31:27,294 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 65 predicate places. [2024-06-04 17:31:27,295 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 136 transitions, 1134 flow [2024-06-04 17:31:27,295 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-04 17:31:27,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:31:27,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:31:27,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:31:27,295 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-04 17:31:27,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:31:27,295 INFO L85 PathProgramCache]: Analyzing trace with hash 714871773, now seen corresponding path program 1 times [2024-06-04 17:31:27,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:31:27,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937608145] [2024-06-04 17:31:27,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:31:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:31:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:31:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:31:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:31:38,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937608145] [2024-06-04 17:31:38,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937608145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:31:38,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:31:38,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:31:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928487298] [2024-06-04 17:31:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:31:38,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:31:38,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:31:38,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:31:38,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:31:38,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:31:38,428 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-04 17:31:38,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:31:38,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:31:38,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:31:39,447 INFO L124 PetriNetUnfolderBase]: 1861/2970 cut-off events. [2024-06-04 17:31:39,447 INFO L125 PetriNetUnfolderBase]: For 69003/69005 co-relation queries the response was YES. [2024-06-04 17:31:39,456 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-04 17:31:39,465 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 133 selfloop transitions, 11 changer transitions 0/151 dead transitions. [2024-06-04 17:31:39,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 151 transitions, 1488 flow [2024-06-04 17:31:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:31:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:31:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-04 17:31:39,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42248062015503873 [2024-06-04 17:31:39,466 INFO L175 Difference]: Start difference. First operand has 109 places, 136 transitions, 1134 flow. Second operand 6 states and 109 transitions. [2024-06-04 17:31:39,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 151 transitions, 1488 flow [2024-06-04 17:31:39,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 151 transitions, 1426 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 17:31:39,499 INFO L231 Difference]: Finished difference. Result has 111 places, 139 transitions, 1136 flow [2024-06-04 17:31:39,499 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-04 17:31:39,499 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 67 predicate places. [2024-06-04 17:31:39,499 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 139 transitions, 1136 flow [2024-06-04 17:31:39,499 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-04 17:31:39,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:31:39,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:31:39,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:31:39,500 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-04 17:31:39,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:31:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1279315143, now seen corresponding path program 2 times [2024-06-04 17:31:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:31:39,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062771059] [2024-06-04 17:31:39,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:31:39,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:31:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:31:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:31:51,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:31:51,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062771059] [2024-06-04 17:31:51,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062771059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:31:51,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:31:51,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:31:51,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133204539] [2024-06-04 17:31:51,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:31:51,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:31:51,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:31:51,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:31:51,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:31:51,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:31:51,666 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-04 17:31:51,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:31:51,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:31:51,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:31:52,613 INFO L124 PetriNetUnfolderBase]: 1858/2967 cut-off events. [2024-06-04 17:31:52,613 INFO L125 PetriNetUnfolderBase]: For 73544/73549 co-relation queries the response was YES. [2024-06-04 17:31:52,622 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-04 17:31:52,631 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 128 selfloop transitions, 16 changer transitions 0/151 dead transitions. [2024-06-04 17:31:52,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 151 transitions, 1486 flow [2024-06-04 17:31:52,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:31:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:31:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-04 17:31:52,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-04 17:31:52,632 INFO L175 Difference]: Start difference. First operand has 111 places, 139 transitions, 1136 flow. Second operand 6 states and 108 transitions. [2024-06-04 17:31:52,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 151 transitions, 1486 flow [2024-06-04 17:31:52,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 151 transitions, 1444 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 17:31:52,671 INFO L231 Difference]: Finished difference. Result has 113 places, 142 transitions, 1174 flow [2024-06-04 17:31:52,672 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-04 17:31:52,672 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2024-06-04 17:31:52,672 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 142 transitions, 1174 flow [2024-06-04 17:31:52,672 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-04 17:31:52,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:31:52,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:31:52,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:31:52,673 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-04 17:31:52,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:31:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1279307207, now seen corresponding path program 1 times [2024-06-04 17:31:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:31:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105141948] [2024-06-04 17:31:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:31:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:31:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:32:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:32:04,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:32:04,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105141948] [2024-06-04 17:32:04,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105141948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:32:04,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:32:04,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:32:04,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16484468] [2024-06-04 17:32:04,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:32:04,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:32:04,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:32:04,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:32:04,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:32:04,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:32:04,517 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-04 17:32:04,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:32:04,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:32:04,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:32:05,488 INFO L124 PetriNetUnfolderBase]: 1971/3078 cut-off events. [2024-06-04 17:32:05,488 INFO L125 PetriNetUnfolderBase]: For 78030/78032 co-relation queries the response was YES. [2024-06-04 17:32:05,498 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-04 17:32:05,507 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 136 selfloop transitions, 14 changer transitions 0/155 dead transitions. [2024-06-04 17:32:05,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 155 transitions, 1540 flow [2024-06-04 17:32:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:32:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:32:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-04 17:32:05,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787375415282392 [2024-06-04 17:32:05,508 INFO L175 Difference]: Start difference. First operand has 113 places, 142 transitions, 1174 flow. Second operand 7 states and 114 transitions. [2024-06-04 17:32:05,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 155 transitions, 1540 flow [2024-06-04 17:32:05,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 155 transitions, 1482 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 17:32:05,540 INFO L231 Difference]: Finished difference. Result has 116 places, 145 transitions, 1194 flow [2024-06-04 17:32:05,540 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-04 17:32:05,542 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2024-06-04 17:32:05,542 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 145 transitions, 1194 flow [2024-06-04 17:32:05,542 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-04 17:32:05,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:32:05,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:32:05,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:32:05,542 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-04 17:32:05,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:32:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1775338006, now seen corresponding path program 1 times [2024-06-04 17:32:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:32:05,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498221526] [2024-06-04 17:32:05,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:32:05,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:32:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:32:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:32:18,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:32:18,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498221526] [2024-06-04 17:32:18,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498221526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:32:18,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:32:18,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:32:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427040987] [2024-06-04 17:32:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:32:18,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:32:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:32:18,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:32:18,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:32:19,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:32:19,102 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-04 17:32:19,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:32:19,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:32:19,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:32:20,513 INFO L124 PetriNetUnfolderBase]: 2188/3409 cut-off events. [2024-06-04 17:32:20,513 INFO L125 PetriNetUnfolderBase]: For 107747/107752 co-relation queries the response was YES. [2024-06-04 17:32:20,525 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-04 17:32:20,536 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 117 selfloop transitions, 71 changer transitions 0/194 dead transitions. [2024-06-04 17:32:20,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 194 transitions, 1856 flow [2024-06-04 17:32:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:32:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:32:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-04 17:32:20,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4441860465116279 [2024-06-04 17:32:20,538 INFO L175 Difference]: Start difference. First operand has 116 places, 145 transitions, 1194 flow. Second operand 10 states and 191 transitions. [2024-06-04 17:32:20,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 194 transitions, 1856 flow [2024-06-04 17:32:20,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 194 transitions, 1800 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-04 17:32:20,587 INFO L231 Difference]: Finished difference. Result has 121 places, 147 transitions, 1336 flow [2024-06-04 17:32:20,587 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-04 17:32:20,588 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 77 predicate places. [2024-06-04 17:32:20,588 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 147 transitions, 1336 flow [2024-06-04 17:32:20,588 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-04 17:32:20,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:32:20,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:32:20,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:32:20,588 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-04 17:32:20,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:32:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1863903766, now seen corresponding path program 2 times [2024-06-04 17:32:20,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:32:20,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093724211] [2024-06-04 17:32:20,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:32:20,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:32:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:32:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:32:31,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:32:31,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093724211] [2024-06-04 17:32:31,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093724211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:32:31,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:32:31,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:32:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496537012] [2024-06-04 17:32:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:32:31,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:32:31,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:32:31,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:32:31,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:32:31,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:32:31,357 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-04 17:32:31,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:32:31,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:32:31,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:32:32,899 INFO L124 PetriNetUnfolderBase]: 2246/3504 cut-off events. [2024-06-04 17:32:32,899 INFO L125 PetriNetUnfolderBase]: For 116246/116251 co-relation queries the response was YES. [2024-06-04 17:32:32,910 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-04 17:32:32,920 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 118 selfloop transitions, 74 changer transitions 0/198 dead transitions. [2024-06-04 17:32:32,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 198 transitions, 1900 flow [2024-06-04 17:32:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:32:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:32:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-04 17:32:32,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4376321353065539 [2024-06-04 17:32:32,923 INFO L175 Difference]: Start difference. First operand has 121 places, 147 transitions, 1336 flow. Second operand 11 states and 207 transitions. [2024-06-04 17:32:32,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 198 transitions, 1900 flow [2024-06-04 17:32:32,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 198 transitions, 1806 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:32:32,972 INFO L231 Difference]: Finished difference. Result has 126 places, 148 transitions, 1424 flow [2024-06-04 17:32:32,972 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-04 17:32:32,972 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 82 predicate places. [2024-06-04 17:32:32,973 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 148 transitions, 1424 flow [2024-06-04 17:32:32,973 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-04 17:32:32,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:32:32,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:32:32,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:32:32,973 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-04 17:32:32,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:32:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1358808559, now seen corresponding path program 1 times [2024-06-04 17:32:32,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:32:32,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706100207] [2024-06-04 17:32:32,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:32:32,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:32:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:32:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:32:44,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:32:44,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706100207] [2024-06-04 17:32:44,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706100207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:32:44,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:32:44,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:32:44,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19949980] [2024-06-04 17:32:44,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:32:44,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:32:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:32:44,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:32:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:32:44,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:32:44,845 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-04 17:32:44,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:32:44,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:32:44,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:32:46,140 INFO L124 PetriNetUnfolderBase]: 2256/3529 cut-off events. [2024-06-04 17:32:46,140 INFO L125 PetriNetUnfolderBase]: For 119192/119201 co-relation queries the response was YES. [2024-06-04 17:32:46,153 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-04 17:32:46,164 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 130 selfloop transitions, 38 changer transitions 0/174 dead transitions. [2024-06-04 17:32:46,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 174 transitions, 1882 flow [2024-06-04 17:32:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:32:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:32:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 17:32:46,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-04 17:32:46,165 INFO L175 Difference]: Start difference. First operand has 126 places, 148 transitions, 1424 flow. Second operand 7 states and 131 transitions. [2024-06-04 17:32:46,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 174 transitions, 1882 flow [2024-06-04 17:32:46,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 174 transitions, 1718 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 17:32:46,226 INFO L231 Difference]: Finished difference. Result has 124 places, 152 transitions, 1402 flow [2024-06-04 17:32:46,226 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-04 17:32:46,227 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places. [2024-06-04 17:32:46,227 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 152 transitions, 1402 flow [2024-06-04 17:32:46,227 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-04 17:32:46,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:32:46,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:32:46,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:32:46,227 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-04 17:32:46,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:32:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1026075820, now seen corresponding path program 3 times [2024-06-04 17:32:46,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:32:46,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673761657] [2024-06-04 17:32:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:32:46,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:32:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:32:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:32:53,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:32:53,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673761657] [2024-06-04 17:32:53,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673761657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:32:53,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:32:53,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:32:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218498726] [2024-06-04 17:32:53,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:32:53,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:32:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:32:53,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:32:53,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:32:53,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:32:53,748 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-04 17:32:53,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:32:53,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:32:53,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:32:55,468 INFO L124 PetriNetUnfolderBase]: 2481/3846 cut-off events. [2024-06-04 17:32:55,469 INFO L125 PetriNetUnfolderBase]: For 136417/136426 co-relation queries the response was YES. [2024-06-04 17:32:55,482 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-04 17:32:55,494 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 129 selfloop transitions, 76 changer transitions 0/209 dead transitions. [2024-06-04 17:32:55,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 209 transitions, 2148 flow [2024-06-04 17:32:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:32:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:32:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-06-04 17:32:55,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249471458773784 [2024-06-04 17:32:55,497 INFO L175 Difference]: Start difference. First operand has 124 places, 152 transitions, 1402 flow. Second operand 11 states and 201 transitions. [2024-06-04 17:32:55,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 209 transitions, 2148 flow [2024-06-04 17:32:55,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 209 transitions, 2036 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 17:32:55,566 INFO L231 Difference]: Finished difference. Result has 130 places, 154 transitions, 1506 flow [2024-06-04 17:32:55,566 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-04 17:32:55,567 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 86 predicate places. [2024-06-04 17:32:55,567 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 154 transitions, 1506 flow [2024-06-04 17:32:55,567 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-04 17:32:55,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:32:55,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:32:55,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:32:55,567 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-04 17:32:55,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:32:55,567 INFO L85 PathProgramCache]: Analyzing trace with hash 235452828, now seen corresponding path program 4 times [2024-06-04 17:32:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:32:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636206996] [2024-06-04 17:32:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:32:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:32:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:33:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:33:03,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:33:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636206996] [2024-06-04 17:33:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636206996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:33:03,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:33:03,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:33:03,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766731622] [2024-06-04 17:33:03,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:33:03,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:33:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:33:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:33:03,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:33:03,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:33:03,212 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-04 17:33:03,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:33:03,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:33:03,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:33:04,791 INFO L124 PetriNetUnfolderBase]: 2450/3859 cut-off events. [2024-06-04 17:33:04,792 INFO L125 PetriNetUnfolderBase]: For 149301/149306 co-relation queries the response was YES. [2024-06-04 17:33:04,808 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-04 17:33:04,822 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 119 selfloop transitions, 64 changer transitions 0/189 dead transitions. [2024-06-04 17:33:04,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 189 transitions, 2006 flow [2024-06-04 17:33:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:33:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:33:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-04 17:33:04,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-04 17:33:04,823 INFO L175 Difference]: Start difference. First operand has 130 places, 154 transitions, 1506 flow. Second operand 8 states and 156 transitions. [2024-06-04 17:33:04,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 189 transitions, 2006 flow [2024-06-04 17:33:04,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 189 transitions, 1889 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 17:33:04,905 INFO L231 Difference]: Finished difference. Result has 131 places, 155 transitions, 1558 flow [2024-06-04 17:33:04,906 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-04 17:33:04,906 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 87 predicate places. [2024-06-04 17:33:04,906 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 155 transitions, 1558 flow [2024-06-04 17:33:04,906 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-04 17:33:04,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:33:04,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:33:04,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:33:04,906 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-04 17:33:04,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:33:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash 230090448, now seen corresponding path program 5 times [2024-06-04 17:33:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:33:04,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337435498] [2024-06-04 17:33:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:33:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:33:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:33:12,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-04 17:33:12,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:33:12,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337435498] [2024-06-04 17:33:12,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337435498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:33:12,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:33:12,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:33:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060621006] [2024-06-04 17:33:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:33:12,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:33:12,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:33:12,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:33:12,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:33:12,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:33:12,465 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-04 17:33:12,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:33:12,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:33:12,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:33:14,178 INFO L124 PetriNetUnfolderBase]: 2525/3990 cut-off events. [2024-06-04 17:33:14,178 INFO L125 PetriNetUnfolderBase]: For 158347/158356 co-relation queries the response was YES. [2024-06-04 17:33:14,195 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-04 17:33:14,208 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 122 selfloop transitions, 66 changer transitions 0/194 dead transitions. [2024-06-04 17:33:14,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 194 transitions, 2086 flow [2024-06-04 17:33:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:33:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:33:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-04 17:33:14,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-04 17:33:14,211 INFO L175 Difference]: Start difference. First operand has 131 places, 155 transitions, 1558 flow. Second operand 8 states and 160 transitions. [2024-06-04 17:33:14,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 194 transitions, 2086 flow [2024-06-04 17:33:14,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 194 transitions, 1947 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:33:14,281 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 1592 flow [2024-06-04 17:33:14,281 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-04 17:33:14,282 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places. [2024-06-04 17:33:14,282 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 1592 flow [2024-06-04 17:33:14,282 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-04 17:33:14,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:33:14,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:33:14,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:33:14,282 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-04 17:33:14,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:33:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1148688192, now seen corresponding path program 1 times [2024-06-04 17:33:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:33:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658243016] [2024-06-04 17:33:14,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:33:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:33:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:33:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:33:26,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:33:26,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658243016] [2024-06-04 17:33:26,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658243016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:33:26,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:33:26,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:33:26,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875804074] [2024-06-04 17:33:26,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:33:26,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:33:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:33:26,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:33:26,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:33:26,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:33:26,368 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-04 17:33:26,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:33:26,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:33:26,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:33:27,925 INFO L124 PetriNetUnfolderBase]: 2566/4065 cut-off events. [2024-06-04 17:33:27,925 INFO L125 PetriNetUnfolderBase]: For 163641/163646 co-relation queries the response was YES. [2024-06-04 17:33:27,940 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-04 17:33:27,953 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 120 selfloop transitions, 67 changer transitions 0/193 dead transitions. [2024-06-04 17:33:27,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 193 transitions, 2110 flow [2024-06-04 17:33:27,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:33:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:33:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-04 17:33:27,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563953488372093 [2024-06-04 17:33:27,956 INFO L175 Difference]: Start difference. First operand has 133 places, 156 transitions, 1592 flow. Second operand 8 states and 157 transitions. [2024-06-04 17:33:27,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 193 transitions, 2110 flow [2024-06-04 17:33:28,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 193 transitions, 1965 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:33:28,112 INFO L231 Difference]: Finished difference. Result has 135 places, 157 transitions, 1620 flow [2024-06-04 17:33:28,112 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-04 17:33:28,112 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places. [2024-06-04 17:33:28,112 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 157 transitions, 1620 flow [2024-06-04 17:33:28,113 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-04 17:33:28,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:33:28,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:33:28,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:33:28,113 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-04 17:33:28,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:33:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash -408579181, now seen corresponding path program 1 times [2024-06-04 17:33:28,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:33:28,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372498681] [2024-06-04 17:33:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:33:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:33:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:33:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:33:40,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:33:40,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372498681] [2024-06-04 17:33:40,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372498681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:33:40,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:33:40,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:33:40,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143847717] [2024-06-04 17:33:40,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:33:40,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:33:40,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:33:40,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:33:40,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:33:40,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:33:40,631 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-04 17:33:40,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:33:40,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:33:40,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:33:42,062 INFO L124 PetriNetUnfolderBase]: 2677/4180 cut-off events. [2024-06-04 17:33:42,062 INFO L125 PetriNetUnfolderBase]: For 165182/165188 co-relation queries the response was YES. [2024-06-04 17:33:42,078 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-04 17:33:42,090 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 157 selfloop transitions, 16 changer transitions 0/177 dead transitions. [2024-06-04 17:33:42,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 177 transitions, 2064 flow [2024-06-04 17:33:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:33:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:33:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-04 17:33:42,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787375415282392 [2024-06-04 17:33:42,092 INFO L175 Difference]: Start difference. First operand has 135 places, 157 transitions, 1620 flow. Second operand 7 states and 114 transitions. [2024-06-04 17:33:42,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 177 transitions, 2064 flow [2024-06-04 17:33:42,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 177 transitions, 1911 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 17:33:42,196 INFO L231 Difference]: Finished difference. Result has 136 places, 160 transitions, 1553 flow [2024-06-04 17:33:42,196 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-04 17:33:42,196 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 92 predicate places. [2024-06-04 17:33:42,197 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 160 transitions, 1553 flow [2024-06-04 17:33:42,197 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-04 17:33:42,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:33:42,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:33:42,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:33:42,197 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-04 17:33:42,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:33:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -408579553, now seen corresponding path program 2 times [2024-06-04 17:33:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:33:42,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136079223] [2024-06-04 17:33:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:33:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:33:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:33:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:33:53,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:33:53,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136079223] [2024-06-04 17:33:53,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136079223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:33:53,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:33:53,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:33:53,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68695832] [2024-06-04 17:33:53,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:33:53,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:33:53,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:33:53,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:33:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:33:53,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:33:53,629 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-04 17:33:53,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:33:53,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:33:53,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:33:55,008 INFO L124 PetriNetUnfolderBase]: 2611/4130 cut-off events. [2024-06-04 17:33:55,008 INFO L125 PetriNetUnfolderBase]: For 174339/174344 co-relation queries the response was YES. [2024-06-04 17:33:55,025 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-04 17:33:55,037 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 136 selfloop transitions, 41 changer transitions 0/184 dead transitions. [2024-06-04 17:33:55,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 184 transitions, 2139 flow [2024-06-04 17:33:55,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:33:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:33:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-04 17:33:55,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-04 17:33:55,038 INFO L175 Difference]: Start difference. First operand has 136 places, 160 transitions, 1553 flow. Second operand 7 states and 127 transitions. [2024-06-04 17:33:55,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 184 transitions, 2139 flow [2024-06-04 17:33:55,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 184 transitions, 2075 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-04 17:33:55,151 INFO L231 Difference]: Finished difference. Result has 139 places, 168 transitions, 1722 flow [2024-06-04 17:33:55,151 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-04 17:33:55,151 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 95 predicate places. [2024-06-04 17:33:55,151 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 168 transitions, 1722 flow [2024-06-04 17:33:55,151 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-04 17:33:55,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:33:55,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:33:55,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:33:55,152 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-04 17:33:55,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:33:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash -50670318, now seen corresponding path program 6 times [2024-06-04 17:33:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:33:55,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604229121] [2024-06-04 17:33:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:33:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:33:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:34:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:34:02,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:34:02,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604229121] [2024-06-04 17:34:02,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604229121] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:34:02,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:34:02,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:34:02,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897412794] [2024-06-04 17:34:02,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:34:02,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:34:02,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:34:02,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:34:02,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:34:02,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:34:02,828 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-04 17:34:02,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:34:02,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:34:02,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:34:04,571 INFO L124 PetriNetUnfolderBase]: 2575/4074 cut-off events. [2024-06-04 17:34:04,571 INFO L125 PetriNetUnfolderBase]: For 185117/185128 co-relation queries the response was YES. [2024-06-04 17:34:04,590 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-04 17:34:04,605 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 131 selfloop transitions, 61 changer transitions 0/199 dead transitions. [2024-06-04 17:34:04,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 199 transitions, 2204 flow [2024-06-04 17:34:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:34:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:34:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-04 17:34:04,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-04 17:34:04,609 INFO L175 Difference]: Start difference. First operand has 139 places, 168 transitions, 1722 flow. Second operand 8 states and 151 transitions. [2024-06-04 17:34:04,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 199 transitions, 2204 flow [2024-06-04 17:34:04,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 199 transitions, 2099 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-06-04 17:34:04,749 INFO L231 Difference]: Finished difference. Result has 144 places, 168 transitions, 1746 flow [2024-06-04 17:34:04,749 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-04 17:34:04,750 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places. [2024-06-04 17:34:04,750 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 168 transitions, 1746 flow [2024-06-04 17:34:04,750 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-04 17:34:04,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:34:04,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:34:04,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:34:04,750 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:34:04,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:34:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1512892958, now seen corresponding path program 2 times [2024-06-04 17:34:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:34:04,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342208496] [2024-06-04 17:34:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:34:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:34:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:34:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:34:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:34:15,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342208496] [2024-06-04 17:34:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342208496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:34:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:34:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:34:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718638859] [2024-06-04 17:34:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:34:15,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:34:15,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:34:15,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:34:15,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:34:15,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:34:15,279 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-04 17:34:15,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:34:15,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:34:15,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:34:16,877 INFO L124 PetriNetUnfolderBase]: 2555/4042 cut-off events. [2024-06-04 17:34:16,878 INFO L125 PetriNetUnfolderBase]: For 181762/181773 co-relation queries the response was YES. [2024-06-04 17:34:16,894 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-04 17:34:16,908 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 131 selfloop transitions, 63 changer transitions 0/201 dead transitions. [2024-06-04 17:34:16,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 201 transitions, 2244 flow [2024-06-04 17:34:16,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:34:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:34:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-04 17:34:16,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44476744186046513 [2024-06-04 17:34:16,911 INFO L175 Difference]: Start difference. First operand has 144 places, 168 transitions, 1746 flow. Second operand 8 states and 153 transitions. [2024-06-04 17:34:16,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 201 transitions, 2244 flow [2024-06-04 17:34:17,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 201 transitions, 2093 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:34:17,029 INFO L231 Difference]: Finished difference. Result has 145 places, 168 transitions, 1727 flow [2024-06-04 17:34:17,030 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-04 17:34:17,030 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 101 predicate places. [2024-06-04 17:34:17,030 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 168 transitions, 1727 flow [2024-06-04 17:34:17,030 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-04 17:34:17,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:34:17,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:34:17,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:34:17,031 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-04 17:34:17,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:34:17,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1761984158, now seen corresponding path program 3 times [2024-06-04 17:34:17,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:34:17,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277437770] [2024-06-04 17:34:17,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:34:17,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:34:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:34:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:34:26,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:34:26,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277437770] [2024-06-04 17:34:26,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277437770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:34:26,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:34:26,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:34:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952735528] [2024-06-04 17:34:26,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:34:26,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:34:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:34:26,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:34:26,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:34:26,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:34:26,500 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-04 17:34:26,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:34:26,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:34:26,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:34:28,002 INFO L124 PetriNetUnfolderBase]: 2535/4010 cut-off events. [2024-06-04 17:34:28,002 INFO L125 PetriNetUnfolderBase]: For 182077/182088 co-relation queries the response was YES. [2024-06-04 17:34:28,019 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-04 17:34:28,033 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 122 selfloop transitions, 71 changer transitions 0/200 dead transitions. [2024-06-04 17:34:28,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 200 transitions, 2163 flow [2024-06-04 17:34:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:34:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:34:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-04 17:34:28,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-04 17:34:28,036 INFO L175 Difference]: Start difference. First operand has 145 places, 168 transitions, 1727 flow. Second operand 8 states and 151 transitions. [2024-06-04 17:34:28,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 200 transitions, 2163 flow [2024-06-04 17:34:28,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 200 transitions, 1941 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:34:28,165 INFO L231 Difference]: Finished difference. Result has 144 places, 167 transitions, 1591 flow [2024-06-04 17:34:28,165 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-04 17:34:28,165 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places. [2024-06-04 17:34:28,165 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 167 transitions, 1591 flow [2024-06-04 17:34:28,166 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-04 17:34:28,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:34:28,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:34:28,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:34:28,166 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-04 17:34:28,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:34:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1003830907, now seen corresponding path program 2 times [2024-06-04 17:34:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:34:28,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617476734] [2024-06-04 17:34:28,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:34:28,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:34:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:34:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:34:39,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:34:39,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617476734] [2024-06-04 17:34:39,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617476734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:34:39,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:34:39,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:34:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561318513] [2024-06-04 17:34:39,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:34:39,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:34:39,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:34:39,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:34:39,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:34:39,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:34:39,906 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-04 17:34:39,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:34:39,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:34:39,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:34:41,116 INFO L124 PetriNetUnfolderBase]: 2634/4116 cut-off events. [2024-06-04 17:34:41,116 INFO L125 PetriNetUnfolderBase]: For 182039/182057 co-relation queries the response was YES. [2024-06-04 17:34:41,134 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-04 17:34:41,147 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 153 selfloop transitions, 29 changer transitions 0/186 dead transitions. [2024-06-04 17:34:41,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 186 transitions, 2181 flow [2024-06-04 17:34:41,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:34:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:34:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-04 17:34:41,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3687707641196013 [2024-06-04 17:34:41,148 INFO L175 Difference]: Start difference. First operand has 144 places, 167 transitions, 1591 flow. Second operand 7 states and 111 transitions. [2024-06-04 17:34:41,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 186 transitions, 2181 flow [2024-06-04 17:34:41,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 186 transitions, 1982 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:34:41,277 INFO L231 Difference]: Finished difference. Result has 144 places, 173 transitions, 1566 flow [2024-06-04 17:34:41,277 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-04 17:34:41,277 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places. [2024-06-04 17:34:41,277 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 173 transitions, 1566 flow [2024-06-04 17:34:41,277 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-04 17:34:41,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:34:41,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:34:41,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:34:41,278 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-04 17:34:41,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:34:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash -398402563, now seen corresponding path program 3 times [2024-06-04 17:34:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:34:41,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038185862] [2024-06-04 17:34:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:34:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:34:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:34:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:34:52,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:34:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038185862] [2024-06-04 17:34:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038185862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:34:52,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:34:52,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:34:52,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420500566] [2024-06-04 17:34:52,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:34:52,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:34:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:34:52,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:34:52,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:34:53,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:34:53,022 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-04 17:34:53,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:34:53,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:34:53,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:34:54,231 INFO L124 PetriNetUnfolderBase]: 2544/4024 cut-off events. [2024-06-04 17:34:54,232 INFO L125 PetriNetUnfolderBase]: For 190857/190868 co-relation queries the response was YES. [2024-06-04 17:34:54,249 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-04 17:34:54,265 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 130 selfloop transitions, 54 changer transitions 0/193 dead transitions. [2024-06-04 17:34:54,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 193 transitions, 2264 flow [2024-06-04 17:34:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:34:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:34:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-04 17:34:54,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119601328903654 [2024-06-04 17:34:54,266 INFO L175 Difference]: Start difference. First operand has 144 places, 173 transitions, 1566 flow. Second operand 7 states and 124 transitions. [2024-06-04 17:34:54,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 193 transitions, 2264 flow [2024-06-04 17:34:54,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 193 transitions, 2193 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-04 17:34:54,378 INFO L231 Difference]: Finished difference. Result has 149 places, 181 transitions, 1765 flow [2024-06-04 17:34:54,378 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-04 17:34:54,378 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 105 predicate places. [2024-06-04 17:34:54,379 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 181 transitions, 1765 flow [2024-06-04 17:34:54,379 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-04 17:34:54,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:34:54,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:34:54,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:34:54,379 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-04 17:34:54,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:34:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1004246617, now seen corresponding path program 3 times [2024-06-04 17:34:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:34:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226196809] [2024-06-04 17:34:54,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:34:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:34:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:35:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:35:06,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:35:06,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226196809] [2024-06-04 17:35:06,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226196809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:35:06,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:35:06,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:35:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651563286] [2024-06-04 17:35:06,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:35:06,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:35:06,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:35:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:35:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:35:07,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:35:07,016 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-04 17:35:07,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:35:07,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:35:07,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:35:08,391 INFO L124 PetriNetUnfolderBase]: 2635/4119 cut-off events. [2024-06-04 17:35:08,391 INFO L125 PetriNetUnfolderBase]: For 200705/200723 co-relation queries the response was YES. [2024-06-04 17:35:08,409 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-04 17:35:08,421 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 161 selfloop transitions, 28 changer transitions 0/193 dead transitions. [2024-06-04 17:35:08,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 193 transitions, 2183 flow [2024-06-04 17:35:08,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:35:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:35:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-04 17:35:08,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3687707641196013 [2024-06-04 17:35:08,422 INFO L175 Difference]: Start difference. First operand has 149 places, 181 transitions, 1765 flow. Second operand 7 states and 111 transitions. [2024-06-04 17:35:08,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 193 transitions, 2183 flow [2024-06-04 17:35:08,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 193 transitions, 1983 flow, removed 59 selfloop flow, removed 4 redundant places. [2024-06-04 17:35:08,567 INFO L231 Difference]: Finished difference. Result has 152 places, 181 transitions, 1627 flow [2024-06-04 17:35:08,567 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-04 17:35:08,568 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 108 predicate places. [2024-06-04 17:35:08,568 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 181 transitions, 1627 flow [2024-06-04 17:35:08,568 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-04 17:35:08,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:35:08,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:35:08,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:35:08,568 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-04 17:35:08,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:35:08,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1181313781, now seen corresponding path program 1 times [2024-06-04 17:35:08,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:35:08,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816617486] [2024-06-04 17:35:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:35:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:35:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:35:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:35:19,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:35:19,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816617486] [2024-06-04 17:35:19,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816617486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:35:19,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:35:19,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:35:19,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51106580] [2024-06-04 17:35:19,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:35:19,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:35:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:35:19,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:35:19,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:35:19,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:35:19,979 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-04 17:35:19,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:35:19,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:35:19,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:35:21,274 INFO L124 PetriNetUnfolderBase]: 2347/3800 cut-off events. [2024-06-04 17:35:21,274 INFO L125 PetriNetUnfolderBase]: For 177843/177845 co-relation queries the response was YES. [2024-06-04 17:35:21,291 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-04 17:35:21,302 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 177 selfloop transitions, 17 changer transitions 0/204 dead transitions. [2024-06-04 17:35:21,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 204 transitions, 2121 flow [2024-06-04 17:35:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:35:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:35:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-04 17:35:21,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-04 17:35:21,304 INFO L175 Difference]: Start difference. First operand has 152 places, 181 transitions, 1627 flow. Second operand 7 states and 127 transitions. [2024-06-04 17:35:21,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 204 transitions, 2121 flow [2024-06-04 17:35:21,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 204 transitions, 2047 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:35:21,428 INFO L231 Difference]: Finished difference. Result has 154 places, 187 transitions, 1661 flow [2024-06-04 17:35:21,428 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-04 17:35:21,428 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places. [2024-06-04 17:35:21,428 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 187 transitions, 1661 flow [2024-06-04 17:35:21,428 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-04 17:35:21,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:35:21,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:35:21,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:35:21,429 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-04 17:35:21,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:35:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1181193625, now seen corresponding path program 1 times [2024-06-04 17:35:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:35:21,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451692] [2024-06-04 17:35:21,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:35:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:35:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:35:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:35:33,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:35:33,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451692] [2024-06-04 17:35:33,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:35:33,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:35:33,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:35:33,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129413195] [2024-06-04 17:35:33,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:35:33,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:35:33,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:35:33,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:35:33,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:35:33,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:35:33,318 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-04 17:35:33,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:35:33,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:35:33,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:35:34,516 INFO L124 PetriNetUnfolderBase]: 2446/3893 cut-off events. [2024-06-04 17:35:34,516 INFO L125 PetriNetUnfolderBase]: For 183900/183902 co-relation queries the response was YES. [2024-06-04 17:35:34,534 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-04 17:35:34,546 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 184 selfloop transitions, 14 changer transitions 0/203 dead transitions. [2024-06-04 17:35:34,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 203 transitions, 2141 flow [2024-06-04 17:35:34,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:35:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:35:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 17:35:34,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3853820598006645 [2024-06-04 17:35:34,547 INFO L175 Difference]: Start difference. First operand has 154 places, 187 transitions, 1661 flow. Second operand 7 states and 116 transitions. [2024-06-04 17:35:34,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 203 transitions, 2141 flow [2024-06-04 17:35:34,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 203 transitions, 2087 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-04 17:35:34,702 INFO L231 Difference]: Finished difference. Result has 158 places, 190 transitions, 1693 flow [2024-06-04 17:35:34,702 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-04 17:35:34,703 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 114 predicate places. [2024-06-04 17:35:34,703 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 190 transitions, 1693 flow [2024-06-04 17:35:34,703 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-04 17:35:34,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:35:34,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:35:34,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:35:34,704 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-04 17:35:34,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:35:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash 537456023, now seen corresponding path program 2 times [2024-06-04 17:35:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:35:34,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328738613] [2024-06-04 17:35:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:35:34,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:35:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:35:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:35:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:35:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328738613] [2024-06-04 17:35:46,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328738613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:35:46,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:35:46,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:35:46,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149037315] [2024-06-04 17:35:46,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:35:46,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:35:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:35:46,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:35:46,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:35:46,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:35:46,893 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-04 17:35:46,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:35:46,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:35:46,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:35:48,101 INFO L124 PetriNetUnfolderBase]: 2380/3834 cut-off events. [2024-06-04 17:35:48,102 INFO L125 PetriNetUnfolderBase]: For 195649/195651 co-relation queries the response was YES. [2024-06-04 17:35:48,120 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-04 17:35:48,134 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 177 selfloop transitions, 24 changer transitions 0/212 dead transitions. [2024-06-04 17:35:48,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 212 transitions, 2333 flow [2024-06-04 17:35:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:35:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:35:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-04 17:35:48,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42524916943521596 [2024-06-04 17:35:48,135 INFO L175 Difference]: Start difference. First operand has 158 places, 190 transitions, 1693 flow. Second operand 7 states and 128 transitions. [2024-06-04 17:35:48,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 212 transitions, 2333 flow [2024-06-04 17:35:48,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 212 transitions, 2269 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-04 17:35:48,284 INFO L231 Difference]: Finished difference. Result has 160 places, 196 transitions, 1789 flow [2024-06-04 17:35:48,284 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-04 17:35:48,284 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 116 predicate places. [2024-06-04 17:35:48,284 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 196 transitions, 1789 flow [2024-06-04 17:35:48,284 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-04 17:35:48,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:35:48,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:35:48,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:35:48,285 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-04 17:35:48,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:35:48,285 INFO L85 PathProgramCache]: Analyzing trace with hash -148755451, now seen corresponding path program 2 times [2024-06-04 17:35:48,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:35:48,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628391507] [2024-06-04 17:35:48,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:35:48,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:35:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:35:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:35:59,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:35:59,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628391507] [2024-06-04 17:35:59,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628391507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:35:59,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:35:59,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:35:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157973690] [2024-06-04 17:35:59,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:35:59,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:35:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:35:59,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:35:59,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:35:59,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:35:59,932 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-04 17:35:59,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:35:59,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:35:59,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:36:01,159 INFO L124 PetriNetUnfolderBase]: 2469/3926 cut-off events. [2024-06-04 17:36:01,159 INFO L125 PetriNetUnfolderBase]: For 203113/203121 co-relation queries the response was YES. [2024-06-04 17:36:01,178 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-04 17:36:01,192 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 182 selfloop transitions, 26 changer transitions 0/213 dead transitions. [2024-06-04 17:36:01,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 213 transitions, 2435 flow [2024-06-04 17:36:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:36:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:36:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-04 17:36:01,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3920265780730897 [2024-06-04 17:36:01,193 INFO L175 Difference]: Start difference. First operand has 160 places, 196 transitions, 1789 flow. Second operand 7 states and 118 transitions. [2024-06-04 17:36:01,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 213 transitions, 2435 flow [2024-06-04 17:36:01,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 213 transitions, 2361 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-04 17:36:01,332 INFO L231 Difference]: Finished difference. Result has 163 places, 202 transitions, 1887 flow [2024-06-04 17:36:01,333 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-04 17:36:01,333 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 119 predicate places. [2024-06-04 17:36:01,333 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 202 transitions, 1887 flow [2024-06-04 17:36:01,333 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-04 17:36:01,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:36:01,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:36:01,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:36:01,333 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-04 17:36:01,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:36:01,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1176552181, now seen corresponding path program 3 times [2024-06-04 17:36:01,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:36:01,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881124297] [2024-06-04 17:36:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:36:01,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:36:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:36:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:36:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:36:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881124297] [2024-06-04 17:36:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881124297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:36:13,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:36:13,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:36:13,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271096309] [2024-06-04 17:36:13,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:36:13,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:36:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:36:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:36:13,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:36:13,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:36:13,362 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-04 17:36:13,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:36:13,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:36:13,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:36:14,694 INFO L124 PetriNetUnfolderBase]: 2356/3833 cut-off events. [2024-06-04 17:36:14,694 INFO L125 PetriNetUnfolderBase]: For 213216/213224 co-relation queries the response was YES. [2024-06-04 17:36:14,712 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-04 17:36:14,727 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 174 selfloop transitions, 31 changer transitions 0/218 dead transitions. [2024-06-04 17:36:14,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 218 transitions, 2485 flow [2024-06-04 17:36:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:36:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:36:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-04 17:36:14,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-04 17:36:14,729 INFO L175 Difference]: Start difference. First operand has 163 places, 202 transitions, 1887 flow. Second operand 7 states and 127 transitions. [2024-06-04 17:36:14,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 218 transitions, 2485 flow [2024-06-04 17:36:14,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 218 transitions, 2411 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-04 17:36:14,925 INFO L231 Difference]: Finished difference. Result has 167 places, 205 transitions, 1943 flow [2024-06-04 17:36:14,925 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-04 17:36:14,925 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 123 predicate places. [2024-06-04 17:36:14,926 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 205 transitions, 1943 flow [2024-06-04 17:36:14,926 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-04 17:36:14,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:36:14,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:36:14,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:36:14,926 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-04 17:36:14,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:36:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1003824955, now seen corresponding path program 3 times [2024-06-04 17:36:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:36:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694673397] [2024-06-04 17:36:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:36:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:36:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:36:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:36:26,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:36:26,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694673397] [2024-06-04 17:36:26,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694673397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:36:26,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:36:26,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:36:26,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012258862] [2024-06-04 17:36:26,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:36:26,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:36:26,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:36:26,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:36:26,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:36:26,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:36:26,893 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-04 17:36:26,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:36:26,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:36:26,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:36:28,133 INFO L124 PetriNetUnfolderBase]: 2460/3914 cut-off events. [2024-06-04 17:36:28,133 INFO L125 PetriNetUnfolderBase]: For 215079/215087 co-relation queries the response was YES. [2024-06-04 17:36:28,151 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-04 17:36:28,163 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 183 selfloop transitions, 27 changer transitions 0/215 dead transitions. [2024-06-04 17:36:28,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 215 transitions, 2391 flow [2024-06-04 17:36:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:36:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:36:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 17:36:28,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3853820598006645 [2024-06-04 17:36:28,164 INFO L175 Difference]: Start difference. First operand has 167 places, 205 transitions, 1943 flow. Second operand 7 states and 116 transitions. [2024-06-04 17:36:28,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 215 transitions, 2391 flow [2024-06-04 17:36:28,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 215 transitions, 2251 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-04 17:36:28,320 INFO L231 Difference]: Finished difference. Result has 169 places, 205 transitions, 1863 flow [2024-06-04 17:36:28,321 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-04 17:36:28,321 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 125 predicate places. [2024-06-04 17:36:28,321 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 205 transitions, 1863 flow [2024-06-04 17:36:28,326 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-04 17:36:28,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:36:28,326 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-04 17:36:28,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:36:28,327 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-04 17:36:28,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:36:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash 826609295, now seen corresponding path program 1 times [2024-06-04 17:36:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:36:28,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448700679] [2024-06-04 17:36:28,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:36:28,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:36:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:36:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:36:40,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:36:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448700679] [2024-06-04 17:36:40,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448700679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:36:40,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:36:40,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:36:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500846292] [2024-06-04 17:36:40,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:36:40,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:36:40,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:36:40,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:36:40,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:36:40,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:36:40,966 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-04 17:36:40,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:36:40,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:36:40,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:36:42,409 INFO L124 PetriNetUnfolderBase]: 2674/4169 cut-off events. [2024-06-04 17:36:42,409 INFO L125 PetriNetUnfolderBase]: For 265869/265881 co-relation queries the response was YES. [2024-06-04 17:36:42,430 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-04 17:36:42,446 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 186 selfloop transitions, 42 changer transitions 0/232 dead transitions. [2024-06-04 17:36:42,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 232 transitions, 2465 flow [2024-06-04 17:36:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:36:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:36:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-04 17:36:42,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39825581395348836 [2024-06-04 17:36:42,447 INFO L175 Difference]: Start difference. First operand has 169 places, 205 transitions, 1863 flow. Second operand 8 states and 137 transitions. [2024-06-04 17:36:42,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 232 transitions, 2465 flow [2024-06-04 17:36:42,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 232 transitions, 2401 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:36:42,613 INFO L231 Difference]: Finished difference. Result has 171 places, 209 transitions, 1970 flow [2024-06-04 17:36:42,614 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-04 17:36:42,614 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 127 predicate places. [2024-06-04 17:36:42,614 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 209 transitions, 1970 flow [2024-06-04 17:36:42,614 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-04 17:36:42,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:36:42,614 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-04 17:36:42,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:36:42,614 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-04 17:36:42,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:36:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash 213227116, now seen corresponding path program 1 times [2024-06-04 17:36:42,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:36:42,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32727740] [2024-06-04 17:36:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:36:42,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:36:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:36:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:36:54,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:36:54,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32727740] [2024-06-04 17:36:54,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32727740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:36:54,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:36:54,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:36:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207892923] [2024-06-04 17:36:54,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:36:54,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:36:54,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:36:54,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:36:54,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:36:55,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:36:55,011 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-04 17:36:55,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:36:55,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:36:55,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:36:56,422 INFO L124 PetriNetUnfolderBase]: 2612/4106 cut-off events. [2024-06-04 17:36:56,422 INFO L125 PetriNetUnfolderBase]: For 279033/279041 co-relation queries the response was YES. [2024-06-04 17:36:56,445 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-04 17:36:56,461 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 181 selfloop transitions, 38 changer transitions 0/232 dead transitions. [2024-06-04 17:36:56,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 232 transitions, 2525 flow [2024-06-04 17:36:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:36:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:36:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-04 17:36:56,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-04 17:36:56,462 INFO L175 Difference]: Start difference. First operand has 171 places, 209 transitions, 1970 flow. Second operand 7 states and 127 transitions. [2024-06-04 17:36:56,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 232 transitions, 2525 flow [2024-06-04 17:36:56,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 232 transitions, 2382 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-04 17:36:56,678 INFO L231 Difference]: Finished difference. Result has 172 places, 213 transitions, 1977 flow [2024-06-04 17:36:56,678 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-04 17:36:56,678 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 128 predicate places. [2024-06-04 17:36:56,678 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 213 transitions, 1977 flow [2024-06-04 17:36:56,678 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-04 17:36:56,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:36:56,679 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-04 17:36:56,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:36:56,679 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-04 17:36:56,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:36:56,679 INFO L85 PathProgramCache]: Analyzing trace with hash 835867352, now seen corresponding path program 2 times [2024-06-04 17:36:56,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:36:56,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674880977] [2024-06-04 17:36:56,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:36:56,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:36:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:37:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:37:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:37:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674880977] [2024-06-04 17:37:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674880977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:37:09,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:37:09,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:37:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411279523] [2024-06-04 17:37:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:37:09,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:37:09,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:37:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:37:09,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:37:09,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:37:09,347 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-04 17:37:09,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:37:09,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:37:09,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:37:10,800 INFO L124 PetriNetUnfolderBase]: 2614/4108 cut-off events. [2024-06-04 17:37:10,800 INFO L125 PetriNetUnfolderBase]: For 287989/287997 co-relation queries the response was YES. [2024-06-04 17:37:10,820 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-04 17:37:10,835 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 172 selfloop transitions, 47 changer transitions 0/232 dead transitions. [2024-06-04 17:37:10,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 232 transitions, 2619 flow [2024-06-04 17:37:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:37:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:37:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-04 17:37:10,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-04 17:37:10,836 INFO L175 Difference]: Start difference. First operand has 172 places, 213 transitions, 1977 flow. Second operand 7 states and 126 transitions. [2024-06-04 17:37:10,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 232 transitions, 2619 flow [2024-06-04 17:37:11,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 232 transitions, 2514 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-04 17:37:11,073 INFO L231 Difference]: Finished difference. Result has 174 places, 216 transitions, 2033 flow [2024-06-04 17:37:11,073 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-04 17:37:11,073 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 130 predicate places. [2024-06-04 17:37:11,073 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 216 transitions, 2033 flow [2024-06-04 17:37:11,073 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-04 17:37:11,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:37:11,073 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-04 17:37:11,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:37:11,074 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-04 17:37:11,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:37:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash -693068215, now seen corresponding path program 2 times [2024-06-04 17:37:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:37:11,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933757023] [2024-06-04 17:37:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:37:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:37:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:37:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:37:22,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:37:22,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933757023] [2024-06-04 17:37:22,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933757023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:37:22,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:37:22,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:37:22,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485047327] [2024-06-04 17:37:22,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:37:22,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:37:22,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:37:22,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:37:22,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:37:22,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:37:22,898 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-04 17:37:22,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:37:22,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:37:22,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:37:24,289 INFO L124 PetriNetUnfolderBase]: 2722/4237 cut-off events. [2024-06-04 17:37:24,289 INFO L125 PetriNetUnfolderBase]: For 301639/301647 co-relation queries the response was YES. [2024-06-04 17:37:24,310 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-04 17:37:24,325 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 183 selfloop transitions, 56 changer transitions 0/243 dead transitions. [2024-06-04 17:37:24,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 243 transitions, 2953 flow [2024-06-04 17:37:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:37:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:37:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-04 17:37:24,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39244186046511625 [2024-06-04 17:37:24,326 INFO L175 Difference]: Start difference. First operand has 174 places, 216 transitions, 2033 flow. Second operand 8 states and 135 transitions. [2024-06-04 17:37:24,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 243 transitions, 2953 flow [2024-06-04 17:37:24,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 243 transitions, 2847 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-04 17:37:24,567 INFO L231 Difference]: Finished difference. Result has 179 places, 224 transitions, 2225 flow [2024-06-04 17:37:24,567 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-04 17:37:24,568 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places. [2024-06-04 17:37:24,568 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 224 transitions, 2225 flow [2024-06-04 17:37:24,568 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-04 17:37:24,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:37:24,568 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-04 17:37:24,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:37:24,568 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-04 17:37:24,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:37:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash 835875288, now seen corresponding path program 1 times [2024-06-04 17:37:24,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:37:24,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248928606] [2024-06-04 17:37:24,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:37:24,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:37:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:37:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:37:37,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:37:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248928606] [2024-06-04 17:37:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248928606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:37:37,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:37:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:37:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501757058] [2024-06-04 17:37:37,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:37:37,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:37:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:37:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:37:37,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:37:37,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:37:37,585 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-04 17:37:37,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:37:37,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:37:37,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:37:38,996 INFO L124 PetriNetUnfolderBase]: 2727/4246 cut-off events. [2024-06-04 17:37:38,996 INFO L125 PetriNetUnfolderBase]: For 315793/315799 co-relation queries the response was YES. [2024-06-04 17:37:39,019 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-04 17:37:39,034 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 222 selfloop transitions, 19 changer transitions 0/245 dead transitions. [2024-06-04 17:37:39,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 245 transitions, 2827 flow [2024-06-04 17:37:39,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:37:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:37:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-04 17:37:39,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633720930232558 [2024-06-04 17:37:39,035 INFO L175 Difference]: Start difference. First operand has 179 places, 224 transitions, 2225 flow. Second operand 8 states and 125 transitions. [2024-06-04 17:37:39,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 245 transitions, 2827 flow [2024-06-04 17:37:39,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 245 transitions, 2678 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-04 17:37:39,348 INFO L231 Difference]: Finished difference. Result has 183 places, 227 transitions, 2188 flow [2024-06-04 17:37:39,348 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-04 17:37:39,348 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 139 predicate places. [2024-06-04 17:37:39,348 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 227 transitions, 2188 flow [2024-06-04 17:37:39,348 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-04 17:37:39,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:37:39,349 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-04 17:37:39,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:37:39,349 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-04 17:37:39,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:37:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1437781873, now seen corresponding path program 3 times [2024-06-04 17:37:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:37:39,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474610574] [2024-06-04 17:37:39,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:37:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:37:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:37:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:37:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:37:51,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474610574] [2024-06-04 17:37:51,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474610574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:37:51,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:37:51,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:37:51,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325339617] [2024-06-04 17:37:51,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:37:51,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:37:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:37:51,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:37:51,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:37:51,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:37:51,249 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-04 17:37:51,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:37:51,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:37:51,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:37:52,766 INFO L124 PetriNetUnfolderBase]: 2731/4250 cut-off events. [2024-06-04 17:37:52,766 INFO L125 PetriNetUnfolderBase]: For 322931/322939 co-relation queries the response was YES. [2024-06-04 17:37:52,789 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-04 17:37:52,803 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 184 selfloop transitions, 60 changer transitions 0/248 dead transitions. [2024-06-04 17:37:52,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 248 transitions, 2909 flow [2024-06-04 17:37:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:37:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:37:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-04 17:37:52,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39244186046511625 [2024-06-04 17:37:52,804 INFO L175 Difference]: Start difference. First operand has 183 places, 227 transitions, 2188 flow. Second operand 8 states and 135 transitions. [2024-06-04 17:37:52,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 248 transitions, 2909 flow [2024-06-04 17:37:53,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 248 transitions, 2819 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-04 17:37:53,123 INFO L231 Difference]: Finished difference. Result has 185 places, 231 transitions, 2304 flow [2024-06-04 17:37:53,123 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-04 17:37:53,123 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 141 predicate places. [2024-06-04 17:37:53,123 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 231 transitions, 2304 flow [2024-06-04 17:37:53,124 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-04 17:37:53,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:37:53,124 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-04 17:37:53,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:37:53,124 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-04 17:37:53,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:37:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1427859160, now seen corresponding path program 3 times [2024-06-04 17:37:53,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:37:53,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262738211] [2024-06-04 17:37:53,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:37:53,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:37:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:38:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:38:05,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:38:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262738211] [2024-06-04 17:38:05,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262738211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:38:05,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:38:05,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:38:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409503442] [2024-06-04 17:38:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:38:05,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:38:05,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:38:05,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:38:05,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:38:05,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:38:05,925 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-04 17:38:05,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:38:05,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:38:05,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:38:07,379 INFO L124 PetriNetUnfolderBase]: 2652/4167 cut-off events. [2024-06-04 17:38:07,379 INFO L125 PetriNetUnfolderBase]: For 333092/333094 co-relation queries the response was YES. [2024-06-04 17:38:07,403 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-04 17:38:07,417 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 194 selfloop transitions, 41 changer transitions 0/251 dead transitions. [2024-06-04 17:38:07,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 251 transitions, 2865 flow [2024-06-04 17:38:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:38:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:38:07,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-04 17:38:07,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3953488372093023 [2024-06-04 17:38:07,419 INFO L175 Difference]: Start difference. First operand has 185 places, 231 transitions, 2304 flow. Second operand 8 states and 136 transitions. [2024-06-04 17:38:07,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 251 transitions, 2865 flow [2024-06-04 17:38:07,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 251 transitions, 2692 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-04 17:38:07,749 INFO L231 Difference]: Finished difference. Result has 189 places, 233 transitions, 2248 flow [2024-06-04 17:38:07,749 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-04 17:38:07,749 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 145 predicate places. [2024-06-04 17:38:07,749 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 233 transitions, 2248 flow [2024-06-04 17:38:07,750 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-04 17:38:07,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:38:07,750 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-04 17:38:07,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:38:07,750 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-04 17:38:07,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:38:07,750 INFO L85 PathProgramCache]: Analyzing trace with hash -518738898, now seen corresponding path program 4 times [2024-06-04 17:38:07,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:38:07,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293273189] [2024-06-04 17:38:07,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:38:07,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:38:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:38:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:38:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:38:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293273189] [2024-06-04 17:38:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293273189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:38:19,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:38:19,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:38:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093728390] [2024-06-04 17:38:19,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:38:19,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:38:19,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:38:19,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:38:19,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:38:19,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:38:19,754 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-04 17:38:19,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:38:19,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:38:19,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:38:21,168 INFO L124 PetriNetUnfolderBase]: 2657/4171 cut-off events. [2024-06-04 17:38:21,169 INFO L125 PetriNetUnfolderBase]: For 343988/343998 co-relation queries the response was YES. [2024-06-04 17:38:21,194 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-04 17:38:21,210 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 185 selfloop transitions, 48 changer transitions 0/249 dead transitions. [2024-06-04 17:38:21,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 249 transitions, 2806 flow [2024-06-04 17:38:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:38:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:38:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-04 17:38:21,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40863787375415284 [2024-06-04 17:38:21,211 INFO L175 Difference]: Start difference. First operand has 189 places, 233 transitions, 2248 flow. Second operand 7 states and 123 transitions. [2024-06-04 17:38:21,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 249 transitions, 2806 flow [2024-06-04 17:38:21,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 249 transitions, 2685 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:38:21,580 INFO L231 Difference]: Finished difference. Result has 190 places, 236 transitions, 2287 flow [2024-06-04 17:38:21,580 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-04 17:38:21,580 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 146 predicate places. [2024-06-04 17:38:21,580 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 236 transitions, 2287 flow [2024-06-04 17:38:21,580 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-04 17:38:21,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:38:21,580 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-04 17:38:21,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:38:21,581 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-04 17:38:21,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:38:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash -316463878, now seen corresponding path program 5 times [2024-06-04 17:38:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:38:21,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366019312] [2024-06-04 17:38:21,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:38:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:38:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:38:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:38:34,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:38:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366019312] [2024-06-04 17:38:34,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366019312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:38:34,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:38:34,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:38:34,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285103869] [2024-06-04 17:38:34,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:38:34,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:38:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:38:34,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:38:34,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:38:34,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:38:34,508 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-04 17:38:34,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:38:34,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:38:34,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:38:35,920 INFO L124 PetriNetUnfolderBase]: 2662/4179 cut-off events. [2024-06-04 17:38:35,920 INFO L125 PetriNetUnfolderBase]: For 355865/355881 co-relation queries the response was YES. [2024-06-04 17:38:35,946 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-04 17:38:35,961 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 165 selfloop transitions, 68 changer transitions 0/249 dead transitions. [2024-06-04 17:38:35,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 249 transitions, 2951 flow [2024-06-04 17:38:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:38:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:38:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-04 17:38:35,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053156146179402 [2024-06-04 17:38:35,963 INFO L175 Difference]: Start difference. First operand has 190 places, 236 transitions, 2287 flow. Second operand 7 states and 122 transitions. [2024-06-04 17:38:35,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 249 transitions, 2951 flow [2024-06-04 17:38:36,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 249 transitions, 2823 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-04 17:38:36,281 INFO L231 Difference]: Finished difference. Result has 192 places, 239 transitions, 2359 flow [2024-06-04 17:38:36,281 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-04 17:38:36,281 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 148 predicate places. [2024-06-04 17:38:36,281 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 239 transitions, 2359 flow [2024-06-04 17:38:36,282 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-04 17:38:36,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:38:36,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-04 17:38:36,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:38:36,282 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-04 17:38:36,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:38:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1061373766, now seen corresponding path program 6 times [2024-06-04 17:38:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:38:36,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010883679] [2024-06-04 17:38:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:38:36,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:38:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:38:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:38:48,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:38:48,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010883679] [2024-06-04 17:38:48,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010883679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:38:48,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:38:48,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:38:48,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145990004] [2024-06-04 17:38:48,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:38:48,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:38:48,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:38:48,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:38:48,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:38:48,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-04 17:38:48,270 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-04 17:38:48,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:38:48,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-04 17:38:48,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:38:49,635 INFO L124 PetriNetUnfolderBase]: 2654/4169 cut-off events. [2024-06-04 17:38:49,636 INFO L125 PetriNetUnfolderBase]: For 365523/365539 co-relation queries the response was YES. [2024-06-04 17:38:49,660 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-04 17:38:49,675 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 168 selfloop transitions, 64 changer transitions 0/248 dead transitions. [2024-06-04 17:38:49,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 248 transitions, 2847 flow [2024-06-04 17:38:49,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:38:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:38:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-04 17:38:49,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053156146179402 [2024-06-04 17:38:49,676 INFO L175 Difference]: Start difference. First operand has 192 places, 239 transitions, 2359 flow. Second operand 7 states and 122 transitions. [2024-06-04 17:38:49,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 248 transitions, 2847 flow [2024-06-04 17:38:49,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 248 transitions, 2646 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-04 17:38:49,998 INFO L231 Difference]: Finished difference. Result has 195 places, 239 transitions, 2294 flow [2024-06-04 17:38:49,998 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-04 17:38:49,998 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places. [2024-06-04 17:38:49,998 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 239 transitions, 2294 flow [2024-06-04 17:38:49,998 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-04 17:38:49,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:38:49,999 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-04 17:38:49,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:38:49,999 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-04 17:38:49,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:38:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1066484550, now seen corresponding path program 2 times [2024-06-04 17:38:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:38:49,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108981349] [2024-06-04 17:38:50,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:38:50,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:38:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:39:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:39:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:39:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108981349] [2024-06-04 17:39:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108981349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:39:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:39:03,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:39:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302083185] [2024-06-04 17:39:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:39:03,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:39:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:39:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:39:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:39:03,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:39:03,797 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-04 17:39:03,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:39:03,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:39:03,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:39:05,286 INFO L124 PetriNetUnfolderBase]: 2731/4256 cut-off events. [2024-06-04 17:39:05,286 INFO L125 PetriNetUnfolderBase]: For 373557/373575 co-relation queries the response was YES. [2024-06-04 17:39:05,310 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-04 17:39:05,325 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 217 selfloop transitions, 39 changer transitions 0/260 dead transitions. [2024-06-04 17:39:05,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 260 transitions, 3115 flow [2024-06-04 17:39:05,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:39:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:39:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-04 17:39:05,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36046511627906974 [2024-06-04 17:39:05,326 INFO L175 Difference]: Start difference. First operand has 195 places, 239 transitions, 2294 flow. Second operand 8 states and 124 transitions. [2024-06-04 17:39:05,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 260 transitions, 3115 flow [2024-06-04 17:39:05,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 260 transitions, 2960 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 17:39:05,758 INFO L231 Difference]: Finished difference. Result has 197 places, 247 transitions, 2393 flow [2024-06-04 17:39:05,758 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-04 17:39:05,758 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 153 predicate places. [2024-06-04 17:39:05,759 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 247 transitions, 2393 flow [2024-06-04 17:39:05,759 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-04 17:39:05,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:39:05,759 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-04 17:39:05,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:39:05,759 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-04 17:39:05,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:39:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash -309282852, now seen corresponding path program 3 times [2024-06-04 17:39:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:39:05,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763708471] [2024-06-04 17:39:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:39:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:39:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:39:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:39:17,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:39:17,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763708471] [2024-06-04 17:39:17,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763708471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:39:17,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:39:17,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:39:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373627558] [2024-06-04 17:39:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:39:17,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:39:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:39:17,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:39:17,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:39:17,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:39:17,970 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-04 17:39:17,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:39:17,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:39:17,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:39:19,445 INFO L124 PetriNetUnfolderBase]: 2736/4261 cut-off events. [2024-06-04 17:39:19,445 INFO L125 PetriNetUnfolderBase]: For 387372/387390 co-relation queries the response was YES. [2024-06-04 17:39:19,469 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-04 17:39:19,484 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 219 selfloop transitions, 40 changer transitions 0/263 dead transitions. [2024-06-04 17:39:19,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 263 transitions, 3153 flow [2024-06-04 17:39:19,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:39:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:39:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-04 17:39:19,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633720930232558 [2024-06-04 17:39:19,485 INFO L175 Difference]: Start difference. First operand has 197 places, 247 transitions, 2393 flow. Second operand 8 states and 125 transitions. [2024-06-04 17:39:19,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 263 transitions, 3153 flow [2024-06-04 17:39:19,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 263 transitions, 3030 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-04 17:39:19,779 INFO L231 Difference]: Finished difference. Result has 201 places, 250 transitions, 2435 flow [2024-06-04 17:39:19,779 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-04 17:39:19,780 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 157 predicate places. [2024-06-04 17:39:19,780 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 250 transitions, 2435 flow [2024-06-04 17:39:19,780 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-04 17:39:19,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:39:19,780 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-04 17:39:19,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:39:19,780 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-04 17:39:19,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:39:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1389730753, now seen corresponding path program 4 times [2024-06-04 17:39:19,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:39:19,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71387761] [2024-06-04 17:39:19,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:39:19,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:39:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:39:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:39:32,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:39:32,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71387761] [2024-06-04 17:39:32,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71387761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:39:32,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:39:32,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:39:32,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720235364] [2024-06-04 17:39:32,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:39:32,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:39:32,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:39:32,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:39:32,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:39:32,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:39:32,960 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-04 17:39:32,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:39:32,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:39:32,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:39:34,470 INFO L124 PetriNetUnfolderBase]: 2754/4280 cut-off events. [2024-06-04 17:39:34,470 INFO L125 PetriNetUnfolderBase]: For 402133/402149 co-relation queries the response was YES. [2024-06-04 17:39:34,495 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-04 17:39:34,510 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 178 selfloop transitions, 93 changer transitions 0/275 dead transitions. [2024-06-04 17:39:34,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 275 transitions, 3647 flow [2024-06-04 17:39:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:39:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:39:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-04 17:39:34,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39244186046511625 [2024-06-04 17:39:34,511 INFO L175 Difference]: Start difference. First operand has 201 places, 250 transitions, 2435 flow. Second operand 8 states and 135 transitions. [2024-06-04 17:39:34,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 275 transitions, 3647 flow [2024-06-04 17:39:34,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 275 transitions, 3536 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-04 17:39:34,876 INFO L231 Difference]: Finished difference. Result has 205 places, 262 transitions, 2825 flow [2024-06-04 17:39:34,876 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-04 17:39:34,876 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 161 predicate places. [2024-06-04 17:39:34,877 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 262 transitions, 2825 flow [2024-06-04 17:39:34,877 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-04 17:39:34,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:39:34,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:39:34,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:39:34,877 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-04 17:39:34,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:39:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1066872763, now seen corresponding path program 5 times [2024-06-04 17:39:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:39:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690992210] [2024-06-04 17:39:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:39:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:39:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:39:48,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-04 17:39:48,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:39:48,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690992210] [2024-06-04 17:39:48,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690992210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:39:48,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:39:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:39:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802776494] [2024-06-04 17:39:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:39:48,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:39:48,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:39:48,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:39:48,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:39:48,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:39:48,250 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-04 17:39:48,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:39:48,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:39:48,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:39:49,835 INFO L124 PetriNetUnfolderBase]: 2782/4324 cut-off events. [2024-06-04 17:39:49,835 INFO L125 PetriNetUnfolderBase]: For 422801/422814 co-relation queries the response was YES. [2024-06-04 17:39:49,861 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-04 17:39:49,877 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 183 selfloop transitions, 96 changer transitions 0/283 dead transitions. [2024-06-04 17:39:49,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 283 transitions, 3986 flow [2024-06-04 17:39:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:39:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:39:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-04 17:39:49,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39244186046511625 [2024-06-04 17:39:49,878 INFO L175 Difference]: Start difference. First operand has 205 places, 262 transitions, 2825 flow. Second operand 8 states and 135 transitions. [2024-06-04 17:39:49,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 283 transitions, 3986 flow [2024-06-04 17:39:50,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 283 transitions, 3680 flow, removed 95 selfloop flow, removed 4 redundant places. [2024-06-04 17:39:50,326 INFO L231 Difference]: Finished difference. Result has 210 places, 270 transitions, 2937 flow [2024-06-04 17:39:50,326 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-04 17:39:50,327 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 166 predicate places. [2024-06-04 17:39:50,327 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 270 transitions, 2937 flow [2024-06-04 17:39:50,327 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-04 17:39:50,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:39:50,327 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-04 17:39:50,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:39:50,328 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-04 17:39:50,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:39:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1053985753, now seen corresponding path program 6 times [2024-06-04 17:39:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:39:50,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981032077] [2024-06-04 17:39:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:39:50,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:39:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:40:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:40:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:40:02,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981032077] [2024-06-04 17:40:02,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981032077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:40:02,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:40:02,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:40:02,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941925519] [2024-06-04 17:40:02,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:40:02,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:40:02,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:40:02,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:40:02,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:40:02,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:40:02,806 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-04 17:40:02,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:40:02,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:40:02,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:40:04,287 INFO L124 PetriNetUnfolderBase]: 2778/4320 cut-off events. [2024-06-04 17:40:04,287 INFO L125 PetriNetUnfolderBase]: For 427640/427653 co-relation queries the response was YES. [2024-06-04 17:40:04,315 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-04 17:40:04,330 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 176 selfloop transitions, 102 changer transitions 0/282 dead transitions. [2024-06-04 17:40:04,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 282 transitions, 3775 flow [2024-06-04 17:40:04,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:40:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:40:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-04 17:40:04,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3866279069767442 [2024-06-04 17:40:04,331 INFO L175 Difference]: Start difference. First operand has 210 places, 270 transitions, 2937 flow. Second operand 8 states and 133 transitions. [2024-06-04 17:40:04,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 282 transitions, 3775 flow [2024-06-04 17:40:04,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 282 transitions, 3505 flow, removed 62 selfloop flow, removed 4 redundant places. [2024-06-04 17:40:04,884 INFO L231 Difference]: Finished difference. Result has 214 places, 270 transitions, 2879 flow [2024-06-04 17:40:04,884 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-04 17:40:04,885 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 170 predicate places. [2024-06-04 17:40:04,885 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 270 transitions, 2879 flow [2024-06-04 17:40:04,885 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-04 17:40:04,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:40:04,885 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-04 17:40:04,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:40:04,885 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-04 17:40:04,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:40:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash -322169862, now seen corresponding path program 4 times [2024-06-04 17:40:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:40:04,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381355717] [2024-06-04 17:40:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:40:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:40:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:40:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:40:18,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:40:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381355717] [2024-06-04 17:40:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381355717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:40:18,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:40:18,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:40:18,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462790538] [2024-06-04 17:40:18,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:40:18,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:40:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:40:18,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:40:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:40:18,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-04 17:40:18,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 270 transitions, 2879 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-04 17:40:18,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:40:18,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-04 17:40:18,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:40:19,770 INFO L124 PetriNetUnfolderBase]: 2775/4324 cut-off events. [2024-06-04 17:40:19,770 INFO L125 PetriNetUnfolderBase]: For 436227/436239 co-relation queries the response was YES. [2024-06-04 17:40:19,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36201 conditions, 4324 events. 2775/4324 cut-off events. For 436227/436239 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23385 event pairs, 750 based on Foata normal form. 9/4326 useless extension candidates. Maximal degree in co-relation 36097. Up to 4144 conditions per place. [2024-06-04 17:40:19,811 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 239 selfloop transitions, 40 changer transitions 0/283 dead transitions. [2024-06-04 17:40:19,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 283 transitions, 3486 flow [2024-06-04 17:40:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:40:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:40:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-04 17:40:19,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633720930232558 [2024-06-04 17:40:19,812 INFO L175 Difference]: Start difference. First operand has 214 places, 270 transitions, 2879 flow. Second operand 8 states and 125 transitions. [2024-06-04 17:40:19,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 283 transitions, 3486 flow [2024-06-04 17:40:20,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 283 transitions, 3163 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-06-04 17:40:20,180 INFO L231 Difference]: Finished difference. Result has 213 places, 271 transitions, 2650 flow [2024-06-04 17:40:20,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2650, PETRI_PLACES=213, PETRI_TRANSITIONS=271} [2024-06-04 17:40:20,180 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 169 predicate places. [2024-06-04 17:40:20,180 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 271 transitions, 2650 flow [2024-06-04 17:40:20,180 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-04 17:40:20,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:40:20,181 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-04 17:40:20,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:40:20,181 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:40:20,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:40:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2033889752, now seen corresponding path program 1 times [2024-06-04 17:40:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:40:20,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396101220] [2024-06-04 17:40:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:40:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:40:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:40:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:40:33,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:40:33,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396101220] [2024-06-04 17:40:33,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396101220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:40:33,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:40:33,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:40:33,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902782940] [2024-06-04 17:40:33,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:40:33,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:40:33,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:40:33,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:40:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:40:33,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 17:40:33,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 271 transitions, 2650 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:40:33,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:40:33,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 17:40:33,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:40:34,949 INFO L124 PetriNetUnfolderBase]: 2594/4133 cut-off events. [2024-06-04 17:40:34,950 INFO L125 PetriNetUnfolderBase]: For 448270/448274 co-relation queries the response was YES. [2024-06-04 17:40:34,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34884 conditions, 4133 events. 2594/4133 cut-off events. For 448270/448274 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 23039 event pairs, 716 based on Foata normal form. 2/4132 useless extension candidates. Maximal degree in co-relation 34781. Up to 3759 conditions per place. [2024-06-04 17:40:34,989 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 241 selfloop transitions, 19 changer transitions 0/287 dead transitions. [2024-06-04 17:40:34,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 287 transitions, 3218 flow [2024-06-04 17:40:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:40:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:40:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-04 17:40:34,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-04 17:40:34,990 INFO L175 Difference]: Start difference. First operand has 213 places, 271 transitions, 2650 flow. Second operand 7 states and 127 transitions. [2024-06-04 17:40:34,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 287 transitions, 3218 flow [2024-06-04 17:40:35,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 287 transitions, 3123 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-04 17:40:35,354 INFO L231 Difference]: Finished difference. Result has 215 places, 271 transitions, 2603 flow [2024-06-04 17:40:35,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2603, PETRI_PLACES=215, PETRI_TRANSITIONS=271} [2024-06-04 17:40:35,355 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 171 predicate places. [2024-06-04 17:40:35,355 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 271 transitions, 2603 flow [2024-06-04 17:40:35,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:40:35,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:40:35,355 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-04 17:40:35,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:40:35,355 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:40:35,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:40:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2033980117, now seen corresponding path program 1 times [2024-06-04 17:40:35,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:40:35,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407274900] [2024-06-04 17:40:35,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:40:35,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:40:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15