./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix033_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/mix033_tso.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix033_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:40:23,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:40:23,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:40:23,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:40:23,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:40:23,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:40:23,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:40:23,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:40:23,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:40:23,462 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:40:23,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:40:23,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:40:23,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:40:23,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:40:23,463 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:40:23,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:40:23,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:40:23,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:40:23,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:40:23,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:40:23,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:40:23,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:40:23,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:40:23,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:40:23,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:40:23,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:40:23,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:40:23,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:40:23,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:40:23,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:40:23,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:40:23,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:40:23,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:40:23,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:40:23,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:40:23,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:40:23,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:40:23,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:40:23,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:40:23,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:40:23,469 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:40:23,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:40:23,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:40:23,470 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 [2024-05-12 11:40:23,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:40:23,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:40:23,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:40:23,645 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:40:23,645 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:40:23,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix033_tso.oepc.yml/witness.yml [2024-05-12 11:40:23,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:40:23,879 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:40:23,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2024-05-12 11:40:24,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:40:25,106 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:40:25,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2024-05-12 11:40:25,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c836a06f/bc14e9758dd447309de751c6934474c0/FLAG70237c386 [2024-05-12 11:40:25,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c836a06f/bc14e9758dd447309de751c6934474c0 [2024-05-12 11:40:25,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:40:25,129 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:40:25,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:40:25,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:40:25,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:40:25,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:40:23" (1/2) ... [2024-05-12 11:40:25,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ef847d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:40:25, skipping insertion in model container [2024-05-12 11:40:25,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:40:23" (1/2) ... [2024-05-12 11:40:25,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5848287d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:40:25, skipping insertion in model container [2024-05-12 11:40:25,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:40:25" (2/2) ... [2024-05-12 11:40:25,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ef847d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:25, skipping insertion in model container [2024-05-12 11:40:25,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:40:25" (2/2) ... [2024-05-12 11:40:25,137 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:40:25,216 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:40:25,217 INFO L97 edCorrectnessWitness]: Location invariant before [L846-L846] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )x$flush_delayed >= 0LL) && (long long )b + (long long )x$mem_tmp >= 0LL) && (long long )b + (long long )x$r_buff0_thd0 >= 0LL) && (long long )b + (long long )x$r_buff0_thd1 >= 0LL) && (long long )b + (long long )x$r_buff0_thd2 >= 0LL) && (long long )b + (long long )x$r_buff0_thd3 >= 0LL) && (long long )b + (long long )x$r_buff1_thd0 >= 0LL) && (long long )b + (long long )x$r_buff1_thd1 >= 0LL) && (long long )b + (long long )x$r_buff1_thd2 >= 0LL) && (long long )b + (long long )x$r_buff1_thd3 >= 0LL) && (long long )b + (long long )x$read_delayed >= 0LL) && (long long )b + (long long )x$w_buff0 >= 0LL) && (long long )b + (long long )x$w_buff1 >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )b - (long long )x$r_buff0_thd0 >= 0LL) && (long long )b - (long long )x$r_buff0_thd1 >= 0LL) && (long long )b - (long long )x$r_buff0_thd3 >= 0LL) && (long long )b - (long long )x$r_buff1_thd0 >= 0LL) && (long long )b - (long long )x$r_buff1_thd1 >= 0LL) && (long long )b - (long long )x$r_buff1_thd3 >= 0LL) && (long long )b - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0) [2024-05-12 11:40:25,218 INFO L97 edCorrectnessWitness]: Location invariant before [L843-L843] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )x$flush_delayed >= 0LL) && (long long )b + (long long )x$mem_tmp >= 0LL) && (long long )b + (long long )x$r_buff0_thd0 >= 0LL) && (long long )b + (long long )x$r_buff0_thd1 >= 0LL) && (long long )b + (long long )x$r_buff0_thd2 >= 0LL) && (long long )b + (long long )x$r_buff0_thd3 >= 0LL) && (long long )b + (long long )x$r_buff1_thd0 >= 0LL) && (long long )b + (long long )x$r_buff1_thd1 >= 0LL) && (long long )b + (long long )x$r_buff1_thd2 >= 0LL) && (long long )b + (long long )x$r_buff1_thd3 >= 0LL) && (long long )b + (long long )x$read_delayed >= 0LL) && (long long )b + (long long )x$w_buff0 >= 0LL) && (long long )b + (long long )x$w_buff1 >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )b - (long long )x$r_buff0_thd0 >= 0LL) && (long long )b - (long long )x$r_buff0_thd1 >= 0LL) && (long long )b - (long long )x$r_buff0_thd3 >= 0LL) && (long long )b - (long long )x$r_buff1_thd0 >= 0LL) && (long long )b - (long long )x$r_buff1_thd1 >= 0LL) && (long long )b - (long long )x$r_buff1_thd3 >= 0LL) && (long long )b - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0) [2024-05-12 11:40:25,219 INFO L97 edCorrectnessWitness]: Location invariant before [L845-L845] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )x$flush_delayed >= 0LL) && (long long )b + (long long )x$mem_tmp >= 0LL) && (long long )b + (long long )x$r_buff0_thd0 >= 0LL) && (long long )b + (long long )x$r_buff0_thd1 >= 0LL) && (long long )b + (long long )x$r_buff0_thd2 >= 0LL) && (long long )b + (long long )x$r_buff0_thd3 >= 0LL) && (long long )b + (long long )x$r_buff1_thd0 >= 0LL) && (long long )b + (long long )x$r_buff1_thd1 >= 0LL) && (long long )b + (long long )x$r_buff1_thd2 >= 0LL) && (long long )b + (long long )x$r_buff1_thd3 >= 0LL) && (long long )b + (long long )x$read_delayed >= 0LL) && (long long )b + (long long )x$w_buff0 >= 0LL) && (long long )b + (long long )x$w_buff1 >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )b - (long long )x$r_buff0_thd0 >= 0LL) && (long long )b - (long long )x$r_buff0_thd1 >= 0LL) && (long long )b - (long long )x$r_buff0_thd3 >= 0LL) && (long long )b - (long long )x$r_buff1_thd0 >= 0LL) && (long long )b - (long long )x$r_buff1_thd1 >= 0LL) && (long long )b - (long long )x$r_buff1_thd3 >= 0LL) && (long long )b - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0) [2024-05-12 11:40:25,219 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:40:25,220 INFO L106 edCorrectnessWitness]: ghost_update [L841-L841] multithreaded = 1; [2024-05-12 11:40:25,257 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:40:25,408 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i[949,962] [2024-05-12 11:40:25,655 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:40:25,661 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:40:25,687 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i[949,962] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:40:25,975 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:40:26,002 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:40:26,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26 WrapperNode [2024-05-12 11:40:26,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:40:26,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:40:26,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:40:26,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:40:26,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,182 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2024-05-12 11:40:26,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:40:26,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:40:26,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:40:26,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:40:26,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,266 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-05-12 11:40:26,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:40:26,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:40:26,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:40:26,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:40:26,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (1/1) ... [2024-05-12 11:40:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:40:26,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:40:26,453 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-05-12 11:40:26,470 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-05-12 11:40:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:40:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:40:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:40:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:40:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:40:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:40:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:40:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:40:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:40:26,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:40:26,488 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:40:26,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:40:26,488 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 11:40:26,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 11:40:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:40:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:40:26,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:40:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:40:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:40:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:40:26,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:40:26,491 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:40:26,656 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:40:26,658 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:40:28,102 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:40:28,103 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:40:28,408 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:40:28,409 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:40:28,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:40:28 BoogieIcfgContainer [2024-05-12 11:40:28,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:40:28,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:40:28,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:40:28,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:40:28,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:40:23" (1/4) ... [2024-05-12 11:40:28,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a17f621 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:40:28, skipping insertion in model container [2024-05-12 11:40:28,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:40:25" (2/4) ... [2024-05-12 11:40:28,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a17f621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:40:28, skipping insertion in model container [2024-05-12 11:40:28,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:40:26" (3/4) ... [2024-05-12 11:40:28,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a17f621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:40:28, skipping insertion in model container [2024-05-12 11:40:28,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:40:28" (4/4) ... [2024-05-12 11:40:28,419 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2024-05-12 11:40:28,432 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:40:28,432 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 11:40:28,432 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:40:28,574 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:40:28,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 51 transitions, 114 flow [2024-05-12 11:40:28,680 INFO L124 PetriNetUnfolderBase]: 1/48 cut-off events. [2024-05-12 11:40:28,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:40:28,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 48 events. 1/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2024-05-12 11:40:28,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 51 transitions, 114 flow [2024-05-12 11:40:28,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 105 flow [2024-05-12 11:40:28,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:40:28,707 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;@2339a79a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:40:28,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 11:40:28,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:40:28,716 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-05-12 11:40:28,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:40:28,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:28,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:40:28,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:28,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1937987310, now seen corresponding path program 1 times [2024-05-12 11:40:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494935614] [2024-05-12 11:40:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:36,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:36,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494935614] [2024-05-12 11:40:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494935614] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:36,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:36,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:40:36,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685836843] [2024-05-12 11:40:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:36,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:40:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:36,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:40:36,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:40:37,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2024-05-12 11:40:37,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 105 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-05-12 11:40:37,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:37,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2024-05-12 11:40:37,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:38,704 INFO L124 PetriNetUnfolderBase]: 5133/7889 cut-off events. [2024-05-12 11:40:38,705 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-05-12 11:40:38,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15333 conditions, 7889 events. 5133/7889 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 49041 event pairs, 3057 based on Foata normal form. 253/7650 useless extension candidates. Maximal degree in co-relation 15318. Up to 7326 conditions per place. [2024-05-12 11:40:38,749 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 46 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2024-05-12 11:40:38,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 243 flow [2024-05-12 11:40:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:40:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:40:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-05-12 11:40:38,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6601307189542484 [2024-05-12 11:40:38,760 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 105 flow. Second operand 3 states and 101 transitions. [2024-05-12 11:40:38,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 243 flow [2024-05-12 11:40:38,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 238 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:40:38,765 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 137 flow [2024-05-12 11:40:38,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-05-12 11:40:38,769 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2024-05-12 11:40:38,769 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 137 flow [2024-05-12 11:40:38,769 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-05-12 11:40:38,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:38,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:38,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:40:38,770 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:38,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1610018161, now seen corresponding path program 1 times [2024-05-12 11:40:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213582206] [2024-05-12 11:40:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213582206] [2024-05-12 11:40:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213582206] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:40:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973436923] [2024-05-12 11:40:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:44,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:40:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:44,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:40:44,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:40:44,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:40:44,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:44,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:44,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:40:44,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:46,449 INFO L124 PetriNetUnfolderBase]: 5987/8866 cut-off events. [2024-05-12 11:40:46,449 INFO L125 PetriNetUnfolderBase]: For 1118/1118 co-relation queries the response was YES. [2024-05-12 11:40:46,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19340 conditions, 8866 events. 5987/8866 cut-off events. For 1118/1118 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 53300 event pairs, 3083 based on Foata normal form. 3/8426 useless extension candidates. Maximal degree in co-relation 19325. Up to 8488 conditions per place. [2024-05-12 11:40:46,561 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 59 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2024-05-12 11:40:46,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 343 flow [2024-05-12 11:40:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:40:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:40:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-05-12 11:40:46,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6225490196078431 [2024-05-12 11:40:46,568 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 137 flow. Second operand 4 states and 127 transitions. [2024-05-12 11:40:46,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 343 flow [2024-05-12 11:40:46,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:40:46,574 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 183 flow [2024-05-12 11:40:46,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-05-12 11:40:46,579 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-05-12 11:40:46,579 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 183 flow [2024-05-12 11:40:46,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:46,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:46,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:46,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:40:46,580 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:46,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1629043981, now seen corresponding path program 1 times [2024-05-12 11:40:46,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524883494] [2024-05-12 11:40:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524883494] [2024-05-12 11:40:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524883494] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:52,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:52,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:40:52,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408634408] [2024-05-12 11:40:52,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:52,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:40:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:52,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:40:52,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:40:52,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:40:52,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:52,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:52,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:40:52,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:54,320 INFO L124 PetriNetUnfolderBase]: 5971/9470 cut-off events. [2024-05-12 11:40:54,321 INFO L125 PetriNetUnfolderBase]: For 3307/3307 co-relation queries the response was YES. [2024-05-12 11:40:54,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21708 conditions, 9470 events. 5971/9470 cut-off events. For 3307/3307 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 62529 event pairs, 2974 based on Foata normal form. 6/8759 useless extension candidates. Maximal degree in co-relation 21691. Up to 8437 conditions per place. [2024-05-12 11:40:54,359 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 71 selfloop transitions, 16 changer transitions 0/98 dead transitions. [2024-05-12 11:40:54,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 502 flow [2024-05-12 11:40:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:40:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:40:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-05-12 11:40:54,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.596078431372549 [2024-05-12 11:40:54,361 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 183 flow. Second operand 5 states and 152 transitions. [2024-05-12 11:40:54,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 502 flow [2024-05-12 11:40:54,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 98 transitions, 466 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-05-12 11:40:54,364 INFO L231 Difference]: Finished difference. Result has 65 places, 70 transitions, 306 flow [2024-05-12 11:40:54,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=65, PETRI_TRANSITIONS=70} [2024-05-12 11:40:54,365 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2024-05-12 11:40:54,365 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 70 transitions, 306 flow [2024-05-12 11:40:54,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:54,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:54,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:54,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:40:54,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:54,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1629140906, now seen corresponding path program 1 times [2024-05-12 11:40:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:54,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394546046] [2024-05-12 11:40:54,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:54,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:54,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:54,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394546046] [2024-05-12 11:40:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394546046] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:54,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:54,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:40:54,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531193467] [2024-05-12 11:40:54,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:54,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:40:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:54,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:40:54,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:40:54,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 51 [2024-05-12 11:40:54,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:54,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:54,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 51 [2024-05-12 11:40:54,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:55,158 INFO L124 PetriNetUnfolderBase]: 1235/2682 cut-off events. [2024-05-12 11:40:55,159 INFO L125 PetriNetUnfolderBase]: For 1256/1392 co-relation queries the response was YES. [2024-05-12 11:40:55,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5652 conditions, 2682 events. 1235/2682 cut-off events. For 1256/1392 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20975 event pairs, 483 based on Foata normal form. 24/2557 useless extension candidates. Maximal degree in co-relation 5632. Up to 1589 conditions per place. [2024-05-12 11:40:55,172 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 37 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2024-05-12 11:40:55,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 77 transitions, 381 flow [2024-05-12 11:40:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:40:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:40:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-05-12 11:40:55,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7516339869281046 [2024-05-12 11:40:55,173 INFO L175 Difference]: Start difference. First operand has 65 places, 70 transitions, 306 flow. Second operand 3 states and 115 transitions. [2024-05-12 11:40:55,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 77 transitions, 381 flow [2024-05-12 11:40:55,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 77 transitions, 373 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-05-12 11:40:55,176 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 269 flow [2024-05-12 11:40:55,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2024-05-12 11:40:55,177 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-05-12 11:40:55,177 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 269 flow [2024-05-12 11:40:55,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:55,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:55,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:55,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:40:55,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:55,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1226068114, now seen corresponding path program 1 times [2024-05-12 11:40:55,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:55,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65457756] [2024-05-12 11:40:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:01,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:01,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65457756] [2024-05-12 11:41:01,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65457756] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:01,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:01,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:41:01,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619282750] [2024-05-12 11:41:01,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:01,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:41:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:01,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:41:01,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:41:02,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:41:02,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 269 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:02,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:02,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:41:02,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:03,777 INFO L124 PetriNetUnfolderBase]: 5064/8004 cut-off events. [2024-05-12 11:41:03,778 INFO L125 PetriNetUnfolderBase]: For 7009/7009 co-relation queries the response was YES. [2024-05-12 11:41:03,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19775 conditions, 8004 events. 5064/8004 cut-off events. For 7009/7009 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 50421 event pairs, 2568 based on Foata normal form. 6/7707 useless extension candidates. Maximal degree in co-relation 19753. Up to 7126 conditions per place. [2024-05-12 11:41:03,815 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 73 selfloop transitions, 16 changer transitions 1/101 dead transitions. [2024-05-12 11:41:03,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 101 transitions, 547 flow [2024-05-12 11:41:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:41:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:41:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-05-12 11:41:03,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2024-05-12 11:41:03,817 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 269 flow. Second operand 6 states and 171 transitions. [2024-05-12 11:41:03,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 101 transitions, 547 flow [2024-05-12 11:41:03,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 531 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:41:03,823 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 311 flow [2024-05-12 11:41:03,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=311, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-05-12 11:41:03,824 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2024-05-12 11:41:03,824 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 311 flow [2024-05-12 11:41:03,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:03,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:03,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:03,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:41:03,825 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:41:03,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:03,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2058618261, now seen corresponding path program 1 times [2024-05-12 11:41:03,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:03,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390854820] [2024-05-12 11:41:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:03,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:16,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390854820] [2024-05-12 11:41:16,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390854820] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:16,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:16,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:41:16,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703314262] [2024-05-12 11:41:16,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:16,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:41:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:41:16,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:41:16,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:41:16,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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-05-12 11:41:16,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:16,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:41:16,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:18,914 INFO L124 PetriNetUnfolderBase]: 4335/7044 cut-off events. [2024-05-12 11:41:18,915 INFO L125 PetriNetUnfolderBase]: For 7837/7837 co-relation queries the response was YES. [2024-05-12 11:41:18,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18117 conditions, 7044 events. 4335/7044 cut-off events. For 7837/7837 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 44919 event pairs, 2339 based on Foata normal form. 2/6737 useless extension candidates. Maximal degree in co-relation 18094. Up to 6189 conditions per place. [2024-05-12 11:41:18,944 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 70 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2024-05-12 11:41:18,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 563 flow [2024-05-12 11:41:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:41:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:41:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-05-12 11:41:18,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2024-05-12 11:41:18,946 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 311 flow. Second operand 5 states and 130 transitions. [2024-05-12 11:41:18,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 563 flow [2024-05-12 11:41:18,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 515 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-05-12 11:41:18,950 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 356 flow [2024-05-12 11:41:18,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2024-05-12 11:41:18,950 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2024-05-12 11:41:18,950 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 356 flow [2024-05-12 11:41:18,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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-05-12 11:41:18,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:18,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:18,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:41:18,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:41:18,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash -607342432, now seen corresponding path program 1 times [2024-05-12 11:41:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:18,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484936126] [2024-05-12 11:41:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:33,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484936126] [2024-05-12 11:41:33,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484936126] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:33,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:33,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:41:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372860174] [2024-05-12 11:41:33,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:33,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:41:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:33,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:41:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:41:33,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:41:33,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 356 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:33,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:33,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:41:33,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:35,606 INFO L124 PetriNetUnfolderBase]: 5114/8341 cut-off events. [2024-05-12 11:41:35,606 INFO L125 PetriNetUnfolderBase]: For 12059/12059 co-relation queries the response was YES. [2024-05-12 11:41:35,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22496 conditions, 8341 events. 5114/8341 cut-off events. For 12059/12059 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 54150 event pairs, 2786 based on Foata normal form. 2/8056 useless extension candidates. Maximal degree in co-relation 22470. Up to 7262 conditions per place. [2024-05-12 11:41:35,677 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 80 selfloop transitions, 12 changer transitions 0/102 dead transitions. [2024-05-12 11:41:35,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 102 transitions, 634 flow [2024-05-12 11:41:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:41:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:41:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-05-12 11:41:35,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4934640522875817 [2024-05-12 11:41:35,679 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 356 flow. Second operand 6 states and 151 transitions. [2024-05-12 11:41:35,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 102 transitions, 634 flow [2024-05-12 11:41:35,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 102 transitions, 617 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 11:41:35,684 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 397 flow [2024-05-12 11:41:35,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2024-05-12 11:41:35,686 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2024-05-12 11:41:35,686 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 397 flow [2024-05-12 11:41:35,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:35,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:35,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:35,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:41:35,687 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:41:35,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:35,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1086922070, now seen corresponding path program 1 times [2024-05-12 11:41:35,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:35,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676955341] [2024-05-12 11:41:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:48,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:48,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676955341] [2024-05-12 11:41:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676955341] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:48,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:48,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:41:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259992508] [2024-05-12 11:41:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:48,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:41:48,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:48,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:41:48,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:41:48,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:41:48,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 397 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:48,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:48,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:41:48,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:51,141 INFO L124 PetriNetUnfolderBase]: 5695/9213 cut-off events. [2024-05-12 11:41:51,141 INFO L125 PetriNetUnfolderBase]: For 18371/18371 co-relation queries the response was YES. [2024-05-12 11:41:51,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26258 conditions, 9213 events. 5695/9213 cut-off events. For 18371/18371 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 60147 event pairs, 2998 based on Foata normal form. 2/8927 useless extension candidates. Maximal degree in co-relation 26230. Up to 8102 conditions per place. [2024-05-12 11:41:51,189 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 85 selfloop transitions, 13 changer transitions 0/109 dead transitions. [2024-05-12 11:41:51,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 109 transitions, 711 flow [2024-05-12 11:41:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:41:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:41:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-05-12 11:41:51,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49673202614379086 [2024-05-12 11:41:51,191 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 397 flow. Second operand 6 states and 152 transitions. [2024-05-12 11:41:51,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 109 transitions, 711 flow [2024-05-12 11:41:51,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 109 transitions, 679 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 11:41:51,197 INFO L231 Difference]: Finished difference. Result has 77 places, 82 transitions, 466 flow [2024-05-12 11:41:51,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2024-05-12 11:41:51,198 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2024-05-12 11:41:51,198 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 466 flow [2024-05-12 11:41:51,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:51,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:51,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:51,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:41:51,199 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:41:51,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1345048498, now seen corresponding path program 2 times [2024-05-12 11:41:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521245639] [2024-05-12 11:41:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:05,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:05,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521245639] [2024-05-12 11:42:05,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521245639] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:05,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:05,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:42:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341456255] [2024-05-12 11:42:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:05,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:42:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:42:05,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:42:05,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:42:05,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 466 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:05,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:05,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:42:05,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:07,969 INFO L124 PetriNetUnfolderBase]: 5666/9192 cut-off events. [2024-05-12 11:42:07,969 INFO L125 PetriNetUnfolderBase]: For 23794/23810 co-relation queries the response was YES. [2024-05-12 11:42:07,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27769 conditions, 9192 events. 5666/9192 cut-off events. For 23794/23810 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 60349 event pairs, 2840 based on Foata normal form. 18/8933 useless extension candidates. Maximal degree in co-relation 27739. Up to 8024 conditions per place. [2024-05-12 11:42:08,017 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 83 selfloop transitions, 18 changer transitions 0/112 dead transitions. [2024-05-12 11:42:08,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 112 transitions, 774 flow [2024-05-12 11:42:08,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:42:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:42:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-05-12 11:42:08,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:42:08,018 INFO L175 Difference]: Start difference. First operand has 77 places, 82 transitions, 466 flow. Second operand 6 states and 153 transitions. [2024-05-12 11:42:08,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 112 transitions, 774 flow [2024-05-12 11:42:08,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 112 transitions, 741 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 11:42:08,028 INFO L231 Difference]: Finished difference. Result has 80 places, 85 transitions, 511 flow [2024-05-12 11:42:08,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=511, PETRI_PLACES=80, PETRI_TRANSITIONS=85} [2024-05-12 11:42:08,028 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-05-12 11:42:08,029 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 511 flow [2024-05-12 11:42:08,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:08,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:08,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:08,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:42:08,029 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:42:08,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1647745260, now seen corresponding path program 1 times [2024-05-12 11:42:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:08,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743092876] [2024-05-12 11:42:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:08,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:21,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743092876] [2024-05-12 11:42:21,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743092876] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:21,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:21,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:42:21,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721962105] [2024-05-12 11:42:21,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:21,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:42:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:21,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:42:21,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:42:22,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:42:22,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 511 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:22,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:22,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:42:22,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:24,512 INFO L124 PetriNetUnfolderBase]: 5146/8466 cut-off events. [2024-05-12 11:42:24,512 INFO L125 PetriNetUnfolderBase]: For 26010/26010 co-relation queries the response was YES. [2024-05-12 11:42:24,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26684 conditions, 8466 events. 5146/8466 cut-off events. For 26010/26010 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 55717 event pairs, 2641 based on Foata normal form. 2/8203 useless extension candidates. Maximal degree in co-relation 26653. Up to 7287 conditions per place. [2024-05-12 11:42:24,549 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 99 selfloop transitions, 15 changer transitions 0/124 dead transitions. [2024-05-12 11:42:24,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 124 transitions, 873 flow [2024-05-12 11:42:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:42:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:42:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-05-12 11:42:24,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49299719887955185 [2024-05-12 11:42:24,550 INFO L175 Difference]: Start difference. First operand has 80 places, 85 transitions, 511 flow. Second operand 7 states and 176 transitions. [2024-05-12 11:42:24,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 124 transitions, 873 flow [2024-05-12 11:42:24,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 124 transitions, 821 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-05-12 11:42:24,559 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 531 flow [2024-05-12 11:42:24,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=531, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2024-05-12 11:42:24,560 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 26 predicate places. [2024-05-12 11:42:24,560 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 531 flow [2024-05-12 11:42:24,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:24,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:24,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:24,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:42:24,561 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:42:24,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1431343802, now seen corresponding path program 1 times [2024-05-12 11:42:24,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:24,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228708176] [2024-05-12 11:42:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:37,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:37,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228708176] [2024-05-12 11:42:37,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228708176] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:37,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:37,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:42:37,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053867841] [2024-05-12 11:42:37,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:37,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:42:37,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:37,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:42:37,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:42:37,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:42:37,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 531 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:37,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:37,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:42:37,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:40,076 INFO L124 PetriNetUnfolderBase]: 5738/9304 cut-off events. [2024-05-12 11:42:40,077 INFO L125 PetriNetUnfolderBase]: For 36343/36351 co-relation queries the response was YES. [2024-05-12 11:42:40,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30904 conditions, 9304 events. 5738/9304 cut-off events. For 36343/36351 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 60874 event pairs, 2501 based on Foata normal form. 12/9024 useless extension candidates. Maximal degree in co-relation 30872. Up to 8101 conditions per place. [2024-05-12 11:42:40,122 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 94 selfloop transitions, 29 changer transitions 0/134 dead transitions. [2024-05-12 11:42:40,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 134 transitions, 934 flow [2024-05-12 11:42:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:42:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:42:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-05-12 11:42:40,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2024-05-12 11:42:40,124 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 531 flow. Second operand 7 states and 183 transitions. [2024-05-12 11:42:40,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 134 transitions, 934 flow [2024-05-12 11:42:40,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 134 transitions, 888 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 11:42:40,135 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 632 flow [2024-05-12 11:42:40,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=632, PETRI_PLACES=86, PETRI_TRANSITIONS=97} [2024-05-12 11:42:40,135 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2024-05-12 11:42:40,135 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 97 transitions, 632 flow [2024-05-12 11:42:40,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:40,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:40,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:40,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:42:40,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:42:40,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:40,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1587807604, now seen corresponding path program 2 times [2024-05-12 11:42:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:40,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869293887] [2024-05-12 11:42:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869293887] [2024-05-12 11:42:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869293887] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:54,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:54,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:42:54,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776348772] [2024-05-12 11:42:54,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:54,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:42:54,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:54,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:42:54,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:42:54,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:42:54,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 97 transitions, 632 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:54,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:54,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:42:54,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:57,017 INFO L124 PetriNetUnfolderBase]: 5831/9417 cut-off events. [2024-05-12 11:42:57,017 INFO L125 PetriNetUnfolderBase]: For 46323/46331 co-relation queries the response was YES. [2024-05-12 11:42:57,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33955 conditions, 9417 events. 5831/9417 cut-off events. For 46323/46331 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 61369 event pairs, 2435 based on Foata normal form. 12/9117 useless extension candidates. Maximal degree in co-relation 33921. Up to 8153 conditions per place. [2024-05-12 11:42:57,068 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 99 selfloop transitions, 37 changer transitions 0/147 dead transitions. [2024-05-12 11:42:57,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 147 transitions, 1170 flow [2024-05-12 11:42:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:42:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:42:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-05-12 11:42:57,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154061624649859 [2024-05-12 11:42:57,071 INFO L175 Difference]: Start difference. First operand has 86 places, 97 transitions, 632 flow. Second operand 7 states and 184 transitions. [2024-05-12 11:42:57,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 147 transitions, 1170 flow [2024-05-12 11:42:57,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 147 transitions, 1105 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-05-12 11:42:57,086 INFO L231 Difference]: Finished difference. Result has 91 places, 109 transitions, 797 flow [2024-05-12 11:42:57,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=797, PETRI_PLACES=91, PETRI_TRANSITIONS=109} [2024-05-12 11:42:57,087 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2024-05-12 11:42:57,087 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 109 transitions, 797 flow [2024-05-12 11:42:57,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:57,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:57,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:57,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:42:57,088 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:42:57,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:57,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1431222685, now seen corresponding path program 1 times [2024-05-12 11:42:57,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:57,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187587555] [2024-05-12 11:42:57,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:57,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:11,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:11,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187587555] [2024-05-12 11:43:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187587555] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:11,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:43:11,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533247594] [2024-05-12 11:43:11,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:11,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:43:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:43:11,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:43:11,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:43:11,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 109 transitions, 797 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:11,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:11,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:43:11,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:14,342 INFO L124 PetriNetUnfolderBase]: 6153/9766 cut-off events. [2024-05-12 11:43:14,343 INFO L125 PetriNetUnfolderBase]: For 55748/55748 co-relation queries the response was YES. [2024-05-12 11:43:14,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37134 conditions, 9766 events. 6153/9766 cut-off events. For 55748/55748 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 62008 event pairs, 2614 based on Foata normal form. 2/9495 useless extension candidates. Maximal degree in co-relation 37098. Up to 8685 conditions per place. [2024-05-12 11:43:14,399 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 120 selfloop transitions, 19 changer transitions 0/148 dead transitions. [2024-05-12 11:43:14,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 148 transitions, 1226 flow [2024-05-12 11:43:14,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:43:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:43:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-05-12 11:43:14,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789915966386555 [2024-05-12 11:43:14,400 INFO L175 Difference]: Start difference. First operand has 91 places, 109 transitions, 797 flow. Second operand 7 states and 171 transitions. [2024-05-12 11:43:14,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 148 transitions, 1226 flow [2024-05-12 11:43:14,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 148 transitions, 1138 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-05-12 11:43:14,426 INFO L231 Difference]: Finished difference. Result has 94 places, 112 transitions, 804 flow [2024-05-12 11:43:14,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=804, PETRI_PLACES=94, PETRI_TRANSITIONS=112} [2024-05-12 11:43:14,427 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2024-05-12 11:43:14,427 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 112 transitions, 804 flow [2024-05-12 11:43:14,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:14,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:14,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:14,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:43:14,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:43:14,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:14,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1253168605, now seen corresponding path program 2 times [2024-05-12 11:43:14,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:14,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416981040] [2024-05-12 11:43:14,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:14,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:28,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:28,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:28,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416981040] [2024-05-12 11:43:28,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416981040] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:28,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:28,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:43:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282447539] [2024-05-12 11:43:28,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:28,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:43:28,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:28,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:43:28,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:43:28,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:43:28,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 112 transitions, 804 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:28,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:28,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:43:28,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:31,629 INFO L124 PetriNetUnfolderBase]: 6187/9846 cut-off events. [2024-05-12 11:43:31,630 INFO L125 PetriNetUnfolderBase]: For 63433/63451 co-relation queries the response was YES. [2024-05-12 11:43:31,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38389 conditions, 9846 events. 6187/9846 cut-off events. For 63433/63451 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 63002 event pairs, 2465 based on Foata normal form. 20/9592 useless extension candidates. Maximal degree in co-relation 38352. Up to 8638 conditions per place. [2024-05-12 11:43:31,682 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 118 selfloop transitions, 30 changer transitions 0/157 dead transitions. [2024-05-12 11:43:31,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 157 transitions, 1367 flow [2024-05-12 11:43:31,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:43:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:43:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-05-12 11:43:31,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49299719887955185 [2024-05-12 11:43:31,684 INFO L175 Difference]: Start difference. First operand has 94 places, 112 transitions, 804 flow. Second operand 7 states and 176 transitions. [2024-05-12 11:43:31,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 157 transitions, 1367 flow [2024-05-12 11:43:31,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 157 transitions, 1308 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 11:43:31,707 INFO L231 Difference]: Finished difference. Result has 96 places, 118 transitions, 907 flow [2024-05-12 11:43:31,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=907, PETRI_PLACES=96, PETRI_TRANSITIONS=118} [2024-05-12 11:43:31,708 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 39 predicate places. [2024-05-12 11:43:31,709 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 118 transitions, 907 flow [2024-05-12 11:43:31,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:31,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:31,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:31,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:43:31,709 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:43:31,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1426552442, now seen corresponding path program 3 times [2024-05-12 11:43:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:31,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396944220] [2024-05-12 11:43:31,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:31,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:45,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:45,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396944220] [2024-05-12 11:43:45,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396944220] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:45,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:45,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:43:45,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493251130] [2024-05-12 11:43:45,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:45,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:43:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:45,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:43:45,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:43:45,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:43:45,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 118 transitions, 907 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:45,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:45,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:43:45,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:48,838 INFO L124 PetriNetUnfolderBase]: 5856/9517 cut-off events. [2024-05-12 11:43:48,838 INFO L125 PetriNetUnfolderBase]: For 71843/71898 co-relation queries the response was YES. [2024-05-12 11:43:48,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38120 conditions, 9517 events. 5856/9517 cut-off events. For 71843/71898 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 62651 event pairs, 2294 based on Foata normal form. 13/9240 useless extension candidates. Maximal degree in co-relation 38082. Up to 8111 conditions per place. [2024-05-12 11:43:48,893 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 107 selfloop transitions, 51 changer transitions 0/172 dead transitions. [2024-05-12 11:43:48,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 172 transitions, 1606 flow [2024-05-12 11:43:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:43:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:43:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-05-12 11:43:48,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2024-05-12 11:43:48,896 INFO L175 Difference]: Start difference. First operand has 96 places, 118 transitions, 907 flow. Second operand 7 states and 183 transitions. [2024-05-12 11:43:48,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 172 transitions, 1606 flow [2024-05-12 11:43:48,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 172 transitions, 1546 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-05-12 11:43:48,930 INFO L231 Difference]: Finished difference. Result has 102 places, 136 transitions, 1238 flow [2024-05-12 11:43:48,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1238, PETRI_PLACES=102, PETRI_TRANSITIONS=136} [2024-05-12 11:43:48,931 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2024-05-12 11:43:48,931 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 136 transitions, 1238 flow [2024-05-12 11:43:48,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:48,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:48,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:48,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:43:48,932 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:43:48,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1971997625, now seen corresponding path program 3 times [2024-05-12 11:43:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:48,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072988521] [2024-05-12 11:43:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:01,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072988521] [2024-05-12 11:44:01,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072988521] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:01,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:01,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:44:01,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565278305] [2024-05-12 11:44:01,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:01,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:44:01,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:01,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:44:01,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:44:01,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:44:01,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 136 transitions, 1238 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:01,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:01,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:44:01,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:04,367 INFO L124 PetriNetUnfolderBase]: 6172/9818 cut-off events. [2024-05-12 11:44:04,368 INFO L125 PetriNetUnfolderBase]: For 86220/86238 co-relation queries the response was YES. [2024-05-12 11:44:04,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42230 conditions, 9818 events. 6172/9818 cut-off events. For 86220/86238 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 62748 event pairs, 2546 based on Foata normal form. 20/9568 useless extension candidates. Maximal degree in co-relation 42188. Up to 8619 conditions per place. [2024-05-12 11:44:04,433 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 128 selfloop transitions, 37 changer transitions 0/174 dead transitions. [2024-05-12 11:44:04,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 174 transitions, 1716 flow [2024-05-12 11:44:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:44:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:44:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 11:44:04,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484593837535014 [2024-05-12 11:44:04,435 INFO L175 Difference]: Start difference. First operand has 102 places, 136 transitions, 1238 flow. Second operand 7 states and 173 transitions. [2024-05-12 11:44:04,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 174 transitions, 1716 flow [2024-05-12 11:44:04,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 174 transitions, 1570 flow, removed 63 selfloop flow, removed 2 redundant places. [2024-05-12 11:44:04,490 INFO L231 Difference]: Finished difference. Result has 107 places, 136 transitions, 1180 flow [2024-05-12 11:44:04,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1180, PETRI_PLACES=107, PETRI_TRANSITIONS=136} [2024-05-12 11:44:04,491 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 50 predicate places. [2024-05-12 11:44:04,491 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 136 transitions, 1180 flow [2024-05-12 11:44:04,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:04,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:04,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:04,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:44:04,492 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:44:04,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1636356593, now seen corresponding path program 1 times [2024-05-12 11:44:04,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:04,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767387942] [2024-05-12 11:44:04,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:04,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:24,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:24,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767387942] [2024-05-12 11:44:24,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767387942] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:24,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:24,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:44:24,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516182900] [2024-05-12 11:44:24,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:24,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:44:24,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:24,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:44:24,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:44:24,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:44:24,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 136 transitions, 1180 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:24,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:24,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:44:24,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:27,277 INFO L124 PetriNetUnfolderBase]: 5827/9747 cut-off events. [2024-05-12 11:44:27,277 INFO L125 PetriNetUnfolderBase]: For 88420/88490 co-relation queries the response was YES. [2024-05-12 11:44:27,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41118 conditions, 9747 events. 5827/9747 cut-off events. For 88420/88490 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 65997 event pairs, 2502 based on Foata normal form. 7/9380 useless extension candidates. Maximal degree in co-relation 41074. Up to 8275 conditions per place. [2024-05-12 11:44:27,339 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 127 selfloop transitions, 14 changer transitions 0/155 dead transitions. [2024-05-12 11:44:27,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 155 transitions, 1536 flow [2024-05-12 11:44:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:44:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:44:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-05-12 11:44:27,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48627450980392156 [2024-05-12 11:44:27,341 INFO L175 Difference]: Start difference. First operand has 107 places, 136 transitions, 1180 flow. Second operand 5 states and 124 transitions. [2024-05-12 11:44:27,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 155 transitions, 1536 flow [2024-05-12 11:44:27,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 155 transitions, 1448 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 11:44:27,386 INFO L231 Difference]: Finished difference. Result has 106 places, 139 transitions, 1158 flow [2024-05-12 11:44:27,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1158, PETRI_PLACES=106, PETRI_TRANSITIONS=139} [2024-05-12 11:44:27,387 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 49 predicate places. [2024-05-12 11:44:27,387 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 139 transitions, 1158 flow [2024-05-12 11:44:27,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:27,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:27,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:27,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:44:27,388 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:44:27,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:27,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1422075311, now seen corresponding path program 1 times [2024-05-12 11:44:27,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:27,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985773451] [2024-05-12 11:44:27,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:27,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:40,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985773451] [2024-05-12 11:44:40,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985773451] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:40,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:40,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:44:40,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687200954] [2024-05-12 11:44:40,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:40,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:44:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:40,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:44:40,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:44:40,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:44:40,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 139 transitions, 1158 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:40,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:40,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:44:40,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:43,952 INFO L124 PetriNetUnfolderBase]: 5859/9472 cut-off events. [2024-05-12 11:44:43,952 INFO L125 PetriNetUnfolderBase]: For 93642/93702 co-relation queries the response was YES. [2024-05-12 11:44:43,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42032 conditions, 9472 events. 5859/9472 cut-off events. For 93642/93702 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 61674 event pairs, 2432 based on Foata normal form. 10/9206 useless extension candidates. Maximal degree in co-relation 41987. Up to 8234 conditions per place. [2024-05-12 11:44:44,015 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 133 selfloop transitions, 37 changer transitions 0/184 dead transitions. [2024-05-12 11:44:44,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 184 transitions, 1702 flow [2024-05-12 11:44:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:44:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:44:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-05-12 11:44:44,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154061624649859 [2024-05-12 11:44:44,017 INFO L175 Difference]: Start difference. First operand has 106 places, 139 transitions, 1158 flow. Second operand 7 states and 184 transitions. [2024-05-12 11:44:44,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 184 transitions, 1702 flow [2024-05-12 11:44:44,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 184 transitions, 1588 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-05-12 11:44:44,073 INFO L231 Difference]: Finished difference. Result has 111 places, 148 transitions, 1261 flow [2024-05-12 11:44:44,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1261, PETRI_PLACES=111, PETRI_TRANSITIONS=148} [2024-05-12 11:44:44,074 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 54 predicate places. [2024-05-12 11:44:44,074 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 148 transitions, 1261 flow [2024-05-12 11:44:44,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:44,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:44,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:44,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:44:44,075 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:44:44,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:44,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1421983985, now seen corresponding path program 1 times [2024-05-12 11:44:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576905456] [2024-05-12 11:44:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:44,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:58,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:58,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576905456] [2024-05-12 11:44:58,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576905456] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:58,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:58,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:44:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510204199] [2024-05-12 11:44:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:58,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:44:58,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:58,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:44:58,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:44:58,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:44:58,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 148 transitions, 1261 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-05-12 11:44:58,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:58,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:44:58,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:01,862 INFO L124 PetriNetUnfolderBase]: 6212/9850 cut-off events. [2024-05-12 11:45:01,863 INFO L125 PetriNetUnfolderBase]: For 100334/100334 co-relation queries the response was YES. [2024-05-12 11:45:01,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44445 conditions, 9850 events. 6212/9850 cut-off events. For 100334/100334 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 62425 event pairs, 2570 based on Foata normal form. 4/9596 useless extension candidates. Maximal degree in co-relation 44398. Up to 8687 conditions per place. [2024-05-12 11:45:01,929 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 150 selfloop transitions, 37 changer transitions 0/196 dead transitions. [2024-05-12 11:45:01,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 196 transitions, 1819 flow [2024-05-12 11:45:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:45:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:45:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-05-12 11:45:01,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49264705882352944 [2024-05-12 11:45:01,932 INFO L175 Difference]: Start difference. First operand has 111 places, 148 transitions, 1261 flow. Second operand 8 states and 201 transitions. [2024-05-12 11:45:01,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 196 transitions, 1819 flow [2024-05-12 11:45:01,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 196 transitions, 1763 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-05-12 11:45:01,985 INFO L231 Difference]: Finished difference. Result has 116 places, 152 transitions, 1354 flow [2024-05-12 11:45:01,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1354, PETRI_PLACES=116, PETRI_TRANSITIONS=152} [2024-05-12 11:45:01,985 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 59 predicate places. [2024-05-12 11:45:01,985 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 152 transitions, 1354 flow [2024-05-12 11:45:01,986 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-05-12 11:45:01,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:01,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:01,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:45:01,986 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:45:01,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1123279023, now seen corresponding path program 2 times [2024-05-12 11:45:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:01,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82055721] [2024-05-12 11:45:01,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82055721] [2024-05-12 11:45:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82055721] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:15,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:15,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:45:15,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473713873] [2024-05-12 11:45:15,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:15,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:45:15,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:15,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:45:15,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:45:15,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:45:15,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 152 transitions, 1354 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-05-12 11:45:15,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:15,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:45:15,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:18,688 INFO L124 PetriNetUnfolderBase]: 6338/10025 cut-off events. [2024-05-12 11:45:18,689 INFO L125 PetriNetUnfolderBase]: For 117536/117536 co-relation queries the response was YES. [2024-05-12 11:45:18,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47448 conditions, 10025 events. 6338/10025 cut-off events. For 117536/117536 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 63368 event pairs, 2513 based on Foata normal form. 4/9771 useless extension candidates. Maximal degree in co-relation 47400. Up to 8686 conditions per place. [2024-05-12 11:45:18,756 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 145 selfloop transitions, 61 changer transitions 0/215 dead transitions. [2024-05-12 11:45:18,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 215 transitions, 2281 flow [2024-05-12 11:45:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:45:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:45:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-05-12 11:45:18,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049019607843137 [2024-05-12 11:45:18,758 INFO L175 Difference]: Start difference. First operand has 116 places, 152 transitions, 1354 flow. Second operand 8 states and 206 transitions. [2024-05-12 11:45:18,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 215 transitions, 2281 flow [2024-05-12 11:45:18,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 215 transitions, 2162 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-05-12 11:45:18,820 INFO L231 Difference]: Finished difference. Result has 119 places, 168 transitions, 1646 flow [2024-05-12 11:45:18,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1646, PETRI_PLACES=119, PETRI_TRANSITIONS=168} [2024-05-12 11:45:18,821 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 62 predicate places. [2024-05-12 11:45:18,821 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 168 transitions, 1646 flow [2024-05-12 11:45:18,821 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-05-12 11:45:18,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:18,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:18,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:45:18,822 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:45:18,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:18,822 INFO L85 PathProgramCache]: Analyzing trace with hash -855027215, now seen corresponding path program 3 times [2024-05-12 11:45:18,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:18,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364086789] [2024-05-12 11:45:18,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:18,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:33,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:33,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364086789] [2024-05-12 11:45:33,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364086789] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:33,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:33,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:45:33,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863721159] [2024-05-12 11:45:33,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:33,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:45:33,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:33,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:45:33,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:45:33,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:45:33,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 168 transitions, 1646 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-05-12 11:45:33,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:33,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:45:33,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:36,690 INFO L124 PetriNetUnfolderBase]: 6328/10017 cut-off events. [2024-05-12 11:45:36,690 INFO L125 PetriNetUnfolderBase]: For 133372/133372 co-relation queries the response was YES. [2024-05-12 11:45:36,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49426 conditions, 10017 events. 6328/10017 cut-off events. For 133372/133372 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 63355 event pairs, 2501 based on Foata normal form. 4/9761 useless extension candidates. Maximal degree in co-relation 49376. Up to 8678 conditions per place. [2024-05-12 11:45:36,758 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 141 selfloop transitions, 63 changer transitions 0/213 dead transitions. [2024-05-12 11:45:36,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 213 transitions, 2264 flow [2024-05-12 11:45:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:45:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:45:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:45:36,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49754901960784315 [2024-05-12 11:45:36,760 INFO L175 Difference]: Start difference. First operand has 119 places, 168 transitions, 1646 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:45:36,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 213 transitions, 2264 flow [2024-05-12 11:45:36,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 213 transitions, 2128 flow, removed 54 selfloop flow, removed 3 redundant places. [2024-05-12 11:45:36,850 INFO L231 Difference]: Finished difference. Result has 124 places, 168 transitions, 1646 flow [2024-05-12 11:45:36,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1646, PETRI_PLACES=124, PETRI_TRANSITIONS=168} [2024-05-12 11:45:36,850 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 67 predicate places. [2024-05-12 11:45:36,851 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 168 transitions, 1646 flow [2024-05-12 11:45:36,851 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-05-12 11:45:36,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:36,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:36,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:45:36,851 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:45:36,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash -855026967, now seen corresponding path program 1 times [2024-05-12 11:45:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493790907] [2024-05-12 11:45:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493790907] [2024-05-12 11:45:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493790907] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:51,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:45:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582598895] [2024-05-12 11:45:51,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:51,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:45:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:45:51,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:45:51,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:45:51,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 168 transitions, 1646 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-05-12 11:45:51,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:51,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:45:51,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:54,814 INFO L124 PetriNetUnfolderBase]: 6354/10061 cut-off events. [2024-05-12 11:45:54,815 INFO L125 PetriNetUnfolderBase]: For 138866/138866 co-relation queries the response was YES. [2024-05-12 11:45:54,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49928 conditions, 10061 events. 6354/10061 cut-off events. For 138866/138866 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 63605 event pairs, 2498 based on Foata normal form. 2/9802 useless extension candidates. Maximal degree in co-relation 49876. Up to 8943 conditions per place. [2024-05-12 11:45:54,880 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 182 selfloop transitions, 25 changer transitions 0/216 dead transitions. [2024-05-12 11:45:54,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 216 transitions, 2286 flow [2024-05-12 11:45:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:45:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:45:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:45:54,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47794117647058826 [2024-05-12 11:45:54,882 INFO L175 Difference]: Start difference. First operand has 124 places, 168 transitions, 1646 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:45:54,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 216 transitions, 2286 flow [2024-05-12 11:45:54,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 216 transitions, 2144 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-05-12 11:45:54,944 INFO L231 Difference]: Finished difference. Result has 126 places, 171 transitions, 1632 flow [2024-05-12 11:45:54,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1632, PETRI_PLACES=126, PETRI_TRANSITIONS=171} [2024-05-12 11:45:54,945 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 69 predicate places. [2024-05-12 11:45:54,945 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 171 transitions, 1632 flow [2024-05-12 11:45:54,945 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-05-12 11:45:54,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:54,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:54,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:45:54,946 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:45:54,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash -185237563, now seen corresponding path program 2 times [2024-05-12 11:45:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488471082] [2024-05-12 11:45:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488471082] [2024-05-12 11:46:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488471082] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:08,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:08,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:46:08,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586166297] [2024-05-12 11:46:08,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:08,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:46:08,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:08,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:46:08,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:46:08,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:46:08,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 171 transitions, 1632 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-05-12 11:46:08,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:08,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:46:08,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:11,555 INFO L124 PetriNetUnfolderBase]: 6388/10132 cut-off events. [2024-05-12 11:46:11,555 INFO L125 PetriNetUnfolderBase]: For 152235/152257 co-relation queries the response was YES. [2024-05-12 11:46:11,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51441 conditions, 10132 events. 6388/10132 cut-off events. For 152235/152257 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 64472 event pairs, 2390 based on Foata normal form. 24/9899 useless extension candidates. Maximal degree in co-relation 51388. Up to 8829 conditions per place. [2024-05-12 11:46:11,625 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 167 selfloop transitions, 51 changer transitions 0/227 dead transitions. [2024-05-12 11:46:11,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 227 transitions, 2487 flow [2024-05-12 11:46:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:46:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:46:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-05-12 11:46:11,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2024-05-12 11:46:11,626 INFO L175 Difference]: Start difference. First operand has 126 places, 171 transitions, 1632 flow. Second operand 8 states and 200 transitions. [2024-05-12 11:46:11,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 227 transitions, 2487 flow [2024-05-12 11:46:11,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 227 transitions, 2402 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-05-12 11:46:11,726 INFO L231 Difference]: Finished difference. Result has 128 places, 177 transitions, 1787 flow [2024-05-12 11:46:11,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1787, PETRI_PLACES=128, PETRI_TRANSITIONS=177} [2024-05-12 11:46:11,727 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 71 predicate places. [2024-05-12 11:46:11,727 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 177 transitions, 1787 flow [2024-05-12 11:46:11,727 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-05-12 11:46:11,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:11,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:11,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:46:11,728 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:46:11,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1002385179, now seen corresponding path program 3 times [2024-05-12 11:46:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:11,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457881558] [2024-05-12 11:46:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:26,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:26,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457881558] [2024-05-12 11:46:26,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457881558] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:26,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:26,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:46:26,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269915599] [2024-05-12 11:46:26,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:26,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:46:26,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:26,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:46:26,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:46:26,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:46:26,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 177 transitions, 1787 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-05-12 11:46:26,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:26,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:46:26,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:30,044 INFO L124 PetriNetUnfolderBase]: 6414/10177 cut-off events. [2024-05-12 11:46:30,045 INFO L125 PetriNetUnfolderBase]: For 167186/167208 co-relation queries the response was YES. [2024-05-12 11:46:30,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53142 conditions, 10177 events. 6414/10177 cut-off events. For 167186/167208 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 64759 event pairs, 2400 based on Foata normal form. 24/9943 useless extension candidates. Maximal degree in co-relation 53088. Up to 8856 conditions per place. [2024-05-12 11:46:30,116 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 170 selfloop transitions, 51 changer transitions 0/230 dead transitions. [2024-05-12 11:46:30,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 230 transitions, 2596 flow [2024-05-12 11:46:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:46:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:46:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-05-12 11:46:30,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49264705882352944 [2024-05-12 11:46:30,118 INFO L175 Difference]: Start difference. First operand has 128 places, 177 transitions, 1787 flow. Second operand 8 states and 201 transitions. [2024-05-12 11:46:30,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 230 transitions, 2596 flow [2024-05-12 11:46:30,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 230 transitions, 2484 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-05-12 11:46:30,230 INFO L231 Difference]: Finished difference. Result has 132 places, 180 transitions, 1853 flow [2024-05-12 11:46:30,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1853, PETRI_PLACES=132, PETRI_TRANSITIONS=180} [2024-05-12 11:46:30,231 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 75 predicate places. [2024-05-12 11:46:30,231 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 180 transitions, 1853 flow [2024-05-12 11:46:30,231 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-05-12 11:46:30,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:30,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:30,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:46:30,232 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:46:30,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1351180173, now seen corresponding path program 4 times [2024-05-12 11:46:30,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:30,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768510586] [2024-05-12 11:46:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:30,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:43,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:43,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768510586] [2024-05-12 11:46:43,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768510586] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:43,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:43,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:46:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936005556] [2024-05-12 11:46:43,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:43,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:46:43,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:43,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:46:43,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:46:43,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:46:43,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 180 transitions, 1853 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-05-12 11:46:43,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:43,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:46:43,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:47,389 INFO L124 PetriNetUnfolderBase]: 6456/10254 cut-off events. [2024-05-12 11:46:47,389 INFO L125 PetriNetUnfolderBase]: For 174253/174259 co-relation queries the response was YES. [2024-05-12 11:46:47,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53946 conditions, 10254 events. 6456/10254 cut-off events. For 174253/174259 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 65363 event pairs, 2342 based on Foata normal form. 8/10001 useless extension candidates. Maximal degree in co-relation 53890. Up to 8662 conditions per place. [2024-05-12 11:46:47,475 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 148 selfloop transitions, 93 changer transitions 0/250 dead transitions. [2024-05-12 11:46:47,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 250 transitions, 3062 flow [2024-05-12 11:46:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:46:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:46:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-05-12 11:46:47,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049019607843137 [2024-05-12 11:46:47,477 INFO L175 Difference]: Start difference. First operand has 132 places, 180 transitions, 1853 flow. Second operand 8 states and 206 transitions. [2024-05-12 11:46:47,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 250 transitions, 3062 flow [2024-05-12 11:46:47,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 250 transitions, 2944 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-05-12 11:46:47,623 INFO L231 Difference]: Finished difference. Result has 137 places, 205 transitions, 2434 flow [2024-05-12 11:46:47,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2434, PETRI_PLACES=137, PETRI_TRANSITIONS=205} [2024-05-12 11:46:47,637 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 80 predicate places. [2024-05-12 11:46:47,637 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 205 transitions, 2434 flow [2024-05-12 11:46:47,637 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-05-12 11:46:47,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:47,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:47,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:46:47,638 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:46:47,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1273445067, now seen corresponding path program 4 times [2024-05-12 11:46:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:47,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668838377] [2024-05-12 11:46:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:47:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668838377] [2024-05-12 11:47:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668838377] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:47:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893714212] [2024-05-12 11:47:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:02,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:47:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:47:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:47:02,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:47:02,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 205 transitions, 2434 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-05-12 11:47:02,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:02,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:47:02,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:06,215 INFO L124 PetriNetUnfolderBase]: 6451/10233 cut-off events. [2024-05-12 11:47:06,216 INFO L125 PetriNetUnfolderBase]: For 195490/195512 co-relation queries the response was YES. [2024-05-12 11:47:06,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56614 conditions, 10233 events. 6451/10233 cut-off events. For 195490/195512 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 65076 event pairs, 2400 based on Foata normal form. 24/9994 useless extension candidates. Maximal degree in co-relation 56555. Up to 8909 conditions per place. [2024-05-12 11:47:06,420 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 191 selfloop transitions, 56 changer transitions 0/256 dead transitions. [2024-05-12 11:47:06,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 256 transitions, 3206 flow [2024-05-12 11:47:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:47:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:47:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-05-12 11:47:06,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2024-05-12 11:47:06,422 INFO L175 Difference]: Start difference. First operand has 137 places, 205 transitions, 2434 flow. Second operand 8 states and 200 transitions. [2024-05-12 11:47:06,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 256 transitions, 3206 flow [2024-05-12 11:47:06,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 256 transitions, 2978 flow, removed 102 selfloop flow, removed 2 redundant places. [2024-05-12 11:47:06,548 INFO L231 Difference]: Finished difference. Result has 143 places, 205 transitions, 2347 flow [2024-05-12 11:47:06,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2347, PETRI_PLACES=143, PETRI_TRANSITIONS=205} [2024-05-12 11:47:06,549 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places. [2024-05-12 11:47:06,549 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 205 transitions, 2347 flow [2024-05-12 11:47:06,550 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-05-12 11:47:06,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:06,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:47:06,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:47:06,551 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:47:06,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:06,551 INFO L85 PathProgramCache]: Analyzing trace with hash -185246181, now seen corresponding path program 5 times [2024-05-12 11:47:06,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:06,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088683431] [2024-05-12 11:47:06,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:06,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:47:21,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088683431] [2024-05-12 11:47:21,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088683431] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:21,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:21,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:47:21,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264512574] [2024-05-12 11:47:21,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:21,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:47:21,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:21,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:47:21,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:47:22,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:47:22,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 205 transitions, 2347 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-05-12 11:47:22,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:22,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:47:22,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:25,480 INFO L124 PetriNetUnfolderBase]: 6496/10310 cut-off events. [2024-05-12 11:47:25,480 INFO L125 PetriNetUnfolderBase]: For 200944/200950 co-relation queries the response was YES. [2024-05-12 11:47:25,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57104 conditions, 10310 events. 6496/10310 cut-off events. For 200944/200950 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 65652 event pairs, 2318 based on Foata normal form. 8/10057 useless extension candidates. Maximal degree in co-relation 57043. Up to 8694 conditions per place. [2024-05-12 11:47:25,569 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 143 selfloop transitions, 104 changer transitions 0/256 dead transitions. [2024-05-12 11:47:25,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 256 transitions, 3183 flow [2024-05-12 11:47:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:47:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:47:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:47:25,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49754901960784315 [2024-05-12 11:47:25,571 INFO L175 Difference]: Start difference. First operand has 143 places, 205 transitions, 2347 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:47:25,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 256 transitions, 3183 flow [2024-05-12 11:47:25,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 256 transitions, 3007 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-05-12 11:47:25,719 INFO L231 Difference]: Finished difference. Result has 144 places, 213 transitions, 2506 flow [2024-05-12 11:47:25,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2506, PETRI_PLACES=144, PETRI_TRANSITIONS=213} [2024-05-12 11:47:25,719 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 87 predicate places. [2024-05-12 11:47:25,719 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 213 transitions, 2506 flow [2024-05-12 11:47:25,720 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-05-12 11:47:25,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:25,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:47:25,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:47:25,720 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:47:25,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:25,720 INFO L85 PathProgramCache]: Analyzing trace with hash -193520391, now seen corresponding path program 6 times [2024-05-12 11:47:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:25,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248296846] [2024-05-12 11:47:25,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:25,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:47:39,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248296846] [2024-05-12 11:47:39,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248296846] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:39,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:39,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:47:39,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874655944] [2024-05-12 11:47:39,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:39,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:47:39,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:39,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:47:39,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:47:39,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:47:39,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 213 transitions, 2506 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-05-12 11:47:39,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:39,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:47:39,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:42,932 INFO L124 PetriNetUnfolderBase]: 6486/10295 cut-off events. [2024-05-12 11:47:42,933 INFO L125 PetriNetUnfolderBase]: For 207417/207423 co-relation queries the response was YES. [2024-05-12 11:47:42,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57459 conditions, 10295 events. 6486/10295 cut-off events. For 207417/207423 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 65481 event pairs, 2340 based on Foata normal form. 8/10042 useless extension candidates. Maximal degree in co-relation 57396. Up to 8686 conditions per place. [2024-05-12 11:47:43,009 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 149 selfloop transitions, 99 changer transitions 0/257 dead transitions. [2024-05-12 11:47:43,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 257 transitions, 3246 flow [2024-05-12 11:47:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:47:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:47:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-05-12 11:47:43,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049019607843137 [2024-05-12 11:47:43,011 INFO L175 Difference]: Start difference. First operand has 144 places, 213 transitions, 2506 flow. Second operand 8 states and 206 transitions. [2024-05-12 11:47:43,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 257 transitions, 3246 flow [2024-05-12 11:47:43,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 257 transitions, 2979 flow, removed 61 selfloop flow, removed 4 redundant places. [2024-05-12 11:47:43,213 INFO L231 Difference]: Finished difference. Result has 148 places, 213 transitions, 2447 flow [2024-05-12 11:47:43,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2239, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2447, PETRI_PLACES=148, PETRI_TRANSITIONS=213} [2024-05-12 11:47:43,219 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 91 predicate places. [2024-05-12 11:47:43,219 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 213 transitions, 2447 flow [2024-05-12 11:47:43,220 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-05-12 11:47:43,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:43,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:47:43,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:47:43,220 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:47:43,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash -184938351, now seen corresponding path program 1 times [2024-05-12 11:47:43,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:43,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020810169] [2024-05-12 11:47:43,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:47:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:58,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020810169] [2024-05-12 11:47:58,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020810169] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:58,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:58,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:47:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101200157] [2024-05-12 11:47:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:58,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:47:58,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:58,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:47:58,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:47:59,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:47:59,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 213 transitions, 2447 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:47:59,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:59,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:47:59,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:48:02,941 INFO L124 PetriNetUnfolderBase]: 6479/10478 cut-off events. [2024-05-12 11:48:02,941 INFO L125 PetriNetUnfolderBase]: For 211307/211307 co-relation queries the response was YES. [2024-05-12 11:48:02,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57261 conditions, 10478 events. 6479/10478 cut-off events. For 211307/211307 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 68151 event pairs, 2406 based on Foata normal form. 2/10166 useless extension candidates. Maximal degree in co-relation 57197. Up to 9117 conditions per place. [2024-05-12 11:48:03,027 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 225 selfloop transitions, 40 changer transitions 0/274 dead transitions. [2024-05-12 11:48:03,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 274 transitions, 3378 flow [2024-05-12 11:48:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:48:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:48:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-05-12 11:48:03,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662309368191721 [2024-05-12 11:48:03,029 INFO L175 Difference]: Start difference. First operand has 148 places, 213 transitions, 2447 flow. Second operand 9 states and 214 transitions. [2024-05-12 11:48:03,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 274 transitions, 3378 flow [2024-05-12 11:48:03,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 274 transitions, 3213 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 11:48:03,234 INFO L231 Difference]: Finished difference. Result has 153 places, 230 transitions, 2665 flow [2024-05-12 11:48:03,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2665, PETRI_PLACES=153, PETRI_TRANSITIONS=230} [2024-05-12 11:48:03,235 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 96 predicate places. [2024-05-12 11:48:03,235 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 230 transitions, 2665 flow [2024-05-12 11:48:03,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:03,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:48:03,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:48:03,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:48:03,236 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:48:03,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:48:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash 812555114, now seen corresponding path program 1 times [2024-05-12 11:48:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:48:03,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861532393] [2024-05-12 11:48:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:48:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:48:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:48:22,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:22,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861532393] [2024-05-12 11:48:22,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861532393] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:22,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:22,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:48:22,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135275169] [2024-05-12 11:48:22,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:22,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:48:22,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:22,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:48:22,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:48:22,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:48:22,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 230 transitions, 2665 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-05-12 11:48:22,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:22,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:48:22,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:48:26,590 INFO L124 PetriNetUnfolderBase]: 7142/11563 cut-off events. [2024-05-12 11:48:26,590 INFO L125 PetriNetUnfolderBase]: For 254674/254771 co-relation queries the response was YES. [2024-05-12 11:48:26,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64306 conditions, 11563 events. 7142/11563 cut-off events. For 254674/254771 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 76110 event pairs, 2807 based on Foata normal form. 16/11221 useless extension candidates. Maximal degree in co-relation 64240. Up to 10008 conditions per place. [2024-05-12 11:48:26,685 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 211 selfloop transitions, 17 changer transitions 0/255 dead transitions. [2024-05-12 11:48:26,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 255 transitions, 3249 flow [2024-05-12 11:48:26,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:48:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:48:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-05-12 11:48:26,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2024-05-12 11:48:26,687 INFO L175 Difference]: Start difference. First operand has 153 places, 230 transitions, 2665 flow. Second operand 6 states and 141 transitions. [2024-05-12 11:48:26,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 255 transitions, 3249 flow [2024-05-12 11:48:26,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 255 transitions, 2801 flow, removed 129 selfloop flow, removed 6 redundant places. [2024-05-12 11:48:26,906 INFO L231 Difference]: Finished difference. Result has 153 places, 233 transitions, 2295 flow [2024-05-12 11:48:26,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2295, PETRI_PLACES=153, PETRI_TRANSITIONS=233} [2024-05-12 11:48:26,907 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 96 predicate places. [2024-05-12 11:48:26,907 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 233 transitions, 2295 flow [2024-05-12 11:48:26,907 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-05-12 11:48:26,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:48:26,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:48:26,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:48:26,908 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:48:26,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:48:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash -855318323, now seen corresponding path program 1 times [2024-05-12 11:48:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:48:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982744907] [2024-05-12 11:48:26,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:48:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:48:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:48:40,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:40,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982744907] [2024-05-12 11:48:40,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982744907] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:40,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:40,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:48:40,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327451060] [2024-05-12 11:48:40,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:40,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:48:40,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:40,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:48:40,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:48:40,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:48:40,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 233 transitions, 2295 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:40,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:40,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:48:40,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:48:44,969 INFO L124 PetriNetUnfolderBase]: 7324/11741 cut-off events. [2024-05-12 11:48:44,969 INFO L125 PetriNetUnfolderBase]: For 290701/290800 co-relation queries the response was YES. [2024-05-12 11:48:45,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68593 conditions, 11741 events. 7324/11741 cut-off events. For 290701/290800 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 77882 event pairs, 2200 based on Foata normal form. 18/11381 useless extension candidates. Maximal degree in co-relation 68525. Up to 10092 conditions per place. [2024-05-12 11:48:45,064 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 217 selfloop transitions, 36 changer transitions 0/283 dead transitions. [2024-05-12 11:48:45,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 283 transitions, 3009 flow [2024-05-12 11:48:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:48:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:48:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-05-12 11:48:45,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2024-05-12 11:48:45,066 INFO L175 Difference]: Start difference. First operand has 153 places, 233 transitions, 2295 flow. Second operand 8 states and 207 transitions. [2024-05-12 11:48:45,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 283 transitions, 3009 flow [2024-05-12 11:48:45,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 283 transitions, 2953 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-05-12 11:48:45,243 INFO L231 Difference]: Finished difference. Result has 158 places, 240 transitions, 2434 flow [2024-05-12 11:48:45,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2239, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2434, PETRI_PLACES=158, PETRI_TRANSITIONS=240} [2024-05-12 11:48:45,244 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 101 predicate places. [2024-05-12 11:48:45,244 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 240 transitions, 2434 flow [2024-05-12 11:48:45,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:45,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:48:45,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:48:45,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:48:45,245 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:48:45,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:48:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash -852575598, now seen corresponding path program 1 times [2024-05-12 11:48:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:48:45,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392283453] [2024-05-12 11:48:45,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:48:45,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:48:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:48:58,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:58,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392283453] [2024-05-12 11:48:58,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392283453] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:58,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:58,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:48:58,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947003918] [2024-05-12 11:48:58,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:58,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:48:58,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:48:58,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:48:59,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:48:59,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 240 transitions, 2434 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:48:59,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:59,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:48:59,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:03,266 INFO L124 PetriNetUnfolderBase]: 7678/12187 cut-off events. [2024-05-12 11:49:03,267 INFO L125 PetriNetUnfolderBase]: For 312795/312804 co-relation queries the response was YES. [2024-05-12 11:49:03,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72844 conditions, 12187 events. 7678/12187 cut-off events. For 312795/312804 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 79918 event pairs, 2705 based on Foata normal form. 3/11810 useless extension candidates. Maximal degree in co-relation 72774. Up to 10647 conditions per place. [2024-05-12 11:49:03,384 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 232 selfloop transitions, 45 changer transitions 0/288 dead transitions. [2024-05-12 11:49:03,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 288 transitions, 3198 flow [2024-05-12 11:49:03,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:49:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:49:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-05-12 11:49:03,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950980392156863 [2024-05-12 11:49:03,386 INFO L175 Difference]: Start difference. First operand has 158 places, 240 transitions, 2434 flow. Second operand 8 states and 202 transitions. [2024-05-12 11:49:03,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 288 transitions, 3198 flow [2024-05-12 11:49:03,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 288 transitions, 2985 flow, removed 75 selfloop flow, removed 5 redundant places. [2024-05-12 11:49:03,653 INFO L231 Difference]: Finished difference. Result has 161 places, 244 transitions, 2413 flow [2024-05-12 11:49:03,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2413, PETRI_PLACES=161, PETRI_TRANSITIONS=244} [2024-05-12 11:49:03,654 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 104 predicate places. [2024-05-12 11:49:03,654 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 244 transitions, 2413 flow [2024-05-12 11:49:03,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:03,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:03,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:49:03,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 11:49:03,655 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:49:03,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:03,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1134660919, now seen corresponding path program 2 times [2024-05-12 11:49:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:03,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325030991] [2024-05-12 11:49:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:03,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:49:17,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:17,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325030991] [2024-05-12 11:49:17,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325030991] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:17,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:17,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:49:17,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854385195] [2024-05-12 11:49:17,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:17,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:49:17,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:17,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:49:17,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:49:18,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:49:18,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 244 transitions, 2413 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:18,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:18,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:49:18,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:22,264 INFO L124 PetriNetUnfolderBase]: 7350/11776 cut-off events. [2024-05-12 11:49:22,265 INFO L125 PetriNetUnfolderBase]: For 323759/323864 co-relation queries the response was YES. [2024-05-12 11:49:22,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70700 conditions, 11776 events. 7350/11776 cut-off events. For 323759/323864 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 78106 event pairs, 2596 based on Foata normal form. 23/11423 useless extension candidates. Maximal degree in co-relation 70629. Up to 10125 conditions per place. [2024-05-12 11:49:22,377 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 220 selfloop transitions, 40 changer transitions 0/291 dead transitions. [2024-05-12 11:49:22,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 291 transitions, 3141 flow [2024-05-12 11:49:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:49:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:49:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-05-12 11:49:22,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2024-05-12 11:49:22,388 INFO L175 Difference]: Start difference. First operand has 161 places, 244 transitions, 2413 flow. Second operand 8 states and 208 transitions. [2024-05-12 11:49:22,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 291 transitions, 3141 flow [2024-05-12 11:49:22,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 291 transitions, 3049 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 11:49:22,617 INFO L231 Difference]: Finished difference. Result has 163 places, 247 transitions, 2496 flow [2024-05-12 11:49:22,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2496, PETRI_PLACES=163, PETRI_TRANSITIONS=247} [2024-05-12 11:49:22,617 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 106 predicate places. [2024-05-12 11:49:22,618 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 247 transitions, 2496 flow [2024-05-12 11:49:22,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:22,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:22,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:49:22,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 11:49:22,618 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:49:22,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1021007107, now seen corresponding path program 1 times [2024-05-12 11:49:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:22,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675814763] [2024-05-12 11:49:22,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:22,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:49:35,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:35,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675814763] [2024-05-12 11:49:35,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675814763] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:35,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:35,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:49:35,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228477556] [2024-05-12 11:49:35,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:35,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:49:35,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:49:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:49:36,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:49:36,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 247 transitions, 2496 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:36,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:36,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:49:36,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:40,478 INFO L124 PetriNetUnfolderBase]: 7736/12225 cut-off events. [2024-05-12 11:49:40,479 INFO L125 PetriNetUnfolderBase]: For 350227/350236 co-relation queries the response was YES. [2024-05-12 11:49:40,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74907 conditions, 12225 events. 7736/12225 cut-off events. For 350227/350236 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 79624 event pairs, 2648 based on Foata normal form. 5/11870 useless extension candidates. Maximal degree in co-relation 74835. Up to 10718 conditions per place. [2024-05-12 11:49:40,593 INFO L140 encePairwiseOnDemand]: 36/51 looper letters, 251 selfloop transitions, 41 changer transitions 0/303 dead transitions. [2024-05-12 11:49:40,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 303 transitions, 3334 flow [2024-05-12 11:49:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:49:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:49:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-05-12 11:49:40,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2024-05-12 11:49:40,595 INFO L175 Difference]: Start difference. First operand has 163 places, 247 transitions, 2496 flow. Second operand 9 states and 225 transitions. [2024-05-12 11:49:40,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 303 transitions, 3334 flow [2024-05-12 11:49:40,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 303 transitions, 3185 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-05-12 11:49:40,840 INFO L231 Difference]: Finished difference. Result has 166 places, 251 transitions, 2540 flow [2024-05-12 11:49:40,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2347, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2540, PETRI_PLACES=166, PETRI_TRANSITIONS=251} [2024-05-12 11:49:40,840 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 109 predicate places. [2024-05-12 11:49:40,841 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 251 transitions, 2540 flow [2024-05-12 11:49:40,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:40,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:40,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:49:40,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 11:49:40,841 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:49:40,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1015442917, now seen corresponding path program 2 times [2024-05-12 11:49:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:40,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020398279] [2024-05-12 11:49:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:49:54,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020398279] [2024-05-12 11:49:54,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020398279] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:54,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:54,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:49:54,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952262130] [2024-05-12 11:49:54,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:54,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:49:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:54,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:49:54,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:49:55,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:49:55,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 251 transitions, 2540 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:55,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:55,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:49:55,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:59,412 INFO L124 PetriNetUnfolderBase]: 8056/12758 cut-off events. [2024-05-12 11:49:59,413 INFO L125 PetriNetUnfolderBase]: For 398308/398309 co-relation queries the response was YES. [2024-05-12 11:49:59,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81215 conditions, 12758 events. 8056/12758 cut-off events. For 398308/398309 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 83620 event pairs, 2443 based on Foata normal form. 5/12385 useless extension candidates. Maximal degree in co-relation 81142. Up to 10695 conditions per place. [2024-05-12 11:49:59,532 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 232 selfloop transitions, 81 changer transitions 0/324 dead transitions. [2024-05-12 11:49:59,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 324 transitions, 3963 flow [2024-05-12 11:49:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:49:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:49:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-05-12 11:49:59,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076252723311547 [2024-05-12 11:49:59,534 INFO L175 Difference]: Start difference. First operand has 166 places, 251 transitions, 2540 flow. Second operand 9 states and 233 transitions. [2024-05-12 11:49:59,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 324 transitions, 3963 flow [2024-05-12 11:49:59,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 324 transitions, 3800 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-05-12 11:49:59,811 INFO L231 Difference]: Finished difference. Result has 170 places, 267 transitions, 2959 flow [2024-05-12 11:49:59,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2377, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2959, PETRI_PLACES=170, PETRI_TRANSITIONS=267} [2024-05-12 11:49:59,811 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 113 predicate places. [2024-05-12 11:49:59,812 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 267 transitions, 2959 flow [2024-05-12 11:49:59,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:49:59,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:59,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:49:59,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 11:49:59,812 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:49:59,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1015435477, now seen corresponding path program 3 times [2024-05-12 11:49:59,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:59,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291492359] [2024-05-12 11:49:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:50:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:50:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:50:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291492359] [2024-05-12 11:50:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291492359] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:50:13,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:50:13,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:50:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036054937] [2024-05-12 11:50:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:50:13,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:50:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:50:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:50:13,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:50:13,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:50:13,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 267 transitions, 2959 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:13,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:50:13,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:50:13,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:17,766 INFO L124 PetriNetUnfolderBase]: 8042/12732 cut-off events. [2024-05-12 11:50:17,766 INFO L125 PetriNetUnfolderBase]: For 433963/433974 co-relation queries the response was YES. [2024-05-12 11:50:17,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84734 conditions, 12732 events. 8042/12732 cut-off events. For 433963/433974 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 83537 event pairs, 2439 based on Foata normal form. 9/12357 useless extension candidates. Maximal degree in co-relation 84658. Up to 10691 conditions per place. [2024-05-12 11:50:17,880 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 228 selfloop transitions, 83 changer transitions 0/322 dead transitions. [2024-05-12 11:50:17,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 322 transitions, 3906 flow [2024-05-12 11:50:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:50:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:50:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-05-12 11:50:17,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010893246187363 [2024-05-12 11:50:17,882 INFO L175 Difference]: Start difference. First operand has 170 places, 267 transitions, 2959 flow. Second operand 9 states and 230 transitions. [2024-05-12 11:50:17,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 322 transitions, 3906 flow [2024-05-12 11:50:18,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 322 transitions, 3653 flow, removed 101 selfloop flow, removed 4 redundant places. [2024-05-12 11:50:18,272 INFO L231 Difference]: Finished difference. Result has 175 places, 267 transitions, 2883 flow [2024-05-12 11:50:18,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2706, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2883, PETRI_PLACES=175, PETRI_TRANSITIONS=267} [2024-05-12 11:50:18,272 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 118 predicate places. [2024-05-12 11:50:18,273 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 267 transitions, 2883 flow [2024-05-12 11:50:18,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:18,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:18,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:50:18,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 11:50:18,273 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:50:18,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1015650679, now seen corresponding path program 3 times [2024-05-12 11:50:18,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:18,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141805367] [2024-05-12 11:50:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:50:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:50:34,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:50:34,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141805367] [2024-05-12 11:50:34,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141805367] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:50:34,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:50:34,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:50:34,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118293514] [2024-05-12 11:50:34,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:50:34,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:50:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:50:34,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:50:34,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:50:35,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:50:35,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 267 transitions, 2883 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:35,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:50:35,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:50:35,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:39,855 INFO L124 PetriNetUnfolderBase]: 7674/12328 cut-off events. [2024-05-12 11:50:39,856 INFO L125 PetriNetUnfolderBase]: For 438016/438147 co-relation queries the response was YES. [2024-05-12 11:50:39,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82425 conditions, 12328 events. 7674/12328 cut-off events. For 438016/438147 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 82476 event pairs, 2395 based on Foata normal form. 34/11941 useless extension candidates. Maximal degree in co-relation 82347. Up to 10545 conditions per place. [2024-05-12 11:50:39,989 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 234 selfloop transitions, 48 changer transitions 0/313 dead transitions. [2024-05-12 11:50:39,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 313 transitions, 3677 flow [2024-05-12 11:50:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:50:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:50:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-05-12 11:50:39,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049019607843137 [2024-05-12 11:50:39,995 INFO L175 Difference]: Start difference. First operand has 175 places, 267 transitions, 2883 flow. Second operand 8 states and 206 transitions. [2024-05-12 11:50:39,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 313 transitions, 3677 flow [2024-05-12 11:50:40,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 313 transitions, 3489 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-05-12 11:50:40,314 INFO L231 Difference]: Finished difference. Result has 176 places, 270 transitions, 2899 flow [2024-05-12 11:50:40,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2695, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2899, PETRI_PLACES=176, PETRI_TRANSITIONS=270} [2024-05-12 11:50:40,315 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 119 predicate places. [2024-05-12 11:50:40,315 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 270 transitions, 2899 flow [2024-05-12 11:50:40,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:40,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:40,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:50:40,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 11:50:40,316 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:50:40,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1015644727, now seen corresponding path program 4 times [2024-05-12 11:50:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:40,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830867215] [2024-05-12 11:50:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:50:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:50:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:50:52,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830867215] [2024-05-12 11:50:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830867215] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:50:52,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:50:52,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:50:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253544953] [2024-05-12 11:50:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:50:52,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:50:52,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:50:52,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:50:52,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:50:53,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:50:53,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 270 transitions, 2899 flow. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:53,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:50:53,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:50:53,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:56,343 INFO L124 PetriNetUnfolderBase]: 7115/11399 cut-off events. [2024-05-12 11:50:56,344 INFO L125 PetriNetUnfolderBase]: For 440636/440647 co-relation queries the response was YES. [2024-05-12 11:50:56,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78531 conditions, 11399 events. 7115/11399 cut-off events. For 440636/440647 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 75540 event pairs, 2685 based on Foata normal form. 5/11019 useless extension candidates. Maximal degree in co-relation 78452. Up to 9484 conditions per place. [2024-05-12 11:50:56,463 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 229 selfloop transitions, 82 changer transitions 0/323 dead transitions. [2024-05-12 11:50:56,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 323 transitions, 3932 flow [2024-05-12 11:50:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:50:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:50:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2024-05-12 11:50:56,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-05-12 11:50:56,479 INFO L175 Difference]: Start difference. First operand has 176 places, 270 transitions, 2899 flow. Second operand 8 states and 221 transitions. [2024-05-12 11:50:56,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 323 transitions, 3932 flow [2024-05-12 11:50:56,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 323 transitions, 3750 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-05-12 11:50:56,729 INFO L231 Difference]: Finished difference. Result has 178 places, 274 transitions, 2982 flow [2024-05-12 11:50:56,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2717, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2982, PETRI_PLACES=178, PETRI_TRANSITIONS=274} [2024-05-12 11:50:56,729 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 121 predicate places. [2024-05-12 11:50:56,729 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 274 transitions, 2982 flow [2024-05-12 11:50:56,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:50:56,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:56,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:50:56,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 11:50:56,730 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:50:56,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash -594894930, now seen corresponding path program 1 times [2024-05-12 11:50:56,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:56,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899134957] [2024-05-12 11:50:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:51:17,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-05-12 11:51:17,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:51:17,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899134957] [2024-05-12 11:51:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899134957] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:51:17,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:51:17,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:51:17,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491354448] [2024-05-12 11:51:17,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:51:17,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:51:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:51:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:51:17,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:51:17,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:51:17,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 274 transitions, 2982 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-05-12 11:51:17,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:51:17,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:51:17,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:51:22,138 INFO L124 PetriNetUnfolderBase]: 8173/13044 cut-off events. [2024-05-12 11:51:22,138 INFO L125 PetriNetUnfolderBase]: For 484345/484440 co-relation queries the response was YES. [2024-05-12 11:51:22,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86618 conditions, 13044 events. 8173/13044 cut-off events. For 484345/484440 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 85785 event pairs, 2660 based on Foata normal form. 32/12647 useless extension candidates. Maximal degree in co-relation 86539. Up to 11331 conditions per place. [2024-05-12 11:51:22,276 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 256 selfloop transitions, 26 changer transitions 0/311 dead transitions. [2024-05-12 11:51:22,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 311 transitions, 3886 flow [2024-05-12 11:51:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:51:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:51:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-05-12 11:51:22,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2024-05-12 11:51:22,279 INFO L175 Difference]: Start difference. First operand has 178 places, 274 transitions, 2982 flow. Second operand 6 states and 150 transitions. [2024-05-12 11:51:22,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 311 transitions, 3886 flow [2024-05-12 11:51:22,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 311 transitions, 3699 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-05-12 11:51:22,660 INFO L231 Difference]: Finished difference. Result has 179 places, 280 transitions, 2949 flow [2024-05-12 11:51:22,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2795, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2949, PETRI_PLACES=179, PETRI_TRANSITIONS=280} [2024-05-12 11:51:22,661 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 122 predicate places. [2024-05-12 11:51:22,661 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 280 transitions, 2949 flow [2024-05-12 11:51:22,661 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-05-12 11:51:22,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:51:22,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:51:22,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 11:51:22,662 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:51:22,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:51:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1063092601, now seen corresponding path program 4 times [2024-05-12 11:51:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:51:22,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605277336] [2024-05-12 11:51:22,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:51:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:51:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:51:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:51:36,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:51:36,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605277336] [2024-05-12 11:51:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605277336] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:51:36,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:51:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:51:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151249666] [2024-05-12 11:51:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:51:36,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:51:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:51:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:51:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:51:36,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:51:36,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 280 transitions, 2949 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:51:36,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:51:36,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:51:36,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:51:40,903 INFO L124 PetriNetUnfolderBase]: 7657/12206 cut-off events. [2024-05-12 11:51:40,903 INFO L125 PetriNetUnfolderBase]: For 487942/488030 co-relation queries the response was YES. [2024-05-12 11:51:40,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84582 conditions, 12206 events. 7657/12206 cut-off events. For 487942/488030 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 80713 event pairs, 2168 based on Foata normal form. 10/11859 useless extension candidates. Maximal degree in co-relation 84501. Up to 10427 conditions per place. [2024-05-12 11:51:41,064 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 231 selfloop transitions, 62 changer transitions 0/324 dead transitions. [2024-05-12 11:51:41,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 324 transitions, 3775 flow [2024-05-12 11:51:41,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:51:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:51:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-05-12 11:51:41,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024509803921569 [2024-05-12 11:51:41,066 INFO L175 Difference]: Start difference. First operand has 179 places, 280 transitions, 2949 flow. Second operand 8 states and 205 transitions. [2024-05-12 11:51:41,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 324 transitions, 3775 flow [2024-05-12 11:51:41,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 324 transitions, 3717 flow, removed 23 selfloop flow, removed 2 redundant places. [2024-05-12 11:51:41,527 INFO L231 Difference]: Finished difference. Result has 185 places, 283 transitions, 3129 flow [2024-05-12 11:51:41,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2891, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3129, PETRI_PLACES=185, PETRI_TRANSITIONS=283} [2024-05-12 11:51:41,528 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 128 predicate places. [2024-05-12 11:51:41,528 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 283 transitions, 3129 flow [2024-05-12 11:51:41,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:51:41,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:51:41,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:51:41,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 11:51:41,529 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:51:41,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:51:41,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1704365687, now seen corresponding path program 5 times [2024-05-12 11:51:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:51:41,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284633499] [2024-05-12 11:51:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:51:41,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:51:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:51:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:51:54,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:51:54,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284633499] [2024-05-12 11:51:54,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284633499] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:51:54,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:51:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:51:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116096330] [2024-05-12 11:51:54,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:51:54,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:51:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:51:54,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:51:54,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:51:54,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:51:54,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 283 transitions, 3129 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:51:54,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:51:54,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:51:54,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:51:59,186 INFO L124 PetriNetUnfolderBase]: 8169/12753 cut-off events. [2024-05-12 11:51:59,187 INFO L125 PetriNetUnfolderBase]: For 530398/530407 co-relation queries the response was YES. [2024-05-12 11:51:59,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90054 conditions, 12753 events. 8169/12753 cut-off events. For 530398/530407 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 82368 event pairs, 2310 based on Foata normal form. 11/12442 useless extension candidates. Maximal degree in co-relation 89971. Up to 10263 conditions per place. [2024-05-12 11:51:59,324 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 211 selfloop transitions, 143 changer transitions 0/365 dead transitions. [2024-05-12 11:51:59,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 365 transitions, 4985 flow [2024-05-12 11:51:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:51:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:51:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2024-05-12 11:51:59,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228758169934641 [2024-05-12 11:51:59,325 INFO L175 Difference]: Start difference. First operand has 185 places, 283 transitions, 3129 flow. Second operand 9 states and 240 transitions. [2024-05-12 11:51:59,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 365 transitions, 4985 flow [2024-05-12 11:51:59,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 365 transitions, 4771 flow, removed 47 selfloop flow, removed 6 redundant places. [2024-05-12 11:51:59,735 INFO L231 Difference]: Finished difference. Result has 190 places, 303 transitions, 3752 flow [2024-05-12 11:51:59,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2915, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3752, PETRI_PLACES=190, PETRI_TRANSITIONS=303} [2024-05-12 11:51:59,736 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 133 predicate places. [2024-05-12 11:51:59,736 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 303 transitions, 3752 flow [2024-05-12 11:51:59,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:51:59,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:51:59,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:51:59,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 11:51:59,737 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:51:59,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:51:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash -806384329, now seen corresponding path program 6 times [2024-05-12 11:51:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:51:59,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558654536] [2024-05-12 11:51:59,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:51:59,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:51:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:52:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:14,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558654536] [2024-05-12 11:52:14,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558654536] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:14,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:14,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:52:14,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591711927] [2024-05-12 11:52:14,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:14,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:52:14,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:14,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:52:14,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:52:14,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:52:14,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 303 transitions, 3752 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:52:14,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:14,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:52:14,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:19,257 INFO L124 PetriNetUnfolderBase]: 8386/13084 cut-off events. [2024-05-12 11:52:19,257 INFO L125 PetriNetUnfolderBase]: For 602666/602684 co-relation queries the response was YES. [2024-05-12 11:52:19,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98198 conditions, 13084 events. 8386/13084 cut-off events. For 602666/602684 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 84701 event pairs, 2328 based on Foata normal form. 10/12768 useless extension candidates. Maximal degree in co-relation 98112. Up to 10420 conditions per place. [2024-05-12 11:52:19,407 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 212 selfloop transitions, 156 changer transitions 0/379 dead transitions. [2024-05-12 11:52:19,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 379 transitions, 5635 flow [2024-05-12 11:52:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:52:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:52:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-05-12 11:52:19,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206971677559913 [2024-05-12 11:52:19,412 INFO L175 Difference]: Start difference. First operand has 190 places, 303 transitions, 3752 flow. Second operand 9 states and 239 transitions. [2024-05-12 11:52:19,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 379 transitions, 5635 flow [2024-05-12 11:52:19,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 379 transitions, 5166 flow, removed 149 selfloop flow, removed 5 redundant places. [2024-05-12 11:52:19,953 INFO L231 Difference]: Finished difference. Result has 195 places, 317 transitions, 4064 flow [2024-05-12 11:52:19,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3381, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4064, PETRI_PLACES=195, PETRI_TRANSITIONS=317} [2024-05-12 11:52:19,953 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 138 predicate places. [2024-05-12 11:52:19,953 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 317 transitions, 4064 flow [2024-05-12 11:52:19,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:52:19,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:19,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:52:19,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 11:52:19,954 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:19,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1447655927, now seen corresponding path program 7 times [2024-05-12 11:52:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:19,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036022153] [2024-05-12 11:52:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:52:32,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:32,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036022153] [2024-05-12 11:52:32,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036022153] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:32,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:32,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:52:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024702040] [2024-05-12 11:52:32,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:32,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:52:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:52:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:52:32,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:52:32,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 317 transitions, 4064 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:52:32,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:32,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:52:32,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:36,436 INFO L124 PetriNetUnfolderBase]: 7631/12045 cut-off events. [2024-05-12 11:52:36,437 INFO L125 PetriNetUnfolderBase]: For 588721/588729 co-relation queries the response was YES. [2024-05-12 11:52:36,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91965 conditions, 12045 events. 7631/12045 cut-off events. For 588721/588729 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 79005 event pairs, 2521 based on Foata normal form. 14/11710 useless extension candidates. Maximal degree in co-relation 91877. Up to 9418 conditions per place. [2024-05-12 11:52:36,602 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 210 selfloop transitions, 162 changer transitions 0/384 dead transitions. [2024-05-12 11:52:36,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 384 transitions, 5802 flow [2024-05-12 11:52:36,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:52:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:52:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 242 transitions. [2024-05-12 11:52:36,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272331154684096 [2024-05-12 11:52:36,604 INFO L175 Difference]: Start difference. First operand has 195 places, 317 transitions, 4064 flow. Second operand 9 states and 242 transitions. [2024-05-12 11:52:36,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 384 transitions, 5802 flow [2024-05-12 11:52:37,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 384 transitions, 5480 flow, removed 64 selfloop flow, removed 4 redundant places. [2024-05-12 11:52:37,399 INFO L231 Difference]: Finished difference. Result has 201 places, 327 transitions, 4353 flow [2024-05-12 11:52:37,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3760, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4353, PETRI_PLACES=201, PETRI_TRANSITIONS=327} [2024-05-12 11:52:37,400 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 144 predicate places. [2024-05-12 11:52:37,400 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 327 transitions, 4353 flow [2024-05-12 11:52:37,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:52:37,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:37,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:52:37,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 11:52:37,401 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:37,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1062884839, now seen corresponding path program 8 times [2024-05-12 11:52:37,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:37,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982841538] [2024-05-12 11:52:37,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:37,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:52:50,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982841538] [2024-05-12 11:52:50,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982841538] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:50,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:50,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:52:50,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534264874] [2024-05-12 11:52:50,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:50,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:52:50,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:50,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:52:50,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:52:50,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:52:50,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 327 transitions, 4353 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:52:50,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:50,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:52:50,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:55,072 INFO L124 PetriNetUnfolderBase]: 8649/13471 cut-off events. [2024-05-12 11:52:55,072 INFO L125 PetriNetUnfolderBase]: For 631820/631829 co-relation queries the response was YES. [2024-05-12 11:52:55,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100822 conditions, 13471 events. 8649/13471 cut-off events. For 631820/631829 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 87247 event pairs, 2226 based on Foata normal form. 11/13158 useless extension candidates. Maximal degree in co-relation 100732. Up to 10597 conditions per place. [2024-05-12 11:52:55,236 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 224 selfloop transitions, 161 changer transitions 0/396 dead transitions. [2024-05-12 11:52:55,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 396 transitions, 6159 flow [2024-05-12 11:52:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:52:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:52:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 244 transitions. [2024-05-12 11:52:55,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5315904139433552 [2024-05-12 11:52:55,237 INFO L175 Difference]: Start difference. First operand has 201 places, 327 transitions, 4353 flow. Second operand 9 states and 244 transitions. [2024-05-12 11:52:55,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 396 transitions, 6159 flow [2024-05-12 11:52:55,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 396 transitions, 5717 flow, removed 53 selfloop flow, removed 6 redundant places. [2024-05-12 11:52:55,834 INFO L231 Difference]: Finished difference. Result has 204 places, 331 transitions, 4352 flow [2024-05-12 11:52:55,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3917, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4352, PETRI_PLACES=204, PETRI_TRANSITIONS=331} [2024-05-12 11:52:55,835 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 147 predicate places. [2024-05-12 11:52:55,835 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 331 transitions, 4352 flow [2024-05-12 11:52:55,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:52:55,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:55,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:52:55,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 11:52:55,836 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:55,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:55,836 INFO L85 PathProgramCache]: Analyzing trace with hash -797180119, now seen corresponding path program 9 times [2024-05-12 11:52:55,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:55,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336870325] [2024-05-12 11:52:55,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:55,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:53:10,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:10,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336870325] [2024-05-12 11:53:10,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336870325] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:10,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:10,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:53:10,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649245438] [2024-05-12 11:53:10,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:10,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:53:10,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:10,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:53:10,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:53:10,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:53:10,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 331 transitions, 4352 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:10,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:10,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:53:10,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:15,304 INFO L124 PetriNetUnfolderBase]: 8585/13363 cut-off events. [2024-05-12 11:53:15,305 INFO L125 PetriNetUnfolderBase]: For 624733/624751 co-relation queries the response was YES. [2024-05-12 11:53:15,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97717 conditions, 13363 events. 8585/13363 cut-off events. For 624733/624751 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 86467 event pairs, 2294 based on Foata normal form. 14/13051 useless extension candidates. Maximal degree in co-relation 97627. Up to 10563 conditions per place. [2024-05-12 11:53:15,485 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 205 selfloop transitions, 175 changer transitions 0/391 dead transitions. [2024-05-12 11:53:15,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 391 transitions, 5692 flow [2024-05-12 11:53:15,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:53:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:53:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2024-05-12 11:53:15,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514161220043573 [2024-05-12 11:53:15,487 INFO L175 Difference]: Start difference. First operand has 204 places, 331 transitions, 4352 flow. Second operand 9 states and 236 transitions. [2024-05-12 11:53:15,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 391 transitions, 5692 flow [2024-05-12 11:53:16,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 391 transitions, 5090 flow, removed 80 selfloop flow, removed 8 redundant places. [2024-05-12 11:53:16,219 INFO L231 Difference]: Finished difference. Result has 205 places, 331 transitions, 4111 flow [2024-05-12 11:53:16,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3750, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4111, PETRI_PLACES=205, PETRI_TRANSITIONS=331} [2024-05-12 11:53:16,219 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 148 predicate places. [2024-05-12 11:53:16,219 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 331 transitions, 4111 flow [2024-05-12 11:53:16,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:16,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:16,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:53:16,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 11:53:16,220 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:16,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1062877399, now seen corresponding path program 10 times [2024-05-12 11:53:16,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:16,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515870382] [2024-05-12 11:53:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:16,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:53:30,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515870382] [2024-05-12 11:53:30,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515870382] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:30,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:30,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:53:30,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920541089] [2024-05-12 11:53:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:30,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:53:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:30,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:53:30,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:53:30,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:53:30,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 331 transitions, 4111 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:30,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:30,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:53:30,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:35,485 INFO L124 PetriNetUnfolderBase]: 8569/13325 cut-off events. [2024-05-12 11:53:35,485 INFO L125 PetriNetUnfolderBase]: For 621291/621310 co-relation queries the response was YES. [2024-05-12 11:53:35,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96457 conditions, 13325 events. 8569/13325 cut-off events. For 621291/621310 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 85964 event pairs, 2382 based on Foata normal form. 15/13017 useless extension candidates. Maximal degree in co-relation 96367. Up to 10556 conditions per place. [2024-05-12 11:53:35,666 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 222 selfloop transitions, 161 changer transitions 0/394 dead transitions. [2024-05-12 11:53:35,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 394 transitions, 5661 flow [2024-05-12 11:53:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:53:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:53:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2024-05-12 11:53:35,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5250544662309368 [2024-05-12 11:53:35,668 INFO L175 Difference]: Start difference. First operand has 205 places, 331 transitions, 4111 flow. Second operand 9 states and 241 transitions. [2024-05-12 11:53:35,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 394 transitions, 5661 flow [2024-05-12 11:53:36,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 394 transitions, 5238 flow, removed 54 selfloop flow, removed 8 redundant places. [2024-05-12 11:53:36,729 INFO L231 Difference]: Finished difference. Result has 206 places, 331 transitions, 4021 flow [2024-05-12 11:53:36,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3688, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4021, PETRI_PLACES=206, PETRI_TRANSITIONS=331} [2024-05-12 11:53:36,729 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 149 predicate places. [2024-05-12 11:53:36,730 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 331 transitions, 4021 flow [2024-05-12 11:53:36,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:36,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:36,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:53:36,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 11:53:36,730 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:36,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash -580610130, now seen corresponding path program 2 times [2024-05-12 11:53:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:36,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651988220] [2024-05-12 11:53:36,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:53:58,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651988220] [2024-05-12 11:53:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651988220] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:58,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:58,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:53:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508885826] [2024-05-12 11:53:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:58,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:53:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:53:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:53:58,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:53:58,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 331 transitions, 4021 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-05-12 11:53:58,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:58,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:53:58,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:03,261 INFO L124 PetriNetUnfolderBase]: 8851/13957 cut-off events. [2024-05-12 11:54:03,262 INFO L125 PetriNetUnfolderBase]: For 634807/634928 co-relation queries the response was YES. [2024-05-12 11:54:03,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95988 conditions, 13957 events. 8851/13957 cut-off events. For 634807/634928 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 90931 event pairs, 2772 based on Foata normal form. 56/13558 useless extension candidates. Maximal degree in co-relation 95898. Up to 12267 conditions per place. [2024-05-12 11:54:03,420 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 298 selfloop transitions, 26 changer transitions 0/353 dead transitions. [2024-05-12 11:54:03,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 353 transitions, 4789 flow [2024-05-12 11:54:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:54:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:54:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-05-12 11:54:03,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4673202614379085 [2024-05-12 11:54:03,422 INFO L175 Difference]: Start difference. First operand has 206 places, 331 transitions, 4021 flow. Second operand 6 states and 143 transitions. [2024-05-12 11:54:03,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 353 transitions, 4789 flow [2024-05-12 11:54:03,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 353 transitions, 4381 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-05-12 11:54:03,963 INFO L231 Difference]: Finished difference. Result has 204 places, 331 transitions, 3671 flow [2024-05-12 11:54:03,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3613, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3671, PETRI_PLACES=204, PETRI_TRANSITIONS=331} [2024-05-12 11:54:03,964 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 147 predicate places. [2024-05-12 11:54:03,964 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 331 transitions, 3671 flow [2024-05-12 11:54:03,964 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-05-12 11:54:03,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:03,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:03,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 11:54:03,964 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:03,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1604148387, now seen corresponding path program 1 times [2024-05-12 11:54:03,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:03,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061106553] [2024-05-12 11:54:03,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:03,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:54:22,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:22,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061106553] [2024-05-12 11:54:22,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061106553] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:22,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:22,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:54:22,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313285700] [2024-05-12 11:54:22,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:22,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:54:22,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:22,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:54:22,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:54:22,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:54:22,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 331 transitions, 3671 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:22,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:22,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:54:22,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15