./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix001.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/mix001.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix001.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix001.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-cde23df-m [2024-06-14 14:22:36,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:22:36,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:22:36,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:22:36,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:22:36,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:22:36,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:22:36,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:22:36,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:22:36,491 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:22:36,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:22:36,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:22:36,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:22:36,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:22:36,494 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:22:36,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:22:36,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:22:36,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:22:36,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:22:36,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:22:36,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:22:36,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:22:36,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:22:36,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:22:36,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:22:36,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:22:36,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:22:36,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:22:36,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:22:36,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:22:36,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:22:36,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:22:36,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:36,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:22:36,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:22:36,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:22:36,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:22:36,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:22:36,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:22:36,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:22:36,500 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:22:36,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:22:36,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:22:36,500 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 14:22:36,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:22:36,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:22:36,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:22:36,716 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:22:36,716 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:22:36,717 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/mix001.opt.yml/witness.yml [2024-06-14 14:22:36,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:22:36,954 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:22:36,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.opt.i [2024-06-14 14:22:38,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:22:38,362 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:22:38,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.opt.i [2024-06-14 14:22:38,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920430bf6/d5fcff50e39b4c858120f5dfded38572/FLAG403c03a1a [2024-06-14 14:22:38,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920430bf6/d5fcff50e39b4c858120f5dfded38572 [2024-06-14 14:22:38,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:22:38,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:22:38,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:38,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:22:38,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:22:38,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:36" (1/2) ... [2024-06-14 14:22:38,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae35271 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:38, skipping insertion in model container [2024-06-14 14:22:38,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:36" (1/2) ... [2024-06-14 14:22:38,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@600c3d5f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:38, skipping insertion in model container [2024-06-14 14:22:38,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:38" (2/2) ... [2024-06-14 14:22:38,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae35271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:38, skipping insertion in model container [2024-06-14 14:22:38,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:38" (2/2) ... [2024-06-14 14:22:38,404 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:22:38,485 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:22:38,487 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_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_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_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_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_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$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$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$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_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 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_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 )__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 )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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 )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_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_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_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 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_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_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 )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_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 )__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 )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_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 )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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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_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_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$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$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$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_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$$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_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) && (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_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (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 )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 )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_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 )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 || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0) [2024-06-14 14:22:38,488 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ((((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_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_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_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_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_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$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$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$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_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 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_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 )__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 )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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 )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_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_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_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 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_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_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 )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_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 )__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 )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_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 )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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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_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_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$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$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$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_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$$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_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) && (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_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (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 )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 )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_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 )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 || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0) [2024-06-14 14:22:38,488 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] ((((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_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_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_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_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_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$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$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$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_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 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_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 )__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 )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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 )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_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_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_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 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_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_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 )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_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 )__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 )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_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 )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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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_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_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$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$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$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_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$$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_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) && (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_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (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 )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 )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_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 )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 || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0) [2024-06-14 14:22:38,489 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:22:38,489 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-06-14 14:22:38,529 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:22:38,855 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:38,869 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:22:39,270 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:39,305 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:22:39,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39 WrapperNode [2024-06-14 14:22:39,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:39,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:39,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:22:39,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:22:39,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,469 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-06-14 14:22:39,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:39,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:22:39,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:22:39,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:22:39,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,550 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 14:22:39,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:22:39,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:22:39,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:22:39,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:22:39,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (1/1) ... [2024-06-14 14:22:39,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:39,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:39,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 14:22:39,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 14:22:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:22:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:22:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:22:39,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:22:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:22:39,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:22:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 14:22:39,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 14:22:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:22:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:22:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:22:39,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:22:39,736 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:22:39,846 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:22:39,848 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:22:41,288 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:22:41,289 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:22:41,661 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:22:41,662 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:22:41,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:41 BoogieIcfgContainer [2024-06-14 14:22:41,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:22:41,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:22:41,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:22:41,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:22:41,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:36" (1/4) ... [2024-06-14 14:22:41,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7737b30a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:22:41, skipping insertion in model container [2024-06-14 14:22:41,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:22:38" (2/4) ... [2024-06-14 14:22:41,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7737b30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:22:41, skipping insertion in model container [2024-06-14 14:22:41,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:39" (3/4) ... [2024-06-14 14:22:41,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7737b30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:22:41, skipping insertion in model container [2024-06-14 14:22:41,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:41" (4/4) ... [2024-06-14 14:22:41,672 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.opt.i [2024-06-14 14:22:41,687 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:22:41,687 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 14:22:41,688 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:22:41,859 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:22:41,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 100 flow [2024-06-14 14:22:41,977 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2024-06-14 14:22:41,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:41,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 14:22:41,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 44 transitions, 100 flow [2024-06-14 14:22:41,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow [2024-06-14 14:22:41,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:41,993 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;@126e6372, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:41,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 14:22:42,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:42,005 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 14:22:42,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:42,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:42,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:22:42,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:22:42,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:42,010 INFO L85 PathProgramCache]: Analyzing trace with hash -408876045, now seen corresponding path program 1 times [2024-06-14 14:22:42,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:42,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474304184] [2024-06-14 14:22:42,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:42,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474304184] [2024-06-14 14:22:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474304184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:50,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:50,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293922055] [2024-06-14 14:22:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:50,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:50,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:50,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:50,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-06-14 14:22:50,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:50,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:50,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-06-14 14:22:50,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:51,177 INFO L124 PetriNetUnfolderBase]: 869/1414 cut-off events. [2024-06-14 14:22:51,178 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-14 14:22:51,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 1414 events. 869/1414 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7483 event pairs, 566 based on Foata normal form. 1/1356 useless extension candidates. Maximal degree in co-relation 2779. Up to 1315 conditions per place. [2024-06-14 14:22:51,197 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 32 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-14 14:22:51,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 177 flow [2024-06-14 14:22:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-06-14 14:22:51,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-06-14 14:22:51,211 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 84 transitions. [2024-06-14 14:22:51,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 177 flow [2024-06-14 14:22:51,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 14:22:51,218 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 106 flow [2024-06-14 14:22:51,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-14 14:22:51,223 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-06-14 14:22:51,223 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 106 flow [2024-06-14 14:22:51,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:51,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:51,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:51,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:22:51,224 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:22:51,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:51,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2087833902, now seen corresponding path program 1 times [2024-06-14 14:22:51,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:51,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240805536] [2024-06-14 14:22:51,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240805536] [2024-06-14 14:22:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240805536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:57,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:22:57,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936981956] [2024-06-14 14:22:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:57,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:22:57,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:57,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:22:57,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:22:57,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-14 14:22:57,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:57,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:57,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-14 14:22:57,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:57,984 INFO L124 PetriNetUnfolderBase]: 1280/1981 cut-off events. [2024-06-14 14:22:57,984 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2024-06-14 14:22:57,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 1981 events. 1280/1981 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10135 event pairs, 750 based on Foata normal form. 3/1964 useless extension candidates. Maximal degree in co-relation 4489. Up to 1897 conditions per place. [2024-06-14 14:22:57,995 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 41 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-06-14 14:22:57,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 248 flow [2024-06-14 14:22:57,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-06-14 14:22:57,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727 [2024-06-14 14:22:57,999 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 106 flow. Second operand 4 states and 103 transitions. [2024-06-14 14:22:57,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 248 flow [2024-06-14 14:22:58,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:58,002 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 142 flow [2024-06-14 14:22:58,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-06-14 14:22:58,003 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-14 14:22:58,003 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 142 flow [2024-06-14 14:22:58,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:58,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:58,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:58,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:22:58,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:22:58,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash -298340792, now seen corresponding path program 1 times [2024-06-14 14:22:58,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:58,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394619731] [2024-06-14 14:22:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:03,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:03,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394619731] [2024-06-14 14:23:03,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394619731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:03,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:03,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:23:03,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933129450] [2024-06-14 14:23:03,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:03,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:23:03,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:23:03,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:23:03,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-14 14:23:03,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:03,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:03,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-14 14:23:03,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:04,811 INFO L124 PetriNetUnfolderBase]: 1274/1994 cut-off events. [2024-06-14 14:23:04,811 INFO L125 PetriNetUnfolderBase]: For 1138/1138 co-relation queries the response was YES. [2024-06-14 14:23:04,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5025 conditions, 1994 events. 1274/1994 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10297 event pairs, 608 based on Foata normal form. 3/1991 useless extension candidates. Maximal degree in co-relation 5008. Up to 1873 conditions per place. [2024-06-14 14:23:04,821 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 48 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2024-06-14 14:23:04,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 326 flow [2024-06-14 14:23:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:23:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:23:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-06-14 14:23:04,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2024-06-14 14:23:04,826 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 142 flow. Second operand 5 states and 126 transitions. [2024-06-14 14:23:04,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 326 flow [2024-06-14 14:23:04,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 14:23:04,830 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 178 flow [2024-06-14 14:23:04,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-14 14:23:04,831 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-06-14 14:23:04,831 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 178 flow [2024-06-14 14:23:04,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:04,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:04,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:04,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:23:04,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:04,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 848620301, now seen corresponding path program 1 times [2024-06-14 14:23:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073785603] [2024-06-14 14:23:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:18,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:18,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073785603] [2024-06-14 14:23:18,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073785603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:18,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:18,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:23:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158797651] [2024-06-14 14:23:18,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:18,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:23:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:23:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:23:18,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:23:18,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:18,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:18,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:23:18,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:19,693 INFO L124 PetriNetUnfolderBase]: 1542/2450 cut-off events. [2024-06-14 14:23:19,694 INFO L125 PetriNetUnfolderBase]: For 2318/2318 co-relation queries the response was YES. [2024-06-14 14:23:19,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6596 conditions, 2450 events. 1542/2450 cut-off events. For 2318/2318 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12794 event pairs, 853 based on Foata normal form. 2/2415 useless extension candidates. Maximal degree in co-relation 6578. Up to 2282 conditions per place. [2024-06-14 14:23:19,709 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 42 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2024-06-14 14:23:19,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 320 flow [2024-06-14 14:23:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:23:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:23:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-14 14:23:19,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4863636363636364 [2024-06-14 14:23:19,712 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 178 flow. Second operand 5 states and 107 transitions. [2024-06-14 14:23:19,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 320 flow [2024-06-14 14:23:19,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 296 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:19,717 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 198 flow [2024-06-14 14:23:19,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-06-14 14:23:19,719 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2024-06-14 14:23:19,719 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 198 flow [2024-06-14 14:23:19,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:19,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:19,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:19,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:23:19,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:19,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1582442352, now seen corresponding path program 1 times [2024-06-14 14:23:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127716675] [2024-06-14 14:23:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:19,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:26,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:26,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:26,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127716675] [2024-06-14 14:23:26,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127716675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:26,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:26,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:26,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984202284] [2024-06-14 14:23:26,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:26,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:26,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:26,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:26,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:23:26,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:26,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:26,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:23:26,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:27,785 INFO L124 PetriNetUnfolderBase]: 1763/2719 cut-off events. [2024-06-14 14:23:27,785 INFO L125 PetriNetUnfolderBase]: For 4389/4389 co-relation queries the response was YES. [2024-06-14 14:23:27,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7980 conditions, 2719 events. 1763/2719 cut-off events. For 4389/4389 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13835 event pairs, 617 based on Foata normal form. 6/2708 useless extension candidates. Maximal degree in co-relation 7960. Up to 2517 conditions per place. [2024-06-14 14:23:27,798 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 62 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2024-06-14 14:23:27,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 456 flow [2024-06-14 14:23:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-06-14 14:23:27,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525974025974026 [2024-06-14 14:23:27,801 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 198 flow. Second operand 7 states and 162 transitions. [2024-06-14 14:23:27,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 456 flow [2024-06-14 14:23:27,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 436 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:27,804 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 245 flow [2024-06-14 14:23:27,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=245, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-06-14 14:23:27,804 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2024-06-14 14:23:27,804 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 245 flow [2024-06-14 14:23:27,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:27,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:27,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:27,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:23:27,805 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:27,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash 537427222, now seen corresponding path program 1 times [2024-06-14 14:23:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:27,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243992327] [2024-06-14 14:23:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:27,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:41,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:41,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243992327] [2024-06-14 14:23:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243992327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:41,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:41,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618676600] [2024-06-14 14:23:41,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:41,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:41,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:41,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:41,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:23:41,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-14 14:23:41,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:41,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:23:41,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:42,859 INFO L124 PetriNetUnfolderBase]: 1516/2446 cut-off events. [2024-06-14 14:23:42,859 INFO L125 PetriNetUnfolderBase]: For 5299/5299 co-relation queries the response was YES. [2024-06-14 14:23:42,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7634 conditions, 2446 events. 1516/2446 cut-off events. For 5299/5299 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12919 event pairs, 653 based on Foata normal form. 4/2430 useless extension candidates. Maximal degree in co-relation 7613. Up to 2235 conditions per place. [2024-06-14 14:23:42,873 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 51 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2024-06-14 14:23:42,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 70 transitions, 429 flow [2024-06-14 14:23:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:23:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:23:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-14 14:23:42,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-14 14:23:42,874 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 245 flow. Second operand 6 states and 126 transitions. [2024-06-14 14:23:42,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 70 transitions, 429 flow [2024-06-14 14:23:42,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 390 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 14:23:42,877 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 262 flow [2024-06-14 14:23:42,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-06-14 14:23:42,878 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2024-06-14 14:23:42,878 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 262 flow [2024-06-14 14:23:42,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-14 14:23:42,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:42,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:42,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:23:42,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:42,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:42,880 INFO L85 PathProgramCache]: Analyzing trace with hash 503451168, now seen corresponding path program 1 times [2024-06-14 14:23:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:42,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823532605] [2024-06-14 14:23:42,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:42,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:55,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:55,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823532605] [2024-06-14 14:23:55,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823532605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:55,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:55,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:55,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206249860] [2024-06-14 14:23:55,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:55,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:55,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:55,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:55,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:56,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:23:56,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 262 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-14 14:23:56,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:56,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:23:56,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:57,634 INFO L124 PetriNetUnfolderBase]: 1880/2834 cut-off events. [2024-06-14 14:23:57,634 INFO L125 PetriNetUnfolderBase]: For 8468/8474 co-relation queries the response was YES. [2024-06-14 14:23:57,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9599 conditions, 2834 events. 1880/2834 cut-off events. For 8468/8474 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13869 event pairs, 777 based on Foata normal form. 6/2836 useless extension candidates. Maximal degree in co-relation 9576. Up to 2734 conditions per place. [2024-06-14 14:23:57,646 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 59 selfloop transitions, 16 changer transitions 0/80 dead transitions. [2024-06-14 14:23:57,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 530 flow [2024-06-14 14:23:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:23:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:23:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-14 14:23:57,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2024-06-14 14:23:57,648 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 262 flow. Second operand 6 states and 122 transitions. [2024-06-14 14:23:57,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 530 flow [2024-06-14 14:23:57,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 498 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 14:23:57,651 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 320 flow [2024-06-14 14:23:57,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2024-06-14 14:23:57,652 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-06-14 14:23:57,652 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 320 flow [2024-06-14 14:23:57,652 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-14 14:23:57,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:57,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:57,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:23:57,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:23:57,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:57,653 INFO L85 PathProgramCache]: Analyzing trace with hash 511674228, now seen corresponding path program 2 times [2024-06-14 14:23:57,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:57,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639588998] [2024-06-14 14:23:57,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:57,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:11,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639588998] [2024-06-14 14:24:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639588998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:11,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:24:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722759060] [2024-06-14 14:24:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:11,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:24:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:24:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:24:11,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:24:11,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 320 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-14 14:24:11,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:11,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:24:11,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:13,020 INFO L124 PetriNetUnfolderBase]: 1875/2828 cut-off events. [2024-06-14 14:24:13,020 INFO L125 PetriNetUnfolderBase]: For 10983/10998 co-relation queries the response was YES. [2024-06-14 14:24:13,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10175 conditions, 2828 events. 1875/2828 cut-off events. For 10983/10998 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13837 event pairs, 780 based on Foata normal form. 12/2835 useless extension candidates. Maximal degree in co-relation 10151. Up to 2729 conditions per place. [2024-06-14 14:24:13,044 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 54 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2024-06-14 14:24:13,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 498 flow [2024-06-14 14:24:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:24:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:24:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-14 14:24:13,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-06-14 14:24:13,060 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 320 flow. Second operand 6 states and 117 transitions. [2024-06-14 14:24:13,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 498 flow [2024-06-14 14:24:13,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 462 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-14 14:24:13,068 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 324 flow [2024-06-14 14:24:13,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-06-14 14:24:13,069 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2024-06-14 14:24:13,070 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 324 flow [2024-06-14 14:24:13,070 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-14 14:24:13,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:13,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:13,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:24:13,070 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:24:13,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1897588004, now seen corresponding path program 1 times [2024-06-14 14:24:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:13,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259398765] [2024-06-14 14:24:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:13,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:27,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:27,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259398765] [2024-06-14 14:24:27,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259398765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:27,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:27,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:24:27,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941509608] [2024-06-14 14:24:27,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:27,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:24:27,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:27,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:24:27,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:24:27,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:24:27,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 324 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:27,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:27,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:24:27,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:29,186 INFO L124 PetriNetUnfolderBase]: 1944/2932 cut-off events. [2024-06-14 14:24:29,186 INFO L125 PetriNetUnfolderBase]: For 13285/13295 co-relation queries the response was YES. [2024-06-14 14:24:29,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10922 conditions, 2932 events. 1944/2932 cut-off events. For 13285/13295 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14366 event pairs, 778 based on Foata normal form. 10/2938 useless extension candidates. Maximal degree in co-relation 10896. Up to 2780 conditions per place. [2024-06-14 14:24:29,229 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 69 selfloop transitions, 34 changer transitions 0/108 dead transitions. [2024-06-14 14:24:29,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 108 transitions, 781 flow [2024-06-14 14:24:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-14 14:24:29,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:24:29,233 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 324 flow. Second operand 8 states and 160 transitions. [2024-06-14 14:24:29,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 108 transitions, 781 flow [2024-06-14 14:24:29,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 108 transitions, 716 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 14:24:29,245 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 511 flow [2024-06-14 14:24:29,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=511, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2024-06-14 14:24:29,246 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2024-06-14 14:24:29,247 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 511 flow [2024-06-14 14:24:29,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:29,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:29,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:29,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:24:29,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:24:29,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:29,251 INFO L85 PathProgramCache]: Analyzing trace with hash 864458972, now seen corresponding path program 2 times [2024-06-14 14:24:29,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:29,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614631181] [2024-06-14 14:24:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:29,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:43,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:43,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614631181] [2024-06-14 14:24:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614631181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:43,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:43,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:24:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619080789] [2024-06-14 14:24:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:43,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:24:43,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:43,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:24:43,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:24:43,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:24:43,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 511 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:43,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:43,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:24:43,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:45,290 INFO L124 PetriNetUnfolderBase]: 1955/2952 cut-off events. [2024-06-14 14:24:45,290 INFO L125 PetriNetUnfolderBase]: For 16597/16609 co-relation queries the response was YES. [2024-06-14 14:24:45,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11790 conditions, 2952 events. 1955/2952 cut-off events. For 16597/16609 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14465 event pairs, 760 based on Foata normal form. 12/2960 useless extension candidates. Maximal degree in co-relation 11761. Up to 2756 conditions per place. [2024-06-14 14:24:45,304 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 65 selfloop transitions, 41 changer transitions 0/111 dead transitions. [2024-06-14 14:24:45,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 111 transitions, 901 flow [2024-06-14 14:24:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:24:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:24:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-14 14:24:45,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 14:24:45,306 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 511 flow. Second operand 7 states and 143 transitions. [2024-06-14 14:24:45,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 111 transitions, 901 flow [2024-06-14 14:24:45,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 111 transitions, 869 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-14 14:24:45,315 INFO L231 Difference]: Finished difference. Result has 75 places, 85 transitions, 643 flow [2024-06-14 14:24:45,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=643, PETRI_PLACES=75, PETRI_TRANSITIONS=85} [2024-06-14 14:24:45,316 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2024-06-14 14:24:45,316 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 85 transitions, 643 flow [2024-06-14 14:24:45,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:45,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:45,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:45,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:24:45,317 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:24:45,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 864608919, now seen corresponding path program 1 times [2024-06-14 14:24:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:45,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30792007] [2024-06-14 14:24:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:45,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:59,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-14 14:24:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30792007] [2024-06-14 14:24:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30792007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:59,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:59,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:24:59,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078804722] [2024-06-14 14:24:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:59,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:24:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:59,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:24:59,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:24:59,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:24:59,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 85 transitions, 643 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:59,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:59,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:24:59,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:00,812 INFO L124 PetriNetUnfolderBase]: 1977/2988 cut-off events. [2024-06-14 14:25:00,813 INFO L125 PetriNetUnfolderBase]: For 20729/20741 co-relation queries the response was YES. [2024-06-14 14:25:00,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12692 conditions, 2988 events. 1977/2988 cut-off events. For 20729/20741 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14664 event pairs, 706 based on Foata normal form. 11/2995 useless extension candidates. Maximal degree in co-relation 12661. Up to 2784 conditions per place. [2024-06-14 14:25:00,838 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 83 selfloop transitions, 30 changer transitions 0/118 dead transitions. [2024-06-14 14:25:00,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 118 transitions, 1048 flow [2024-06-14 14:25:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:25:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:25:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-14 14:25:00,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-06-14 14:25:00,840 INFO L175 Difference]: Start difference. First operand has 75 places, 85 transitions, 643 flow. Second operand 7 states and 144 transitions. [2024-06-14 14:25:00,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 118 transitions, 1048 flow [2024-06-14 14:25:00,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 118 transitions, 974 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-14 14:25:00,851 INFO L231 Difference]: Finished difference. Result has 78 places, 91 transitions, 708 flow [2024-06-14 14:25:00,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=708, PETRI_PLACES=78, PETRI_TRANSITIONS=91} [2024-06-14 14:25:00,852 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2024-06-14 14:25:00,852 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 91 transitions, 708 flow [2024-06-14 14:25:00,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:00,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:00,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:00,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:25:00,853 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:25:00,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1572881526, now seen corresponding path program 3 times [2024-06-14 14:25:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:00,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374229749] [2024-06-14 14:25:00,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:00,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:15,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:15,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374229749] [2024-06-14 14:25:15,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374229749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:15,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:15,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:25:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085015683] [2024-06-14 14:25:15,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:15,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:25:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:25:15,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:25:15,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:25:15,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 91 transitions, 708 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:15,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:15,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:25:15,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:17,422 INFO L124 PetriNetUnfolderBase]: 1993/3011 cut-off events. [2024-06-14 14:25:17,422 INFO L125 PetriNetUnfolderBase]: For 20235/20244 co-relation queries the response was YES. [2024-06-14 14:25:17,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12762 conditions, 3011 events. 1993/3011 cut-off events. For 20235/20244 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14799 event pairs, 734 based on Foata normal form. 12/3019 useless extension candidates. Maximal degree in co-relation 12730. Up to 2806 conditions per place. [2024-06-14 14:25:17,437 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 79 selfloop transitions, 48 changer transitions 0/132 dead transitions. [2024-06-14 14:25:17,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 132 transitions, 1180 flow [2024-06-14 14:25:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-14 14:25:17,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2024-06-14 14:25:17,440 INFO L175 Difference]: Start difference. First operand has 78 places, 91 transitions, 708 flow. Second operand 9 states and 177 transitions. [2024-06-14 14:25:17,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 132 transitions, 1180 flow [2024-06-14 14:25:17,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 132 transitions, 1141 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-14 14:25:17,455 INFO L231 Difference]: Finished difference. Result has 84 places, 97 transitions, 848 flow [2024-06-14 14:25:17,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=848, PETRI_PLACES=84, PETRI_TRANSITIONS=97} [2024-06-14 14:25:17,457 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2024-06-14 14:25:17,457 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 97 transitions, 848 flow [2024-06-14 14:25:17,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:17,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:17,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:17,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:25:17,458 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-14 14:25:17,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2050518787, now seen corresponding path program 2 times [2024-06-14 14:25:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841729474] [2024-06-14 14:25:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:32,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841729474] [2024-06-14 14:25:32,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841729474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:32,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:32,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:25:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823029616] [2024-06-14 14:25:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:32,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:25:32,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:32,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:25:32,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:25:32,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:25:32,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 97 transitions, 848 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:32,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:32,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:25:32,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:34,354 INFO L124 PetriNetUnfolderBase]: 2015/3043 cut-off events. [2024-06-14 14:25:34,354 INFO L125 PetriNetUnfolderBase]: For 23369/23375 co-relation queries the response was YES. [2024-06-14 14:25:34,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13334 conditions, 3043 events. 2015/3043 cut-off events. For 23369/23375 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14907 event pairs, 692 based on Foata normal form. 10/3050 useless extension candidates. Maximal degree in co-relation 13300. Up to 2826 conditions per place. [2024-06-14 14:25:34,366 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 96 selfloop transitions, 35 changer transitions 0/136 dead transitions. [2024-06-14 14:25:34,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 136 transitions, 1296 flow [2024-06-14 14:25:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-14 14:25:34,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2024-06-14 14:25:34,368 INFO L175 Difference]: Start difference. First operand has 84 places, 97 transitions, 848 flow. Second operand 9 states and 177 transitions. [2024-06-14 14:25:34,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 136 transitions, 1296 flow [2024-06-14 14:25:34,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 136 transitions, 1168 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 14:25:34,382 INFO L231 Difference]: Finished difference. Result has 86 places, 100 transitions, 833 flow [2024-06-14 14:25:34,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=833, PETRI_PLACES=86, PETRI_TRANSITIONS=100} [2024-06-14 14:25:34,383 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2024-06-14 14:25:34,383 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 100 transitions, 833 flow [2024-06-14 14:25:34,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:34,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:34,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:34,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:25:34,384 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:25:34,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:34,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1926241277, now seen corresponding path program 3 times [2024-06-14 14:25:34,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:34,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393914403] [2024-06-14 14:25:34,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:34,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:48,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:48,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393914403] [2024-06-14 14:25:48,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393914403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:25:48,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086807790] [2024-06-14 14:25:48,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:48,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:25:48,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:48,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:25:48,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:25:48,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:25:48,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 100 transitions, 833 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:48,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:48,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:25:48,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:50,243 INFO L124 PetriNetUnfolderBase]: 2005/3030 cut-off events. [2024-06-14 14:25:50,244 INFO L125 PetriNetUnfolderBase]: For 26290/26311 co-relation queries the response was YES. [2024-06-14 14:25:50,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13437 conditions, 3030 events. 2005/3030 cut-off events. For 26290/26311 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14888 event pairs, 697 based on Foata normal form. 18/3041 useless extension candidates. Maximal degree in co-relation 13402. Up to 2818 conditions per place. [2024-06-14 14:25:50,263 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 82 selfloop transitions, 35 changer transitions 0/122 dead transitions. [2024-06-14 14:25:50,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 122 transitions, 1134 flow [2024-06-14 14:25:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:25:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:25:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 14:25:50,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2024-06-14 14:25:50,265 INFO L175 Difference]: Start difference. First operand has 86 places, 100 transitions, 833 flow. Second operand 7 states and 137 transitions. [2024-06-14 14:25:50,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 122 transitions, 1134 flow [2024-06-14 14:25:50,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 122 transitions, 1024 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-14 14:25:50,286 INFO L231 Difference]: Finished difference. Result has 86 places, 100 transitions, 801 flow [2024-06-14 14:25:50,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=801, PETRI_PLACES=86, PETRI_TRANSITIONS=100} [2024-06-14 14:25:50,287 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2024-06-14 14:25:50,288 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 100 transitions, 801 flow [2024-06-14 14:25:50,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:50,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:50,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:50,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:25:50,289 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:25:50,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1925974150, now seen corresponding path program 4 times [2024-06-14 14:25:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:50,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183417431] [2024-06-14 14:25:50,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183417431] [2024-06-14 14:26:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183417431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:04,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:04,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:26:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806722660] [2024-06-14 14:26:04,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:04,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:26:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:26:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:26:04,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:26:04,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 100 transitions, 801 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:04,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:04,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:26:04,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:06,425 INFO L124 PetriNetUnfolderBase]: 1997/3024 cut-off events. [2024-06-14 14:26:06,426 INFO L125 PetriNetUnfolderBase]: For 28911/28932 co-relation queries the response was YES. [2024-06-14 14:26:06,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13530 conditions, 3024 events. 1997/3024 cut-off events. For 28911/28932 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14920 event pairs, 738 based on Foata normal form. 17/3034 useless extension candidates. Maximal degree in co-relation 13494. Up to 2816 conditions per place. [2024-06-14 14:26:06,440 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 78 selfloop transitions, 48 changer transitions 0/131 dead transitions. [2024-06-14 14:26:06,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 131 transitions, 1151 flow [2024-06-14 14:26:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-14 14:26:06,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-14 14:26:06,442 INFO L175 Difference]: Start difference. First operand has 86 places, 100 transitions, 801 flow. Second operand 9 states and 171 transitions. [2024-06-14 14:26:06,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 131 transitions, 1151 flow [2024-06-14 14:26:06,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 131 transitions, 1044 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 14:26:06,466 INFO L231 Difference]: Finished difference. Result has 89 places, 100 transitions, 802 flow [2024-06-14 14:26:06,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=802, PETRI_PLACES=89, PETRI_TRANSITIONS=100} [2024-06-14 14:26:06,467 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2024-06-14 14:26:06,467 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 802 flow [2024-06-14 14:26:06,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:06,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:06,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:06,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:26:06,468 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:26:06,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash -33405023, now seen corresponding path program 1 times [2024-06-14 14:26:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:06,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810645642] [2024-06-14 14:26:06,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:06,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:22,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:22,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810645642] [2024-06-14 14:26:22,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810645642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:22,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:26:22,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322553097] [2024-06-14 14:26:22,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:22,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:26:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:22,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:26:22,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:26:22,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-06-14 14:26:22,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 802 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:22,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:22,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-06-14 14:26:22,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:24,395 INFO L124 PetriNetUnfolderBase]: 1410/2401 cut-off events. [2024-06-14 14:26:24,396 INFO L125 PetriNetUnfolderBase]: For 26202/26216 co-relation queries the response was YES. [2024-06-14 14:26:24,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10658 conditions, 2401 events. 1410/2401 cut-off events. For 26202/26216 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13448 event pairs, 581 based on Foata normal form. 15/2413 useless extension candidates. Maximal degree in co-relation 10621. Up to 2030 conditions per place. [2024-06-14 14:26:24,417 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 66 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2024-06-14 14:26:24,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 111 transitions, 994 flow [2024-06-14 14:26:24,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:26:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:26:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-06-14 14:26:24,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-14 14:26:24,419 INFO L175 Difference]: Start difference. First operand has 89 places, 100 transitions, 802 flow. Second operand 5 states and 110 transitions. [2024-06-14 14:26:24,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 111 transitions, 994 flow [2024-06-14 14:26:24,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 111 transitions, 874 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 14:26:24,443 INFO L231 Difference]: Finished difference. Result has 85 places, 103 transitions, 730 flow [2024-06-14 14:26:24,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=730, PETRI_PLACES=85, PETRI_TRANSITIONS=103} [2024-06-14 14:26:24,444 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2024-06-14 14:26:24,444 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 103 transitions, 730 flow [2024-06-14 14:26:24,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:24,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:24,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:24,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:26:24,445 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:26:24,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1028305867, now seen corresponding path program 1 times [2024-06-14 14:26:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:24,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213282528] [2024-06-14 14:26:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:24,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213282528] [2024-06-14 14:26:41,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213282528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:41,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:41,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:26:41,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817907333] [2024-06-14 14:26:41,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:41,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:26:41,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:41,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:26:41,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:26:41,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:26:41,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 103 transitions, 730 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:41,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:41,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:26:41,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:42,929 INFO L124 PetriNetUnfolderBase]: 2005/3026 cut-off events. [2024-06-14 14:26:42,929 INFO L125 PetriNetUnfolderBase]: For 34590/34594 co-relation queries the response was YES. [2024-06-14 14:26:42,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14174 conditions, 3026 events. 2005/3026 cut-off events. For 34590/34594 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14784 event pairs, 707 based on Foata normal form. 6/3029 useless extension candidates. Maximal degree in co-relation 14137. Up to 2886 conditions per place. [2024-06-14 14:26:42,946 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 111 selfloop transitions, 22 changer transitions 0/138 dead transitions. [2024-06-14 14:26:42,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 138 transitions, 1129 flow [2024-06-14 14:26:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:26:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:26:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-14 14:26:42,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2024-06-14 14:26:42,949 INFO L175 Difference]: Start difference. First operand has 85 places, 103 transitions, 730 flow. Second operand 8 states and 158 transitions. [2024-06-14 14:26:42,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 138 transitions, 1129 flow [2024-06-14 14:26:42,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 138 transitions, 1103 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 14:26:42,970 INFO L231 Difference]: Finished difference. Result has 90 places, 106 transitions, 794 flow [2024-06-14 14:26:42,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=794, PETRI_PLACES=90, PETRI_TRANSITIONS=106} [2024-06-14 14:26:42,970 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places. [2024-06-14 14:26:42,970 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 106 transitions, 794 flow [2024-06-14 14:26:42,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:42,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:42,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:42,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:26:42,971 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:26:42,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1379583355, now seen corresponding path program 1 times [2024-06-14 14:26:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:42,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044818695] [2024-06-14 14:26:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:58,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:58,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044818695] [2024-06-14 14:26:58,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044818695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:58,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:58,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:26:58,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416328378] [2024-06-14 14:26:58,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:58,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:26:58,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:58,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:26:58,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:26:58,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:26:58,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 106 transitions, 794 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:58,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:58,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:26:58,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:00,065 INFO L124 PetriNetUnfolderBase]: 2027/3068 cut-off events. [2024-06-14 14:27:00,066 INFO L125 PetriNetUnfolderBase]: For 39825/39832 co-relation queries the response was YES. [2024-06-14 14:27:00,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14994 conditions, 3068 events. 2027/3068 cut-off events. For 39825/39832 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15103 event pairs, 640 based on Foata normal form. 8/3072 useless extension candidates. Maximal degree in co-relation 14956. Up to 2685 conditions per place. [2024-06-14 14:27:00,081 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 85 selfloop transitions, 56 changer transitions 0/146 dead transitions. [2024-06-14 14:27:00,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 146 transitions, 1300 flow [2024-06-14 14:27:00,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:27:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:27:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-14 14:27:00,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2024-06-14 14:27:00,087 INFO L175 Difference]: Start difference. First operand has 90 places, 106 transitions, 794 flow. Second operand 8 states and 167 transitions. [2024-06-14 14:27:00,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 146 transitions, 1300 flow [2024-06-14 14:27:00,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 146 transitions, 1234 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 14:27:00,119 INFO L231 Difference]: Finished difference. Result has 92 places, 112 transitions, 919 flow [2024-06-14 14:27:00,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=919, PETRI_PLACES=92, PETRI_TRANSITIONS=112} [2024-06-14 14:27:00,120 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2024-06-14 14:27:00,120 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 112 transitions, 919 flow [2024-06-14 14:27:00,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:00,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:00,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:00,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:27:00,121 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:27:00,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1379583169, now seen corresponding path program 2 times [2024-06-14 14:27:00,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:00,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464337885] [2024-06-14 14:27:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:15,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464337885] [2024-06-14 14:27:15,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464337885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:15,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:15,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:27:15,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081392790] [2024-06-14 14:27:15,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:15,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:27:15,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:15,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:27:15,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:27:16,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:27:16,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 112 transitions, 919 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:16,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:16,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:27:16,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:17,588 INFO L124 PetriNetUnfolderBase]: 2038/3088 cut-off events. [2024-06-14 14:27:17,588 INFO L125 PetriNetUnfolderBase]: For 45018/45025 co-relation queries the response was YES. [2024-06-14 14:27:17,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15810 conditions, 3088 events. 2038/3088 cut-off events. For 45018/45025 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15270 event pairs, 696 based on Foata normal form. 8/3092 useless extension candidates. Maximal degree in co-relation 15771. Up to 2808 conditions per place. [2024-06-14 14:27:17,605 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 90 selfloop transitions, 53 changer transitions 0/148 dead transitions. [2024-06-14 14:27:17,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 148 transitions, 1441 flow [2024-06-14 14:27:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:27:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:27:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-14 14:27:17,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2024-06-14 14:27:17,617 INFO L175 Difference]: Start difference. First operand has 92 places, 112 transitions, 919 flow. Second operand 8 states and 162 transitions. [2024-06-14 14:27:17,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 148 transitions, 1441 flow [2024-06-14 14:27:17,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 148 transitions, 1367 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-14 14:27:17,655 INFO L231 Difference]: Finished difference. Result has 96 places, 118 transitions, 1046 flow [2024-06-14 14:27:17,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1046, PETRI_PLACES=96, PETRI_TRANSITIONS=118} [2024-06-14 14:27:17,656 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2024-06-14 14:27:17,656 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 118 transitions, 1046 flow [2024-06-14 14:27:17,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:17,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:17,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:17,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:27:17,657 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:27:17,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:17,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1384231495, now seen corresponding path program 2 times [2024-06-14 14:27:17,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:17,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110203152] [2024-06-14 14:27:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110203152] [2024-06-14 14:27:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110203152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:33,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:33,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:27:33,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777487593] [2024-06-14 14:27:33,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:33,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:27:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:33,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:27:33,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:27:33,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:27:33,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 118 transitions, 1046 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:33,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:33,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:27:33,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:35,327 INFO L124 PetriNetUnfolderBase]: 2092/3166 cut-off events. [2024-06-14 14:27:35,328 INFO L125 PetriNetUnfolderBase]: For 52090/52093 co-relation queries the response was YES. [2024-06-14 14:27:35,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16895 conditions, 3166 events. 2092/3166 cut-off events. For 52090/52093 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15631 event pairs, 642 based on Foata normal form. 4/3166 useless extension candidates. Maximal degree in co-relation 16854. Up to 2747 conditions per place. [2024-06-14 14:27:35,345 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 95 selfloop transitions, 59 changer transitions 0/159 dead transitions. [2024-06-14 14:27:35,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 159 transitions, 1659 flow [2024-06-14 14:27:35,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:27:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:27:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-14 14:27:35,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2024-06-14 14:27:35,348 INFO L175 Difference]: Start difference. First operand has 96 places, 118 transitions, 1046 flow. Second operand 8 states and 167 transitions. [2024-06-14 14:27:35,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 159 transitions, 1659 flow [2024-06-14 14:27:35,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 159 transitions, 1581 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-14 14:27:35,380 INFO L231 Difference]: Finished difference. Result has 100 places, 124 transitions, 1158 flow [2024-06-14 14:27:35,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1158, PETRI_PLACES=100, PETRI_TRANSITIONS=124} [2024-06-14 14:27:35,380 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2024-06-14 14:27:35,380 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 124 transitions, 1158 flow [2024-06-14 14:27:35,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:35,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:35,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:35,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:27:35,381 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:27:35,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1033067653, now seen corresponding path program 3 times [2024-06-14 14:27:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:35,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807553159] [2024-06-14 14:27:35,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:50,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:50,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807553159] [2024-06-14 14:27:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807553159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:27:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861887394] [2024-06-14 14:27:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:50,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:27:50,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:50,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:27:50,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:27:50,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:27:50,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 124 transitions, 1158 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:50,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:50,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:27:50,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:52,210 INFO L124 PetriNetUnfolderBase]: 2082/3152 cut-off events. [2024-06-14 14:27:52,211 INFO L125 PetriNetUnfolderBase]: For 56290/56293 co-relation queries the response was YES. [2024-06-14 14:27:52,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17233 conditions, 3152 events. 2082/3152 cut-off events. For 56290/56293 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15588 event pairs, 647 based on Foata normal form. 4/3152 useless extension candidates. Maximal degree in co-relation 17190. Up to 2739 conditions per place. [2024-06-14 14:27:52,234 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 96 selfloop transitions, 57 changer transitions 0/158 dead transitions. [2024-06-14 14:27:52,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 158 transitions, 1637 flow [2024-06-14 14:27:52,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:27:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:27:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-14 14:27:52,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2024-06-14 14:27:52,238 INFO L175 Difference]: Start difference. First operand has 100 places, 124 transitions, 1158 flow. Second operand 8 states and 167 transitions. [2024-06-14 14:27:52,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 158 transitions, 1637 flow [2024-06-14 14:27:52,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 158 transitions, 1523 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-14 14:27:52,273 INFO L231 Difference]: Finished difference. Result has 104 places, 124 transitions, 1167 flow [2024-06-14 14:27:52,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1167, PETRI_PLACES=104, PETRI_TRANSITIONS=124} [2024-06-14 14:27:52,274 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places. [2024-06-14 14:27:52,274 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 124 transitions, 1167 flow [2024-06-14 14:27:52,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:52,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:52,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:52,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:27:52,275 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:27:52,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:52,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1033067467, now seen corresponding path program 3 times [2024-06-14 14:27:52,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:52,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547758353] [2024-06-14 14:27:52,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:52,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:09,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:09,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547758353] [2024-06-14 14:28:09,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547758353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:09,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:09,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:28:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809283496] [2024-06-14 14:28:09,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:09,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:28:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:09,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:28:09,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:28:09,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:28:09,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 124 transitions, 1167 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:09,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:09,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:28:09,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:10,998 INFO L124 PetriNetUnfolderBase]: 2093/3178 cut-off events. [2024-06-14 14:28:10,999 INFO L125 PetriNetUnfolderBase]: For 61171/61174 co-relation queries the response was YES. [2024-06-14 14:28:11,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17573 conditions, 3178 events. 2093/3178 cut-off events. For 61171/61174 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15791 event pairs, 703 based on Foata normal form. 4/3178 useless extension candidates. Maximal degree in co-relation 17529. Up to 2884 conditions per place. [2024-06-14 14:28:11,017 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 98 selfloop transitions, 53 changer transitions 0/156 dead transitions. [2024-06-14 14:28:11,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 156 transitions, 1676 flow [2024-06-14 14:28:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:28:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:28:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-14 14:28:11,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:28:11,021 INFO L175 Difference]: Start difference. First operand has 104 places, 124 transitions, 1167 flow. Second operand 8 states and 160 transitions. [2024-06-14 14:28:11,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 156 transitions, 1676 flow [2024-06-14 14:28:11,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 156 transitions, 1552 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-14 14:28:11,055 INFO L231 Difference]: Finished difference. Result has 105 places, 127 transitions, 1198 flow [2024-06-14 14:28:11,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1198, PETRI_PLACES=105, PETRI_TRANSITIONS=127} [2024-06-14 14:28:11,056 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 60 predicate places. [2024-06-14 14:28:11,056 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 127 transitions, 1198 flow [2024-06-14 14:28:11,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:11,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:11,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:11,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:28:11,057 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:28:11,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:11,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1289251221, now seen corresponding path program 4 times [2024-06-14 14:28:11,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:11,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567297346] [2024-06-14 14:28:11,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:11,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:25,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567297346] [2024-06-14 14:28:25,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567297346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:25,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:25,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:28:25,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824492008] [2024-06-14 14:28:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:25,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:28:25,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:25,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:28:25,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:28:25,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:28:25,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 127 transitions, 1198 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:25,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:25,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:28:25,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:27,279 INFO L124 PetriNetUnfolderBase]: 2147/3259 cut-off events. [2024-06-14 14:28:27,279 INFO L125 PetriNetUnfolderBase]: For 68193/68198 co-relation queries the response was YES. [2024-06-14 14:28:27,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18179 conditions, 3259 events. 2147/3259 cut-off events. For 68193/68198 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16207 event pairs, 647 based on Foata normal form. 6/3255 useless extension candidates. Maximal degree in co-relation 18134. Up to 2801 conditions per place. [2024-06-14 14:28:27,298 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 98 selfloop transitions, 63 changer transitions 0/166 dead transitions. [2024-06-14 14:28:27,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 166 transitions, 1850 flow [2024-06-14 14:28:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:28:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:28:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-14 14:28:27,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-14 14:28:27,301 INFO L175 Difference]: Start difference. First operand has 105 places, 127 transitions, 1198 flow. Second operand 8 states and 165 transitions. [2024-06-14 14:28:27,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 166 transitions, 1850 flow [2024-06-14 14:28:27,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 166 transitions, 1744 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-14 14:28:27,335 INFO L231 Difference]: Finished difference. Result has 108 places, 133 transitions, 1296 flow [2024-06-14 14:28:27,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1296, PETRI_PLACES=108, PETRI_TRANSITIONS=133} [2024-06-14 14:28:27,336 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 63 predicate places. [2024-06-14 14:28:27,336 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 133 transitions, 1296 flow [2024-06-14 14:28:27,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:27,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:27,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:27,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:28:27,337 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-14 14:28:27,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:27,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1150610299, now seen corresponding path program 5 times [2024-06-14 14:28:27,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:27,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223904300] [2024-06-14 14:28:27,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:27,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:42,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:42,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223904300] [2024-06-14 14:28:42,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223904300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:42,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:42,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:28:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319014210] [2024-06-14 14:28:42,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:42,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:28:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:28:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:28:42,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:28:42,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 133 transitions, 1296 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:42,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:42,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:28:42,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:44,426 INFO L124 PetriNetUnfolderBase]: 2137/3245 cut-off events. [2024-06-14 14:28:44,426 INFO L125 PetriNetUnfolderBase]: For 73360/73365 co-relation queries the response was YES. [2024-06-14 14:28:44,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18394 conditions, 3245 events. 2137/3245 cut-off events. For 73360/73365 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16108 event pairs, 643 based on Foata normal form. 6/3241 useless extension candidates. Maximal degree in co-relation 18348. Up to 2793 conditions per place. [2024-06-14 14:28:44,445 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 95 selfloop transitions, 64 changer transitions 0/164 dead transitions. [2024-06-14 14:28:44,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 164 transitions, 1792 flow [2024-06-14 14:28:44,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:28:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:28:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-14 14:28:44,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2024-06-14 14:28:44,448 INFO L175 Difference]: Start difference. First operand has 108 places, 133 transitions, 1296 flow. Second operand 8 states and 162 transitions. [2024-06-14 14:28:44,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 164 transitions, 1792 flow [2024-06-14 14:28:44,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 164 transitions, 1626 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-14 14:28:44,492 INFO L231 Difference]: Finished difference. Result has 111 places, 133 transitions, 1267 flow [2024-06-14 14:28:44,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1267, PETRI_PLACES=111, PETRI_TRANSITIONS=133} [2024-06-14 14:28:44,493 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 66 predicate places. [2024-06-14 14:28:44,493 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 133 transitions, 1267 flow [2024-06-14 14:28:44,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:44,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:44,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:44,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:28:44,494 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:28:44,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1150610485, now seen corresponding path program 4 times [2024-06-14 14:28:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:44,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543577243] [2024-06-14 14:28:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:00,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:00,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543577243] [2024-06-14 14:29:00,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543577243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:00,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:00,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:29:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850146560] [2024-06-14 14:29:00,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:00,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:29:00,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:00,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:29:00,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:29:00,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:29:00,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 133 transitions, 1267 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:00,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:00,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:29:00,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:02,277 INFO L124 PetriNetUnfolderBase]: 2132/3239 cut-off events. [2024-06-14 14:29:02,277 INFO L125 PetriNetUnfolderBase]: For 77298/77298 co-relation queries the response was YES. [2024-06-14 14:29:02,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18527 conditions, 3239 events. 2132/3239 cut-off events. For 77298/77298 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16079 event pairs, 702 based on Foata normal form. 2/3238 useless extension candidates. Maximal degree in co-relation 18480. Up to 2943 conditions per place. [2024-06-14 14:29:02,299 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 109 selfloop transitions, 54 changer transitions 0/168 dead transitions. [2024-06-14 14:29:02,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 168 transitions, 1703 flow [2024-06-14 14:29:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:29:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:29:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-14 14:29:02,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-14 14:29:02,303 INFO L175 Difference]: Start difference. First operand has 111 places, 133 transitions, 1267 flow. Second operand 10 states and 190 transitions. [2024-06-14 14:29:02,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 168 transitions, 1703 flow [2024-06-14 14:29:02,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 168 transitions, 1530 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 14:29:02,365 INFO L231 Difference]: Finished difference. Result has 114 places, 133 transitions, 1211 flow [2024-06-14 14:29:02,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1211, PETRI_PLACES=114, PETRI_TRANSITIONS=133} [2024-06-14 14:29:02,366 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 69 predicate places. [2024-06-14 14:29:02,366 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 133 transitions, 1211 flow [2024-06-14 14:29:02,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:02,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:02,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:02,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:29:02,367 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:29:02,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1556952025, now seen corresponding path program 6 times [2024-06-14 14:29:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:02,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159260076] [2024-06-14 14:29:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:17,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:17,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159260076] [2024-06-14 14:29:17,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159260076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:17,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:17,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:29:17,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819944419] [2024-06-14 14:29:17,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:17,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:29:17,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:17,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:29:17,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:29:17,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:29:17,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 133 transitions, 1211 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:17,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:17,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:29:17,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:19,354 INFO L124 PetriNetUnfolderBase]: 2122/3223 cut-off events. [2024-06-14 14:29:19,354 INFO L125 PetriNetUnfolderBase]: For 82402/82402 co-relation queries the response was YES. [2024-06-14 14:29:19,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18468 conditions, 3223 events. 2122/3223 cut-off events. For 82402/82402 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16001 event pairs, 638 based on Foata normal form. 4/3224 useless extension candidates. Maximal degree in co-relation 18420. Up to 2778 conditions per place. [2024-06-14 14:29:19,375 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 100 selfloop transitions, 71 changer transitions 0/176 dead transitions. [2024-06-14 14:29:19,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 176 transitions, 1682 flow [2024-06-14 14:29:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:29:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:29:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-14 14:29:19,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43388429752066116 [2024-06-14 14:29:19,380 INFO L175 Difference]: Start difference. First operand has 114 places, 133 transitions, 1211 flow. Second operand 11 states and 210 transitions. [2024-06-14 14:29:19,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 176 transitions, 1682 flow [2024-06-14 14:29:19,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 176 transitions, 1503 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-14 14:29:19,432 INFO L231 Difference]: Finished difference. Result has 115 places, 133 transitions, 1182 flow [2024-06-14 14:29:19,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1182, PETRI_PLACES=115, PETRI_TRANSITIONS=133} [2024-06-14 14:29:19,433 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places. [2024-06-14 14:29:19,434 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 133 transitions, 1182 flow [2024-06-14 14:29:19,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:19,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:19,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:19,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:29:19,434 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:29:19,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -415753277, now seen corresponding path program 1 times [2024-06-14 14:29:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:19,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487624090] [2024-06-14 14:29:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487624090] [2024-06-14 14:29:33,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487624090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:33,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:29:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690500620] [2024-06-14 14:29:33,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:33,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:29:33,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:33,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:29:33,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:29:33,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:29:33,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 133 transitions, 1182 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:33,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:33,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:29:33,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:35,123 INFO L124 PetriNetUnfolderBase]: 1730/2786 cut-off events. [2024-06-14 14:29:35,123 INFO L125 PetriNetUnfolderBase]: For 75565/75584 co-relation queries the response was YES. [2024-06-14 14:29:35,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15915 conditions, 2786 events. 1730/2786 cut-off events. For 75565/75584 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 14805 event pairs, 544 based on Foata normal form. 23/2785 useless extension candidates. Maximal degree in co-relation 15866. Up to 2489 conditions per place. [2024-06-14 14:29:35,141 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 130 selfloop transitions, 16 changer transitions 0/162 dead transitions. [2024-06-14 14:29:35,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 162 transitions, 1601 flow [2024-06-14 14:29:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:29:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:29:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-14 14:29:35,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630681818181818 [2024-06-14 14:29:35,144 INFO L175 Difference]: Start difference. First operand has 115 places, 133 transitions, 1182 flow. Second operand 8 states and 163 transitions. [2024-06-14 14:29:35,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 162 transitions, 1601 flow [2024-06-14 14:29:35,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 162 transitions, 1421 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 14:29:35,185 INFO L231 Difference]: Finished difference. Result has 113 places, 138 transitions, 1106 flow [2024-06-14 14:29:35,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1106, PETRI_PLACES=113, PETRI_TRANSITIONS=138} [2024-06-14 14:29:35,186 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 68 predicate places. [2024-06-14 14:29:35,186 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 138 transitions, 1106 flow [2024-06-14 14:29:35,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:35,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:35,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:35,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:29:35,187 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-14 14:29:35,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1035554129, now seen corresponding path program 1 times [2024-06-14 14:29:35,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:35,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481572761] [2024-06-14 14:29:35,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:52,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:52,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481572761] [2024-06-14 14:29:52,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481572761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:52,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:52,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:29:52,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582815996] [2024-06-14 14:29:52,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:52,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:29:52,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:52,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:29:52,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:29:52,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-06-14 14:29:52,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 138 transitions, 1106 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:52,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:52,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-06-14 14:29:52,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:53,875 INFO L124 PetriNetUnfolderBase]: 1469/2523 cut-off events. [2024-06-14 14:29:53,876 INFO L125 PetriNetUnfolderBase]: For 78146/78162 co-relation queries the response was YES. [2024-06-14 14:29:53,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14656 conditions, 2523 events. 1469/2523 cut-off events. For 78146/78162 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 14356 event pairs, 528 based on Foata normal form. 18/2536 useless extension candidates. Maximal degree in co-relation 14605. Up to 2078 conditions per place. [2024-06-14 14:29:53,895 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 93 selfloop transitions, 11 changer transitions 0/151 dead transitions. [2024-06-14 14:29:53,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 151 transitions, 1368 flow [2024-06-14 14:29:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:29:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:29:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-06-14 14:29:53,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2024-06-14 14:29:53,896 INFO L175 Difference]: Start difference. First operand has 113 places, 138 transitions, 1106 flow. Second operand 6 states and 129 transitions. [2024-06-14 14:29:53,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 151 transitions, 1368 flow [2024-06-14 14:29:53,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 151 transitions, 1309 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 14:29:53,949 INFO L231 Difference]: Finished difference. Result has 114 places, 141 transitions, 1107 flow [2024-06-14 14:29:53,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1107, PETRI_PLACES=114, PETRI_TRANSITIONS=141} [2024-06-14 14:29:53,954 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 69 predicate places. [2024-06-14 14:29:53,954 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 141 transitions, 1107 flow [2024-06-14 14:29:53,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:53,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:53,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:53,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:29:53,954 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:29:53,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1812712472, now seen corresponding path program 1 times [2024-06-14 14:29:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:53,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375299994] [2024-06-14 14:29:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:53,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:10,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375299994] [2024-06-14 14:30:10,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375299994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:10,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:10,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:30:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944068265] [2024-06-14 14:30:10,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:10,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:30:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:10,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:30:10,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:30:10,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:30:10,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 141 transitions, 1107 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:10,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:10,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:30:10,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:12,699 INFO L124 PetriNetUnfolderBase]: 2127/3242 cut-off events. [2024-06-14 14:30:12,699 INFO L125 PetriNetUnfolderBase]: For 98921/98925 co-relation queries the response was YES. [2024-06-14 14:30:12,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19410 conditions, 3242 events. 2127/3242 cut-off events. For 98921/98925 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16167 event pairs, 656 based on Foata normal form. 8/3247 useless extension candidates. Maximal degree in co-relation 19358. Up to 3047 conditions per place. [2024-06-14 14:30:12,719 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 151 selfloop transitions, 25 changer transitions 0/181 dead transitions. [2024-06-14 14:30:12,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 181 transitions, 1620 flow [2024-06-14 14:30:12,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:30:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:30:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-14 14:30:12,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 14:30:12,723 INFO L175 Difference]: Start difference. First operand has 114 places, 141 transitions, 1107 flow. Second operand 9 states and 176 transitions. [2024-06-14 14:30:12,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 181 transitions, 1620 flow [2024-06-14 14:30:12,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 181 transitions, 1582 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-14 14:30:12,775 INFO L231 Difference]: Finished difference. Result has 119 places, 144 transitions, 1177 flow [2024-06-14 14:30:12,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1177, PETRI_PLACES=119, PETRI_TRANSITIONS=144} [2024-06-14 14:30:12,776 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 74 predicate places. [2024-06-14 14:30:12,776 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 144 transitions, 1177 flow [2024-06-14 14:30:12,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:12,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:12,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:12,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:30:12,777 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:30:12,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:12,777 INFO L85 PathProgramCache]: Analyzing trace with hash -182593054, now seen corresponding path program 2 times [2024-06-14 14:30:12,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425719097] [2024-06-14 14:30:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:29,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:29,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425719097] [2024-06-14 14:30:29,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425719097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:29,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:29,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:30:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369349673] [2024-06-14 14:30:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:29,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:30:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:29,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:30:29,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:30:29,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:30:29,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 144 transitions, 1177 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:29,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:29,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:30:29,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:31,137 INFO L124 PetriNetUnfolderBase]: 2181/3332 cut-off events. [2024-06-14 14:30:31,138 INFO L125 PetriNetUnfolderBase]: For 108673/108680 co-relation queries the response was YES. [2024-06-14 14:30:31,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20605 conditions, 3332 events. 2181/3332 cut-off events. For 108673/108680 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16831 event pairs, 591 based on Foata normal form. 8/3336 useless extension candidates. Maximal degree in co-relation 20552. Up to 2650 conditions per place. [2024-06-14 14:30:31,160 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 108 selfloop transitions, 81 changer transitions 0/194 dead transitions. [2024-06-14 14:30:31,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 194 transitions, 2047 flow [2024-06-14 14:30:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:30:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:30:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-06-14 14:30:31,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-14 14:30:31,169 INFO L175 Difference]: Start difference. First operand has 119 places, 144 transitions, 1177 flow. Second operand 9 states and 192 transitions. [2024-06-14 14:30:31,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 194 transitions, 2047 flow [2024-06-14 14:30:31,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 194 transitions, 1963 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-14 14:30:31,226 INFO L231 Difference]: Finished difference. Result has 121 places, 153 transitions, 1419 flow [2024-06-14 14:30:31,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1419, PETRI_PLACES=121, PETRI_TRANSITIONS=153} [2024-06-14 14:30:31,227 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 76 predicate places. [2024-06-14 14:30:31,227 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 153 transitions, 1419 flow [2024-06-14 14:30:31,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:31,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:31,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:31,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:30:31,228 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:30:31,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash -182587474, now seen corresponding path program 3 times [2024-06-14 14:30:31,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:31,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127755826] [2024-06-14 14:30:31,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:31,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:48,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:48,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127755826] [2024-06-14 14:30:48,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127755826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:48,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:48,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:30:48,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430419511] [2024-06-14 14:30:48,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:48,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:30:48,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:48,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:30:48,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:30:48,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:30:48,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 153 transitions, 1419 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:48,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:48,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:30:48,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:49,834 INFO L124 PetriNetUnfolderBase]: 2171/3318 cut-off events. [2024-06-14 14:30:49,835 INFO L125 PetriNetUnfolderBase]: For 116171/116178 co-relation queries the response was YES. [2024-06-14 14:30:49,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21135 conditions, 3318 events. 2171/3318 cut-off events. For 116171/116178 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16771 event pairs, 589 based on Foata normal form. 8/3322 useless extension candidates. Maximal degree in co-relation 21081. Up to 2642 conditions per place. [2024-06-14 14:30:49,855 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 104 selfloop transitions, 82 changer transitions 0/191 dead transitions. [2024-06-14 14:30:49,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 191 transitions, 2021 flow [2024-06-14 14:30:49,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:30:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:30:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2024-06-14 14:30:49,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2024-06-14 14:30:49,857 INFO L175 Difference]: Start difference. First operand has 121 places, 153 transitions, 1419 flow. Second operand 9 states and 188 transitions. [2024-06-14 14:30:49,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 191 transitions, 2021 flow [2024-06-14 14:30:49,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 191 transitions, 1879 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-14 14:30:49,956 INFO L231 Difference]: Finished difference. Result has 126 places, 153 transitions, 1449 flow [2024-06-14 14:30:49,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1449, PETRI_PLACES=126, PETRI_TRANSITIONS=153} [2024-06-14 14:30:49,956 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 81 predicate places. [2024-06-14 14:30:49,956 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 153 transitions, 1449 flow [2024-06-14 14:30:49,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:49,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:49,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:49,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:30:49,957 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:30:49,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:49,958 INFO L85 PathProgramCache]: Analyzing trace with hash -38495134, now seen corresponding path program 4 times [2024-06-14 14:30:49,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:49,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916911749] [2024-06-14 14:30:49,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:06,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:06,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916911749] [2024-06-14 14:31:06,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916911749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:06,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:06,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:31:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748726405] [2024-06-14 14:31:06,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:06,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:31:06,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:06,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:31:06,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:31:07,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:31:07,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 153 transitions, 1449 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:07,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:07,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:31:07,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:09,076 INFO L124 PetriNetUnfolderBase]: 2225/3410 cut-off events. [2024-06-14 14:31:09,077 INFO L125 PetriNetUnfolderBase]: For 125555/125562 co-relation queries the response was YES. [2024-06-14 14:31:09,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22157 conditions, 3410 events. 2225/3410 cut-off events. For 125555/125562 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 17348 event pairs, 592 based on Foata normal form. 8/3414 useless extension candidates. Maximal degree in co-relation 22101. Up to 2688 conditions per place. [2024-06-14 14:31:09,108 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 115 selfloop transitions, 94 changer transitions 0/214 dead transitions. [2024-06-14 14:31:09,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 214 transitions, 2382 flow [2024-06-14 14:31:09,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:31:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:31:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 243 transitions. [2024-06-14 14:31:09,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2024-06-14 14:31:09,120 INFO L175 Difference]: Start difference. First operand has 126 places, 153 transitions, 1449 flow. Second operand 12 states and 243 transitions. [2024-06-14 14:31:09,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 214 transitions, 2382 flow [2024-06-14 14:31:09,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 214 transitions, 2197 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 14:31:09,213 INFO L231 Difference]: Finished difference. Result has 130 places, 159 transitions, 1572 flow [2024-06-14 14:31:09,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1572, PETRI_PLACES=130, PETRI_TRANSITIONS=159} [2024-06-14 14:31:09,214 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 85 predicate places. [2024-06-14 14:31:09,214 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 159 transitions, 1572 flow [2024-06-14 14:31:09,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:09,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:09,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:09,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:31:09,215 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-14 14:31:09,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash 289389284, now seen corresponding path program 5 times [2024-06-14 14:31:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070746304] [2024-06-14 14:31:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:23,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:23,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070746304] [2024-06-14 14:31:23,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070746304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:23,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:23,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:31:23,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107137614] [2024-06-14 14:31:23,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:23,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:31:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:23,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:31:23,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:31:24,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:31:24,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 159 transitions, 1572 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:24,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:24,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:31:24,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:25,784 INFO L124 PetriNetUnfolderBase]: 2247/3458 cut-off events. [2024-06-14 14:31:25,784 INFO L125 PetriNetUnfolderBase]: For 133692/133695 co-relation queries the response was YES. [2024-06-14 14:31:25,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22672 conditions, 3458 events. 2247/3458 cut-off events. For 133692/133695 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17758 event pairs, 608 based on Foata normal form. 4/3458 useless extension candidates. Maximal degree in co-relation 22615. Up to 2707 conditions per place. [2024-06-14 14:31:25,806 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 111 selfloop transitions, 86 changer transitions 0/202 dead transitions. [2024-06-14 14:31:25,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 202 transitions, 2387 flow [2024-06-14 14:31:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:31:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:31:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-14 14:31:25,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797979797979798 [2024-06-14 14:31:25,809 INFO L175 Difference]: Start difference. First operand has 130 places, 159 transitions, 1572 flow. Second operand 9 states and 190 transitions. [2024-06-14 14:31:25,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 202 transitions, 2387 flow [2024-06-14 14:31:25,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 202 transitions, 2199 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-14 14:31:25,911 INFO L231 Difference]: Finished difference. Result has 131 places, 162 transitions, 1620 flow [2024-06-14 14:31:25,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1620, PETRI_PLACES=131, PETRI_TRANSITIONS=162} [2024-06-14 14:31:25,912 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 86 predicate places. [2024-06-14 14:31:25,912 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 162 transitions, 1620 flow [2024-06-14 14:31:25,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:25,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:25,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:25,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:31:25,913 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-14 14:31:25,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1255305674, now seen corresponding path program 6 times [2024-06-14 14:31:25,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:25,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312138389] [2024-06-14 14:31:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:25,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:42,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312138389] [2024-06-14 14:31:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312138389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:31:42,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054313263] [2024-06-14 14:31:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:42,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:31:42,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:42,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:31:42,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:31:42,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:31:42,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 162 transitions, 1620 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:42,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:42,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:31:42,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:44,670 INFO L124 PetriNetUnfolderBase]: 2237/3443 cut-off events. [2024-06-14 14:31:44,670 INFO L125 PetriNetUnfolderBase]: For 139561/139568 co-relation queries the response was YES. [2024-06-14 14:31:44,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22613 conditions, 3443 events. 2237/3443 cut-off events. For 139561/139568 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 17638 event pairs, 597 based on Foata normal form. 8/3447 useless extension candidates. Maximal degree in co-relation 22555. Up to 2699 conditions per place. [2024-06-14 14:31:44,692 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 116 selfloop transitions, 91 changer transitions 0/212 dead transitions. [2024-06-14 14:31:44,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 212 transitions, 2317 flow [2024-06-14 14:31:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:31:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:31:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 229 transitions. [2024-06-14 14:31:44,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731404958677686 [2024-06-14 14:31:44,700 INFO L175 Difference]: Start difference. First operand has 131 places, 162 transitions, 1620 flow. Second operand 11 states and 229 transitions. [2024-06-14 14:31:44,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 212 transitions, 2317 flow [2024-06-14 14:31:44,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 212 transitions, 2052 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-14 14:31:44,797 INFO L231 Difference]: Finished difference. Result has 135 places, 162 transitions, 1545 flow [2024-06-14 14:31:44,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1545, PETRI_PLACES=135, PETRI_TRANSITIONS=162} [2024-06-14 14:31:44,798 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 90 predicate places. [2024-06-14 14:31:44,798 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 162 transitions, 1545 flow [2024-06-14 14:31:44,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:44,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:44,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:44,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:31:44,799 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:31:44,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2050753664, now seen corresponding path program 1 times [2024-06-14 14:31:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:44,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042482586] [2024-06-14 14:31:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:44,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:00,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:00,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042482586] [2024-06-14 14:32:00,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042482586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:00,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:00,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:32:00,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899925050] [2024-06-14 14:32:00,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:00,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:32:00,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:00,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:32:00,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:32:00,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:32:00,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 162 transitions, 1545 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:00,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:00,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:32:00,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:02,174 INFO L124 PetriNetUnfolderBase]: 1950/3127 cut-off events. [2024-06-14 14:32:02,174 INFO L125 PetriNetUnfolderBase]: For 144858/144862 co-relation queries the response was YES. [2024-06-14 14:32:02,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21290 conditions, 3127 events. 1950/3127 cut-off events. For 144858/144862 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16862 event pairs, 605 based on Foata normal form. 5/3099 useless extension candidates. Maximal degree in co-relation 21231. Up to 2762 conditions per place. [2024-06-14 14:32:02,198 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 131 selfloop transitions, 13 changer transitions 0/180 dead transitions. [2024-06-14 14:32:02,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 180 transitions, 1906 flow [2024-06-14 14:32:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:32:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:32:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-06-14 14:32:02,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-14 14:32:02,199 INFO L175 Difference]: Start difference. First operand has 135 places, 162 transitions, 1545 flow. Second operand 6 states and 124 transitions. [2024-06-14 14:32:02,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 180 transitions, 1906 flow [2024-06-14 14:32:02,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 180 transitions, 1689 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-14 14:32:02,311 INFO L231 Difference]: Finished difference. Result has 130 places, 165 transitions, 1393 flow [2024-06-14 14:32:02,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1393, PETRI_PLACES=130, PETRI_TRANSITIONS=165} [2024-06-14 14:32:02,311 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 85 predicate places. [2024-06-14 14:32:02,312 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 165 transitions, 1393 flow [2024-06-14 14:32:02,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:02,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:02,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:02,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:32:02,312 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:32:02,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1309179420, now seen corresponding path program 7 times [2024-06-14 14:32:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:02,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003804752] [2024-06-14 14:32:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:18,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003804752] [2024-06-14 14:32:18,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003804752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:18,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:18,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:32:18,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882703397] [2024-06-14 14:32:18,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:18,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:32:18,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:18,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:32:18,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:32:18,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:32:18,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 165 transitions, 1393 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:18,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:18,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:32:18,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:20,157 INFO L124 PetriNetUnfolderBase]: 2296/3544 cut-off events. [2024-06-14 14:32:20,157 INFO L125 PetriNetUnfolderBase]: For 155846/155861 co-relation queries the response was YES. [2024-06-14 14:32:20,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23492 conditions, 3544 events. 2296/3544 cut-off events. For 155846/155861 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 18338 event pairs, 589 based on Foata normal form. 14/3551 useless extension candidates. Maximal degree in co-relation 23432. Up to 2752 conditions per place. [2024-06-14 14:32:20,184 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 119 selfloop transitions, 97 changer transitions 0/221 dead transitions. [2024-06-14 14:32:20,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 221 transitions, 2343 flow [2024-06-14 14:32:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:32:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:32:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 223 transitions. [2024-06-14 14:32:20,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607438016528926 [2024-06-14 14:32:20,194 INFO L175 Difference]: Start difference. First operand has 130 places, 165 transitions, 1393 flow. Second operand 11 states and 223 transitions. [2024-06-14 14:32:20,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 221 transitions, 2343 flow [2024-06-14 14:32:20,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 221 transitions, 2302 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-14 14:32:20,288 INFO L231 Difference]: Finished difference. Result has 137 places, 171 transitions, 1654 flow [2024-06-14 14:32:20,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1654, PETRI_PLACES=137, PETRI_TRANSITIONS=171} [2024-06-14 14:32:20,289 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 92 predicate places. [2024-06-14 14:32:20,289 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 171 transitions, 1654 flow [2024-06-14 14:32:20,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:20,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:20,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:20,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:32:20,290 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:32:20,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1309185000, now seen corresponding path program 8 times [2024-06-14 14:32:20,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:20,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561674120] [2024-06-14 14:32:20,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:20,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:37,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-14 14:32:37,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561674120] [2024-06-14 14:32:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561674120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:37,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:37,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:32:37,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133957619] [2024-06-14 14:32:37,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:37,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:32:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:37,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:32:37,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:32:37,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:32:37,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 171 transitions, 1654 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:37,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:37,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:32:37,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:39,628 INFO L124 PetriNetUnfolderBase]: 2286/3534 cut-off events. [2024-06-14 14:32:39,628 INFO L125 PetriNetUnfolderBase]: For 163010/163010 co-relation queries the response was YES. [2024-06-14 14:32:39,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23954 conditions, 3534 events. 2286/3534 cut-off events. For 163010/163010 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 18335 event pairs, 596 based on Foata normal form. 4/3535 useless extension candidates. Maximal degree in co-relation 23893. Up to 2744 conditions per place. [2024-06-14 14:32:39,653 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 118 selfloop transitions, 95 changer transitions 0/218 dead transitions. [2024-06-14 14:32:39,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 218 transitions, 2364 flow [2024-06-14 14:32:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:32:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:32:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-14 14:32:39,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:32:39,657 INFO L175 Difference]: Start difference. First operand has 137 places, 171 transitions, 1654 flow. Second operand 11 states and 220 transitions. [2024-06-14 14:32:39,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 218 transitions, 2364 flow [2024-06-14 14:32:39,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 218 transitions, 2097 flow, removed 36 selfloop flow, removed 8 redundant places. [2024-06-14 14:32:39,774 INFO L231 Difference]: Finished difference. Result has 140 places, 171 transitions, 1585 flow [2024-06-14 14:32:39,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1585, PETRI_PLACES=140, PETRI_TRANSITIONS=171} [2024-06-14 14:32:39,775 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 95 predicate places. [2024-06-14 14:32:39,775 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 171 transitions, 1585 flow [2024-06-14 14:32:39,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:39,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:39,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:39,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:32:39,776 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:32:39,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1308977610, now seen corresponding path program 9 times [2024-06-14 14:32:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:39,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789047810] [2024-06-14 14:32:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:55,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:55,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789047810] [2024-06-14 14:32:55,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789047810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:55,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:55,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:32:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140982013] [2024-06-14 14:32:55,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:55,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:32:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:32:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:32:56,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:32:56,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 171 transitions, 1585 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:56,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:56,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:32:56,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:57,991 INFO L124 PetriNetUnfolderBase]: 2308/3567 cut-off events. [2024-06-14 14:32:57,991 INFO L125 PetriNetUnfolderBase]: For 171062/171077 co-relation queries the response was YES. [2024-06-14 14:32:58,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24245 conditions, 3567 events. 2308/3567 cut-off events. For 171062/171077 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 18451 event pairs, 592 based on Foata normal form. 14/3574 useless extension candidates. Maximal degree in co-relation 24183. Up to 2763 conditions per place. [2024-06-14 14:32:58,019 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 125 selfloop transitions, 102 changer transitions 0/232 dead transitions. [2024-06-14 14:32:58,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 232 transitions, 2419 flow [2024-06-14 14:32:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 14:32:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 14:32:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 257 transitions. [2024-06-14 14:32:58,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4493006993006993 [2024-06-14 14:32:58,023 INFO L175 Difference]: Start difference. First operand has 140 places, 171 transitions, 1585 flow. Second operand 13 states and 257 transitions. [2024-06-14 14:32:58,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 232 transitions, 2419 flow [2024-06-14 14:32:58,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 232 transitions, 2219 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 14:32:58,136 INFO L231 Difference]: Finished difference. Result has 144 places, 174 transitions, 1653 flow [2024-06-14 14:32:58,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1653, PETRI_PLACES=144, PETRI_TRANSITIONS=174} [2024-06-14 14:32:58,137 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 99 predicate places. [2024-06-14 14:32:58,137 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 174 transitions, 1653 flow [2024-06-14 14:32:58,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:58,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:58,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:58,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:32:58,138 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-14 14:32:58,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1020874000, now seen corresponding path program 10 times [2024-06-14 14:32:58,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:58,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678791983] [2024-06-14 14:32:58,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:14,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678791983] [2024-06-14 14:33:14,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678791983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:14,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:14,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:33:14,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45062581] [2024-06-14 14:33:14,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:14,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:33:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:14,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:33:14,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:33:14,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:33:14,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 174 transitions, 1653 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:14,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:14,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:33:14,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:16,339 INFO L124 PetriNetUnfolderBase]: 2298/3558 cut-off events. [2024-06-14 14:33:16,339 INFO L125 PetriNetUnfolderBase]: For 177640/177655 co-relation queries the response was YES. [2024-06-14 14:33:16,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24293 conditions, 3558 events. 2298/3558 cut-off events. For 177640/177655 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18453 event pairs, 592 based on Foata normal form. 14/3565 useless extension candidates. Maximal degree in co-relation 24230. Up to 2755 conditions per place. [2024-06-14 14:33:16,366 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 106 selfloop transitions, 111 changer transitions 0/222 dead transitions. [2024-06-14 14:33:16,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 222 transitions, 2240 flow [2024-06-14 14:33:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:33:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:33:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 231 transitions. [2024-06-14 14:33:16,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 14:33:16,370 INFO L175 Difference]: Start difference. First operand has 144 places, 174 transitions, 1653 flow. Second operand 12 states and 231 transitions. [2024-06-14 14:33:16,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 222 transitions, 2240 flow [2024-06-14 14:33:16,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 222 transitions, 1974 flow, removed 30 selfloop flow, removed 11 redundant places. [2024-06-14 14:33:16,488 INFO L231 Difference]: Finished difference. Result has 145 places, 174 transitions, 1617 flow [2024-06-14 14:33:16,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1617, PETRI_PLACES=145, PETRI_TRANSITIONS=174} [2024-06-14 14:33:16,490 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 100 predicate places. [2024-06-14 14:33:16,490 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 174 transitions, 1617 flow [2024-06-14 14:33:16,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:16,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:16,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:16,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:33:16,490 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:33:16,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2037421184, now seen corresponding path program 2 times [2024-06-14 14:33:16,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:16,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853984390] [2024-06-14 14:33:16,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:32,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:32,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853984390] [2024-06-14 14:33:32,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853984390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:32,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:32,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:33:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355859627] [2024-06-14 14:33:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:32,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:33:32,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:33:32,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:33:32,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:33:32,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 174 transitions, 1617 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:32,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:32,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:33:32,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:33,975 INFO L124 PetriNetUnfolderBase]: 1964/3181 cut-off events. [2024-06-14 14:33:33,976 INFO L125 PetriNetUnfolderBase]: For 181417/181432 co-relation queries the response was YES. [2024-06-14 14:33:33,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22649 conditions, 3181 events. 1964/3181 cut-off events. For 181417/181432 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17456 event pairs, 608 based on Foata normal form. 11/3157 useless extension candidates. Maximal degree in co-relation 22585. Up to 2790 conditions per place. [2024-06-14 14:33:34,003 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 133 selfloop transitions, 18 changer transitions 0/187 dead transitions. [2024-06-14 14:33:34,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 187 transitions, 1982 flow [2024-06-14 14:33:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:33:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:33:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-14 14:33:34,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:33:34,005 INFO L175 Difference]: Start difference. First operand has 145 places, 174 transitions, 1617 flow. Second operand 6 states and 120 transitions. [2024-06-14 14:33:34,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 187 transitions, 1982 flow [2024-06-14 14:33:34,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 187 transitions, 1728 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-06-14 14:33:34,134 INFO L231 Difference]: Finished difference. Result has 139 places, 177 transitions, 1443 flow [2024-06-14 14:33:34,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1443, PETRI_PLACES=139, PETRI_TRANSITIONS=177} [2024-06-14 14:33:34,145 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 94 predicate places. [2024-06-14 14:33:34,145 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 177 transitions, 1443 flow [2024-06-14 14:33:34,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:34,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:34,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:34,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:33:34,153 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:33:34,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2044080480, now seen corresponding path program 1 times [2024-06-14 14:33:34,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:34,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558163282] [2024-06-14 14:33:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:34,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:49,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:49,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558163282] [2024-06-14 14:33:49,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558163282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:49,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:49,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:33:49,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146988226] [2024-06-14 14:33:49,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:49,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:33:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:33:49,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:33:50,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:33:50,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 177 transitions, 1443 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:50,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:50,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:33:50,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:51,267 INFO L124 PetriNetUnfolderBase]: 1935/3151 cut-off events. [2024-06-14 14:33:51,268 INFO L125 PetriNetUnfolderBase]: For 163161/163180 co-relation queries the response was YES. [2024-06-14 14:33:51,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21020 conditions, 3151 events. 1935/3151 cut-off events. For 163161/163180 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 17320 event pairs, 564 based on Foata normal form. 20/3147 useless extension candidates. Maximal degree in co-relation 20955. Up to 2797 conditions per place. [2024-06-14 14:33:51,289 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 163 selfloop transitions, 11 changer transitions 0/192 dead transitions. [2024-06-14 14:33:51,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 192 transitions, 1861 flow [2024-06-14 14:33:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:33:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:33:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-14 14:33:51,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-14 14:33:51,290 INFO L175 Difference]: Start difference. First operand has 139 places, 177 transitions, 1443 flow. Second operand 6 states and 121 transitions. [2024-06-14 14:33:51,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 192 transitions, 1861 flow [2024-06-14 14:33:51,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 192 transitions, 1803 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-14 14:33:51,399 INFO L231 Difference]: Finished difference. Result has 141 places, 180 transitions, 1453 flow [2024-06-14 14:33:51,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1453, PETRI_PLACES=141, PETRI_TRANSITIONS=180} [2024-06-14 14:33:51,400 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 96 predicate places. [2024-06-14 14:33:51,400 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 180 transitions, 1453 flow [2024-06-14 14:33:51,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:51,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:51,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:51,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:33:51,400 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-14 14:33:51,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:51,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2037414240, now seen corresponding path program 2 times [2024-06-14 14:33:51,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:51,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646321869] [2024-06-14 14:33:51,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:51,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:07,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:07,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646321869] [2024-06-14 14:34:07,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646321869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:07,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:07,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:34:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88646526] [2024-06-14 14:34:07,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:07,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:34:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:07,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:34:07,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:34:07,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:34:07,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 180 transitions, 1453 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:07,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:07,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:34:07,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:08,871 INFO L124 PetriNetUnfolderBase]: 1932/3148 cut-off events. [2024-06-14 14:34:08,871 INFO L125 PetriNetUnfolderBase]: For 169550/169572 co-relation queries the response was YES. [2024-06-14 14:34:08,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21402 conditions, 3148 events. 1932/3148 cut-off events. For 169550/169572 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 17347 event pairs, 568 based on Foata normal form. 22/3145 useless extension candidates. Maximal degree in co-relation 21336. Up to 2787 conditions per place. [2024-06-14 14:34:08,904 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 158 selfloop transitions, 16 changer transitions 0/192 dead transitions. [2024-06-14 14:34:08,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 192 transitions, 1867 flow [2024-06-14 14:34:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:34:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:34:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-14 14:34:08,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:34:08,905 INFO L175 Difference]: Start difference. First operand has 141 places, 180 transitions, 1453 flow. Second operand 6 states and 120 transitions. [2024-06-14 14:34:08,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 192 transitions, 1867 flow [2024-06-14 14:34:09,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 192 transitions, 1821 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-14 14:34:09,066 INFO L231 Difference]: Finished difference. Result has 143 places, 183 transitions, 1491 flow [2024-06-14 14:34:09,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1491, PETRI_PLACES=143, PETRI_TRANSITIONS=183} [2024-06-14 14:34:09,067 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places. [2024-06-14 14:34:09,067 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 183 transitions, 1491 flow [2024-06-14 14:34:09,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:09,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:09,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:09,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:34:09,068 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:34:09,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash 356651562, now seen corresponding path program 1 times [2024-06-14 14:34:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:09,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93870220] [2024-06-14 14:34:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:28,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:28,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93870220] [2024-06-14 14:34:28,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93870220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:28,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:28,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009087086] [2024-06-14 14:34:28,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:28,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:28,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:28,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:28,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:28,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:34:28,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 183 transitions, 1491 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:28,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:28,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:34:28,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:31,248 INFO L124 PetriNetUnfolderBase]: 2339/3624 cut-off events. [2024-06-14 14:34:31,248 INFO L125 PetriNetUnfolderBase]: For 213336/213340 co-relation queries the response was YES. [2024-06-14 14:34:31,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26012 conditions, 3624 events. 2339/3624 cut-off events. For 213336/213340 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18831 event pairs, 491 based on Foata normal form. 8/3629 useless extension candidates. Maximal degree in co-relation 25945. Up to 3302 conditions per place. [2024-06-14 14:34:31,273 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 198 selfloop transitions, 28 changer transitions 0/231 dead transitions. [2024-06-14 14:34:31,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 231 transitions, 2324 flow [2024-06-14 14:34:31,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:34:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:34:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-14 14:34:31,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-06-14 14:34:31,276 INFO L175 Difference]: Start difference. First operand has 143 places, 183 transitions, 1491 flow. Second operand 10 states and 195 transitions. [2024-06-14 14:34:31,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 231 transitions, 2324 flow [2024-06-14 14:34:31,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 231 transitions, 2262 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 14:34:31,412 INFO L231 Difference]: Finished difference. Result has 149 places, 187 transitions, 1592 flow [2024-06-14 14:34:31,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1592, PETRI_PLACES=149, PETRI_TRANSITIONS=187} [2024-06-14 14:34:31,412 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 104 predicate places. [2024-06-14 14:34:31,412 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 187 transitions, 1592 flow [2024-06-14 14:34:31,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:31,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:31,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:31,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:34:31,413 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:34:31,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1480711810, now seen corresponding path program 2 times [2024-06-14 14:34:31,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:31,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089869979] [2024-06-14 14:34:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:47,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089869979] [2024-06-14 14:34:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089869979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:47,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647676669] [2024-06-14 14:34:47,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:47,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:47,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:34:47,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 187 transitions, 1592 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:47,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:47,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:34:47,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:49,745 INFO L124 PetriNetUnfolderBase]: 2331/3612 cut-off events. [2024-06-14 14:34:49,745 INFO L125 PetriNetUnfolderBase]: For 221415/221419 co-relation queries the response was YES. [2024-06-14 14:34:49,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26270 conditions, 3612 events. 2331/3612 cut-off events. For 221415/221419 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18828 event pairs, 630 based on Foata normal form. 8/3617 useless extension candidates. Maximal degree in co-relation 26202. Up to 3349 conditions per place. [2024-06-14 14:34:49,772 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 195 selfloop transitions, 24 changer transitions 0/224 dead transitions. [2024-06-14 14:34:49,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 224 transitions, 2145 flow [2024-06-14 14:34:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:34:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:34:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 14:34:49,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44191919191919193 [2024-06-14 14:34:49,776 INFO L175 Difference]: Start difference. First operand has 149 places, 187 transitions, 1592 flow. Second operand 9 states and 175 transitions. [2024-06-14 14:34:49,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 224 transitions, 2145 flow [2024-06-14 14:34:49,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 224 transitions, 2030 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-14 14:34:49,899 INFO L231 Difference]: Finished difference. Result has 152 places, 187 transitions, 1532 flow [2024-06-14 14:34:49,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1532, PETRI_PLACES=152, PETRI_TRANSITIONS=187} [2024-06-14 14:34:49,900 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 107 predicate places. [2024-06-14 14:34:49,900 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 187 transitions, 1532 flow [2024-06-14 14:34:49,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:49,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:49,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:49,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:34:49,901 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:34:49,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:49,901 INFO L85 PathProgramCache]: Analyzing trace with hash 214896170, now seen corresponding path program 3 times [2024-06-14 14:34:49,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:49,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957247937] [2024-06-14 14:34:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:49,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:06,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-14 14:35:06,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:06,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957247937] [2024-06-14 14:35:06,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957247937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:06,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:06,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:35:06,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762147978] [2024-06-14 14:35:06,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:06,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:35:06,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:06,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:35:06,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:35:06,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:35:06,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 187 transitions, 1532 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:06,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:06,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:35:06,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:08,296 INFO L124 PetriNetUnfolderBase]: 2348/3641 cut-off events. [2024-06-14 14:35:08,296 INFO L125 PetriNetUnfolderBase]: For 232585/232592 co-relation queries the response was YES. [2024-06-14 14:35:08,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26549 conditions, 3641 events. 2348/3641 cut-off events. For 232585/232592 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 19007 event pairs, 636 based on Foata normal form. 10/3647 useless extension candidates. Maximal degree in co-relation 26479. Up to 3248 conditions per place. [2024-06-14 14:35:08,323 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 159 selfloop transitions, 58 changer transitions 0/222 dead transitions. [2024-06-14 14:35:08,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 2118 flow [2024-06-14 14:35:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:35:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:35:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-14 14:35:08,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2024-06-14 14:35:08,344 INFO L175 Difference]: Start difference. First operand has 152 places, 187 transitions, 1532 flow. Second operand 9 states and 177 transitions. [2024-06-14 14:35:08,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 2118 flow [2024-06-14 14:35:08,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 222 transitions, 2065 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 14:35:08,481 INFO L231 Difference]: Finished difference. Result has 153 places, 189 transitions, 1658 flow [2024-06-14 14:35:08,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1658, PETRI_PLACES=153, PETRI_TRANSITIONS=189} [2024-06-14 14:35:08,483 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 108 predicate places. [2024-06-14 14:35:08,483 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 189 transitions, 1658 flow [2024-06-14 14:35:08,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:08,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:08,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:08,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:35:08,484 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:35:08,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:08,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1244685766, now seen corresponding path program 1 times [2024-06-14 14:35:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:08,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281291043] [2024-06-14 14:35:08,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:25,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281291043] [2024-06-14 14:35:25,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281291043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:25,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:25,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:35:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53820890] [2024-06-14 14:35:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:25,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:35:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:25,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:35:25,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:35:25,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:35:25,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 189 transitions, 1658 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:25,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:25,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:35:25,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:26,785 INFO L124 PetriNetUnfolderBase]: 2023/3279 cut-off events. [2024-06-14 14:35:26,785 INFO L125 PetriNetUnfolderBase]: For 238398/238408 co-relation queries the response was YES. [2024-06-14 14:35:26,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25063 conditions, 3279 events. 2023/3279 cut-off events. For 238398/238408 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 18070 event pairs, 593 based on Foata normal form. 6/3253 useless extension candidates. Maximal degree in co-relation 24992. Up to 2824 conditions per place. [2024-06-14 14:35:26,812 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 153 selfloop transitions, 20 changer transitions 0/214 dead transitions. [2024-06-14 14:35:26,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 214 transitions, 2115 flow [2024-06-14 14:35:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:35:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:35:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-14 14:35:26,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2024-06-14 14:35:26,813 INFO L175 Difference]: Start difference. First operand has 153 places, 189 transitions, 1658 flow. Second operand 7 states and 146 transitions. [2024-06-14 14:35:26,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 214 transitions, 2115 flow [2024-06-14 14:35:26,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 214 transitions, 1954 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-14 14:35:26,945 INFO L231 Difference]: Finished difference. Result has 153 places, 192 transitions, 1593 flow [2024-06-14 14:35:26,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1593, PETRI_PLACES=153, PETRI_TRANSITIONS=192} [2024-06-14 14:35:26,945 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 108 predicate places. [2024-06-14 14:35:26,945 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 192 transitions, 1593 flow [2024-06-14 14:35:26,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:26,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:26,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:26,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:35:26,946 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:35:26,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:26,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1199781506, now seen corresponding path program 4 times [2024-06-14 14:35:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:26,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835547306] [2024-06-14 14:35:26,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:43,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:43,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835547306] [2024-06-14 14:35:43,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835547306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:43,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:43,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:35:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060502630] [2024-06-14 14:35:43,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:43,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:35:43,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:43,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:35:43,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:35:44,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:35:44,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 192 transitions, 1593 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:44,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:44,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:35:44,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:45,775 INFO L124 PetriNetUnfolderBase]: 2375/3684 cut-off events. [2024-06-14 14:35:45,776 INFO L125 PetriNetUnfolderBase]: For 254149/254152 co-relation queries the response was YES. [2024-06-14 14:35:45,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27657 conditions, 3684 events. 2375/3684 cut-off events. For 254149/254152 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19256 event pairs, 637 based on Foata normal form. 6/3686 useless extension candidates. Maximal degree in co-relation 27585. Up to 3289 conditions per place. [2024-06-14 14:35:45,805 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 166 selfloop transitions, 55 changer transitions 0/226 dead transitions. [2024-06-14 14:35:45,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 226 transitions, 2190 flow [2024-06-14 14:35:45,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:35:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:35:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 14:35:45,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44191919191919193 [2024-06-14 14:35:45,809 INFO L175 Difference]: Start difference. First operand has 153 places, 192 transitions, 1593 flow. Second operand 9 states and 175 transitions. [2024-06-14 14:35:45,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 226 transitions, 2190 flow [2024-06-14 14:35:45,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 226 transitions, 2120 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-14 14:35:45,934 INFO L231 Difference]: Finished difference. Result has 157 places, 194 transitions, 1700 flow [2024-06-14 14:35:45,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1700, PETRI_PLACES=157, PETRI_TRANSITIONS=194} [2024-06-14 14:35:45,934 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 112 predicate places. [2024-06-14 14:35:45,935 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 194 transitions, 1700 flow [2024-06-14 14:35:45,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:45,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:45,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:45,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 14:35:45,935 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:35:45,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1193101378, now seen corresponding path program 1 times [2024-06-14 14:35:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:45,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336825353] [2024-06-14 14:35:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:45,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:00,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336825353] [2024-06-14 14:36:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336825353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:00,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:36:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713092945] [2024-06-14 14:36:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:00,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:36:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:00,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:36:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:36:01,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:36:01,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 194 transitions, 1700 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:01,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:01,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:36:01,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:02,691 INFO L124 PetriNetUnfolderBase]: 2392/3710 cut-off events. [2024-06-14 14:36:02,691 INFO L125 PetriNetUnfolderBase]: For 267496/267503 co-relation queries the response was YES. [2024-06-14 14:36:02,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28337 conditions, 3710 events. 2392/3710 cut-off events. For 267496/267503 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 19427 event pairs, 592 based on Foata normal form. 8/3714 useless extension candidates. Maximal degree in co-relation 28264. Up to 3377 conditions per place. [2024-06-14 14:36:02,727 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 186 selfloop transitions, 40 changer transitions 0/231 dead transitions. [2024-06-14 14:36:02,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 231 transitions, 2319 flow [2024-06-14 14:36:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:36:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:36:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 14:36:02,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44191919191919193 [2024-06-14 14:36:02,731 INFO L175 Difference]: Start difference. First operand has 157 places, 194 transitions, 1700 flow. Second operand 9 states and 175 transitions. [2024-06-14 14:36:02,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 231 transitions, 2319 flow [2024-06-14 14:36:02,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 231 transitions, 2160 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-14 14:36:02,896 INFO L231 Difference]: Finished difference. Result has 160 places, 199 transitions, 1707 flow [2024-06-14 14:36:02,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1707, PETRI_PLACES=160, PETRI_TRANSITIONS=199} [2024-06-14 14:36:02,896 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 115 predicate places. [2024-06-14 14:36:02,896 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 199 transitions, 1707 flow [2024-06-14 14:36:02,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:02,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:02,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:02,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 14:36:02,897 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:36:02,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:02,898 INFO L85 PathProgramCache]: Analyzing trace with hash 851147006, now seen corresponding path program 2 times [2024-06-14 14:36:02,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:02,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429512403] [2024-06-14 14:36:02,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:02,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:19,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:19,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429512403] [2024-06-14 14:36:19,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429512403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:19,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:19,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:36:19,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715427433] [2024-06-14 14:36:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:19,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:36:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:19,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:36:19,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:36:19,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:36:19,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 199 transitions, 1707 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:19,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:19,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:36:19,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:20,743 INFO L124 PetriNetUnfolderBase]: 2054/3332 cut-off events. [2024-06-14 14:36:20,743 INFO L125 PetriNetUnfolderBase]: For 270495/270503 co-relation queries the response was YES. [2024-06-14 14:36:20,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26655 conditions, 3332 events. 2054/3332 cut-off events. For 270495/270503 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 18403 event pairs, 567 based on Foata normal form. 1/3301 useless extension candidates. Maximal degree in co-relation 26580. Up to 2867 conditions per place. [2024-06-14 14:36:20,776 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 153 selfloop transitions, 24 changer transitions 0/219 dead transitions. [2024-06-14 14:36:20,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 219 transitions, 2162 flow [2024-06-14 14:36:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:36:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:36:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2024-06-14 14:36:20,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2024-06-14 14:36:20,778 INFO L175 Difference]: Start difference. First operand has 160 places, 199 transitions, 1707 flow. Second operand 7 states and 142 transitions. [2024-06-14 14:36:20,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 219 transitions, 2162 flow [2024-06-14 14:36:20,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 219 transitions, 2039 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-14 14:36:21,002 INFO L231 Difference]: Finished difference. Result has 161 places, 202 transitions, 1692 flow [2024-06-14 14:36:21,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1692, PETRI_PLACES=161, PETRI_TRANSITIONS=202} [2024-06-14 14:36:21,003 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 116 predicate places. [2024-06-14 14:36:21,003 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 202 transitions, 1692 flow [2024-06-14 14:36:21,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:21,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:21,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:21,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 14:36:21,003 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:36:21,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash 851147440, now seen corresponding path program 1 times [2024-06-14 14:36:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053267552] [2024-06-14 14:36:21,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15