./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.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_power.oepc_pso.oepc_rmo.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_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix033_power.oepc_pso.oepc_rmo.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:39:32,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:39:32,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:39:33,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:39:33,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:39:33,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:39:33,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:39:33,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:39:33,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:39:33,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:39:33,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:39:33,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:39:33,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:39:33,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:39:33,027 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:39:33,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:39:33,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:39:33,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:39:33,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:39:33,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:39:33,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:39:33,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:39:33,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:39:33,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:39:33,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:39:33,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:39:33,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:39:33,030 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:39:33,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:39:33,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:39:33,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:39:33,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:39:33,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:39:33,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:39:33,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:39:33,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:39:33,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:39:33,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:39:33,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:39:33,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:39:33,032 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:39:33,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:39:33,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:39:33,033 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:39:33,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:39:33,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:39:33,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:39:33,267 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:39:33,269 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:39:33,269 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_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-05-12 11:39:33,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:39:33,478 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:39:33,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 11:39:34,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:39:34,846 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:39:34,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 11:39:34,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d775cde/7b483751209d47d98fe01ee9da93b436/FLAG856ce38de [2024-05-12 11:39:34,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d775cde/7b483751209d47d98fe01ee9da93b436 [2024-05-12 11:39:34,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:39:34,869 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:39:34,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:39:34,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:39:34,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:39:34,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:39:33" (1/2) ... [2024-05-12 11:39:34,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cad3ddb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:39:34, skipping insertion in model container [2024-05-12 11:39:34,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:39:33" (1/2) ... [2024-05-12 11:39:34,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3a32bc60 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:39:34, skipping insertion in model container [2024-05-12 11:39:34,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:39:34" (2/2) ... [2024-05-12 11:39:34,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cad3ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:34, skipping insertion in model container [2024-05-12 11:39:34,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:39:34" (2/2) ... [2024-05-12 11:39:34,877 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:39:34,953 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:39:34,954 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ((((((((((((((((((((((! multithreaded || b$r_buff1_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 )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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 )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 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 )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 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 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 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)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! 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 || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || b$read_delayed == (_Bool)0) [2024-05-12 11:39:34,955 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] ((((((((((((((((((((((! multithreaded || b$r_buff1_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 )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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 )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 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 )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 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 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 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)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! 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 || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || b$read_delayed == (_Bool)0) [2024-05-12 11:39:34,956 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((! multithreaded || b$r_buff1_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 )b$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )b$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b$w_buff1) + (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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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 )b$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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 )b$flush_delayed >= 0LL) && (long long )a + (long long )b$mem_tmp >= 0LL) && (long long )a + (long long )b$r_buff0_thd0 >= 0LL) && (long long )a + (long long )b$r_buff0_thd2 >= 0LL) && (long long )a + (long long )b$r_buff0_thd3 >= 0LL) && (long long )a + (long long )b$r_buff1_thd0 >= 0LL) && (long long )a + (long long )b$r_buff1_thd2 >= 0LL) && (long long )a + (long long )b$r_buff1_thd3 >= 0LL) && (long long )a + (long long )b$read_delayed >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )b$flush_delayed >= 0LL) && (long long )b + (long long )b$mem_tmp >= 0LL) && (long long )b + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b + (long long )b$read_delayed >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff1 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 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 )b$flush_delayed + (long long )b$mem_tmp >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed + (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$flush_delayed + (long long )x >= 0LL) && (long long )b$flush_delayed + (long long )y >= 0LL) && (long long )b$flush_delayed + (long long )z >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp + (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff1 >= 0LL) && (long long )b$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )b$mem_tmp + (long long )x >= 0LL) && (long long )b$mem_tmp + (long long )y >= 0LL) && (long long )b$mem_tmp + (long long )z >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )b$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )x >= 0LL) && (long long )b$r_buff0_thd0 + (long long )y >= 0LL) && (long long )b$r_buff0_thd0 + (long long )z >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )x >= 0LL) && (long long )b$r_buff0_thd2 + (long long )y >= 0LL) && (long long )b$r_buff0_thd2 + (long long )z >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )x >= 0LL) && (long long )b$r_buff0_thd3 + (long long )y >= 0LL) && (long long )b$r_buff0_thd3 + (long long )z >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )x >= 0LL) && (long long )b$r_buff1_thd0 + (long long )y >= 0LL) && (long long )b$r_buff1_thd0 + (long long )z >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )x >= 0LL) && (long long )b$r_buff1_thd2 + (long long )y >= 0LL) && (long long )b$r_buff1_thd2 + (long long )z >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )x >= 0LL) && (long long )b$r_buff1_thd3 + (long long )y >= 0LL) && (long long )b$r_buff1_thd3 + (long long )z >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff1 >= 0LL) && (long long )b$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )b$read_delayed + (long long )x >= 0LL) && (long long )b$read_delayed + (long long )y >= 0LL) && (long long )b$read_delayed + (long long )z >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )b$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff1 + (long long )x >= 0LL) && (long long )b$w_buff1 + (long long )y >= 0LL) && (long long )b$w_buff1 + (long long )z >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$flush_delayed) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$mem_tmp) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL + (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff0_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd2 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$r_buff1_thd3 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) - (long long )b$read_delayed >= 0LL) && (0LL - (long long )b$r_buff1_thd3) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff0_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff0_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd0 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff0_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff0_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$r_buff1_thd1 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd0) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd2 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$r_buff1_thd3 >= 0LL) && (1LL - (long long )b$r_buff1_thd1) - (long long )b$read_delayed >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd2) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$r_buff1_thd3) - (long long )b$w_buff1 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff0 >= 0LL) && (1LL - (long long )b$read_delayed) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$r_buff1_thd1 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff0_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff0 >= 0LL) && (2LL - (long long )b$r_buff1_thd1) - (long long )b$w_buff1 >= 0LL) && (2LL - (long long )b$w_buff0) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )b$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )b$read_delayed >= 0LL) && (long long )a - (long long )b$r_buff0_thd0 >= 0LL) && (long long )a - (long long )b$r_buff0_thd2 >= 0LL) && (long long )a - (long long )b$r_buff0_thd3 >= 0LL) && (long long )a - (long long )b$r_buff1_thd0 >= 0LL) && (long long )a - (long long )b$r_buff1_thd2 >= 0LL) && (long long )a - (long long )b$r_buff1_thd3 >= 0LL) && (long long )a - (long long )b$read_delayed >= 0LL) && (long long )b - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b - (long long )b$read_delayed >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$flush_delayed - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$flush_delayed - (long long )b$read_delayed >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$mem_tmp - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$mem_tmp - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd0 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff1_thd2 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff1_thd3 - (long long )b$read_delayed >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 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 <= b$mem_tmp) && 0 <= b$w_buff0) && 0 <= b$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && b$mem_tmp <= 1) && b$w_buff0 <= 1) && b$w_buff1 <= 1) && y <= 1) && z <= 1) && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 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)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= b$w_buff1 && b$w_buff1 <= 1) && (b$w_buff1 == 0 || b$w_buff1 == 1)))) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! 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 || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= b$w_buff0 && b$w_buff0 <= 1) && (b$w_buff0 == 0 || b$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= b$mem_tmp && b$mem_tmp <= 1) && (b$mem_tmp == 0 || b$mem_tmp == 1)))) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || b$read_delayed == (_Bool)0) [2024-05-12 11:39:34,957 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:39:34,957 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-05-12 11:39:35,039 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:39:35,194 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_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-05-12 11:39:35,370 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:39:35,383 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:39:35,410 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_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:39:35,733 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:39:35,769 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:39:35,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35 WrapperNode [2024-05-12 11:39:35,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:39:35,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:39:35,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:39:35,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:39:35,776 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:39:35" (1/1) ... [2024-05-12 11:39:35,826 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:39:35" (1/1) ... [2024-05-12 11:39:35,956 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2024-05-12 11:39:35,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:39:35,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:39:35,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:39:35,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:39:35,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (1/1) ... [2024-05-12 11:39:35,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (1/1) ... [2024-05-12 11:39:35,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (1/1) ... [2024-05-12 11:39:36,034 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:39:36,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (1/1) ... [2024-05-12 11:39:36,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (1/1) ... [2024-05-12 11:39:36,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (1/1) ... [2024-05-12 11:39:36,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (1/1) ... [2024-05-12 11:39:36,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (1/1) ... [2024-05-12 11:39:36,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (1/1) ... [2024-05-12 11:39:36,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:39:36,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:39:36,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:39:36,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:39:36,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (1/1) ... [2024-05-12 11:39:36,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:39:36,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:39:36,161 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:39:36,164 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:39:36,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:39:36,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:39:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:39:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:39:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:39:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:39:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:39:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:39:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:39:36,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:39:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:39:36,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:39:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 11:39:36,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 11:39:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:39:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:39:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:39:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:39:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:39:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:39:36,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:39:36,196 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:39:36,340 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:39:36,341 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:39:37,835 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:39:37,835 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:39:38,218 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:39:38,219 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:39:38,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:39:38 BoogieIcfgContainer [2024-05-12 11:39:38,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:39:38,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:39:38,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:39:38,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:39:38,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:39:33" (1/4) ... [2024-05-12 11:39:38,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ae83da and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:39:38, skipping insertion in model container [2024-05-12 11:39:38,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:39:34" (2/4) ... [2024-05-12 11:39:38,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ae83da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:39:38, skipping insertion in model container [2024-05-12 11:39:38,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:39:35" (3/4) ... [2024-05-12 11:39:38,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ae83da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:39:38, skipping insertion in model container [2024-05-12 11:39:38,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:39:38" (4/4) ... [2024-05-12 11:39:38,228 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 11:39:38,241 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:39:38,241 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 11:39:38,241 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:39:38,368 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:39:38,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 51 transitions, 114 flow [2024-05-12 11:39:38,448 INFO L124 PetriNetUnfolderBase]: 1/48 cut-off events. [2024-05-12 11:39:38,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:39:38,452 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 4. 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:39:38,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 51 transitions, 114 flow [2024-05-12 11:39:38,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 105 flow [2024-05-12 11:39:38,460 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:39:38,465 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;@1ffc8669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:39:38,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 11:39:38,473 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:39:38,473 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:39:38,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:39:38,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:38,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:39:38,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:39:38,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1773869500, now seen corresponding path program 1 times [2024-05-12 11:39:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:38,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837724434] [2024-05-12 11:39:38,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:46,730 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:39:46,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:46,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837724434] [2024-05-12 11:39:46,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837724434] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:46,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:46,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:39:46,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517047176] [2024-05-12 11:39:46,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:46,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:39:46,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:39:46,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:39:46,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2024-05-12 11:39:46,858 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:39:46,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:46,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2024-05-12 11:39:46,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:49,084 INFO L124 PetriNetUnfolderBase]: 5249/7788 cut-off events. [2024-05-12 11:39:49,084 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-05-12 11:39:49,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15396 conditions, 7788 events. 5249/7788 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 46194 event pairs, 2987 based on Foata normal form. 295/7619 useless extension candidates. Maximal degree in co-relation 15381. Up to 7489 conditions per place. [2024-05-12 11:39:49,126 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 45 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2024-05-12 11:39:49,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 239 flow [2024-05-12 11:39:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:39:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:39:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-05-12 11:39:49,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6535947712418301 [2024-05-12 11:39:49,138 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 105 flow. Second operand 3 states and 100 transitions. [2024-05-12 11:39:49,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 239 flow [2024-05-12 11:39:49,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:39:49,146 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 137 flow [2024-05-12 11:39:49,148 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:39:49,150 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2024-05-12 11:39:49,151 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 137 flow [2024-05-12 11:39:49,151 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:39:49,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:49,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:39:49,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:39:49,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:39:49,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1773868654, now seen corresponding path program 1 times [2024-05-12 11:39:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:49,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621699194] [2024-05-12 11:39:49,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:49,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:49,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:49,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621699194] [2024-05-12 11:39:49,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621699194] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:49,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:49,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:39:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874290407] [2024-05-12 11:39:49,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:49,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:39:49,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:39:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:39:49,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 51 [2024-05-12 11:39:49,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:39:49,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:49,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 51 [2024-05-12 11:39:49,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:49,658 INFO L124 PetriNetUnfolderBase]: 932/1801 cut-off events. [2024-05-12 11:39:49,658 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-05-12 11:39:49,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 1801 events. 932/1801 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12156 event pairs, 418 based on Foata normal form. 0/1691 useless extension candidates. Maximal degree in co-relation 3472. Up to 1189 conditions per place. [2024-05-12 11:39:49,668 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 37 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2024-05-12 11:39:49,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 244 flow [2024-05-12 11:39:49,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:39:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:39:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-05-12 11:39:49,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2024-05-12 11:39:49,673 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 137 flow. Second operand 3 states and 118 transitions. [2024-05-12 11:39:49,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 244 flow [2024-05-12 11:39:49,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:39:49,676 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 130 flow [2024-05-12 11:39:49,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-05-12 11:39:49,681 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2024-05-12 11:39:49,681 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 130 flow [2024-05-12 11:39:49,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:39:49,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:49,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:49,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:39:49,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:39:49,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:49,684 INFO L85 PathProgramCache]: Analyzing trace with hash 413476290, now seen corresponding path program 1 times [2024-05-12 11:39:49,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:49,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461331710] [2024-05-12 11:39:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:55,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:55,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461331710] [2024-05-12 11:39:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461331710] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:55,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:55,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:39:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275843861] [2024-05-12 11:39:55,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:55,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:39:55,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:39:55,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:39:55,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2024-05-12 11:39:55,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:39:55,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:55,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2024-05-12 11:39:55,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:57,633 INFO L124 PetriNetUnfolderBase]: 4457/7229 cut-off events. [2024-05-12 11:39:57,633 INFO L125 PetriNetUnfolderBase]: For 1598/1598 co-relation queries the response was YES. [2024-05-12 11:39:57,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15206 conditions, 7229 events. 4457/7229 cut-off events. For 1598/1598 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 46551 event pairs, 2907 based on Foata normal form. 3/6924 useless extension candidates. Maximal degree in co-relation 15190. Up to 6358 conditions per place. [2024-05-12 11:39:57,670 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 53 selfloop transitions, 8 changer transitions 2/75 dead transitions. [2024-05-12 11:39:57,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 328 flow [2024-05-12 11:39:57,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:39:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:39:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-05-12 11:39:57,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2024-05-12 11:39:57,674 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 130 flow. Second operand 4 states and 123 transitions. [2024-05-12 11:39:57,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 328 flow [2024-05-12 11:39:57,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:39:57,677 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 191 flow [2024-05-12 11:39:57,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-05-12 11:39:57,678 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-05-12 11:39:57,678 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 191 flow [2024-05-12 11:39:57,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:39:57,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:57,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:57,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:39:57,679 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:39:57,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash -67135267, now seen corresponding path program 1 times [2024-05-12 11:39:57,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823405806] [2024-05-12 11:39:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:03,648 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:03,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:03,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823405806] [2024-05-12 11:40:03,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823405806] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:03,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:03,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:40:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174707952] [2024-05-12 11:40:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:03,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:40:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:03,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:40:03,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:40:03,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2024-05-12 11:40:03,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:03,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:03,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2024-05-12 11:40:03,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:05,536 INFO L124 PetriNetUnfolderBase]: 3850/6397 cut-off events. [2024-05-12 11:40:05,537 INFO L125 PetriNetUnfolderBase]: For 2677/2677 co-relation queries the response was YES. [2024-05-12 11:40:05,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14472 conditions, 6397 events. 3850/6397 cut-off events. For 2677/2677 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 41599 event pairs, 1911 based on Foata normal form. 5/6138 useless extension candidates. Maximal degree in co-relation 14454. Up to 5419 conditions per place. [2024-05-12 11:40:05,575 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 69 selfloop transitions, 18 changer transitions 0/99 dead transitions. [2024-05-12 11:40:05,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 507 flow [2024-05-12 11:40:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:40:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:40:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2024-05-12 11:40:05,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.615686274509804 [2024-05-12 11:40:05,577 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 191 flow. Second operand 5 states and 157 transitions. [2024-05-12 11:40:05,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 507 flow [2024-05-12 11:40:05,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 496 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 11:40:05,580 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 305 flow [2024-05-12 11:40:05,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2024-05-12 11:40:05,581 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2024-05-12 11:40:05,581 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 305 flow [2024-05-12 11:40:05,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:05,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:05,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:05,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:40:05,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:05,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:05,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2081191615, now seen corresponding path program 1 times [2024-05-12 11:40:05,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:05,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894572425] [2024-05-12 11:40:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:11,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:40:11,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:11,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894572425] [2024-05-12 11:40:11,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894572425] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:11,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:11,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:40:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474862531] [2024-05-12 11:40:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:11,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:40:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:11,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:40:11,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:40:12,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2024-05-12 11:40:12,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:12,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:12,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2024-05-12 11:40:12,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:14,072 INFO L124 PetriNetUnfolderBase]: 3872/5930 cut-off events. [2024-05-12 11:40:14,074 INFO L125 PetriNetUnfolderBase]: For 6439/6441 co-relation queries the response was YES. [2024-05-12 11:40:14,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16327 conditions, 5930 events. 3872/5930 cut-off events. For 6439/6441 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 35084 event pairs, 1400 based on Foata normal form. 7/5844 useless extension candidates. Maximal degree in co-relation 16305. Up to 5385 conditions per place. [2024-05-12 11:40:14,101 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 81 selfloop transitions, 33 changer transitions 0/126 dead transitions. [2024-05-12 11:40:14,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 126 transitions, 765 flow [2024-05-12 11:40:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:40:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:40:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-05-12 11:40:14,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-05-12 11:40:14,104 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 305 flow. Second operand 6 states and 187 transitions. [2024-05-12 11:40:14,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 126 transitions, 765 flow [2024-05-12 11:40:14,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 757 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-05-12 11:40:14,109 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 515 flow [2024-05-12 11:40:14,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2024-05-12 11:40:14,110 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2024-05-12 11:40:14,110 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 515 flow [2024-05-12 11:40:14,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:14,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:14,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:14,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:40:14,110 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:14,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash -92428932, now seen corresponding path program 1 times [2024-05-12 11:40:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:14,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608342044] [2024-05-12 11:40:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:20,770 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:20,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:20,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608342044] [2024-05-12 11:40:20,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608342044] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:20,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:20,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:40:20,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924074188] [2024-05-12 11:40:20,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:20,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:40:20,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:20,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:40:20,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:40:20,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2024-05-12 11:40:20,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 515 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:20,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:20,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2024-05-12 11:40:20,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:23,164 INFO L124 PetriNetUnfolderBase]: 3899/5971 cut-off events. [2024-05-12 11:40:23,165 INFO L125 PetriNetUnfolderBase]: For 12828/12832 co-relation queries the response was YES. [2024-05-12 11:40:23,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19109 conditions, 5971 events. 3899/5971 cut-off events. For 12828/12832 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 35219 event pairs, 1053 based on Foata normal form. 14/5892 useless extension candidates. Maximal degree in co-relation 19081. Up to 5350 conditions per place. [2024-05-12 11:40:23,201 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 88 selfloop transitions, 36 changer transitions 0/136 dead transitions. [2024-05-12 11:40:23,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 136 transitions, 961 flow [2024-05-12 11:40:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:40:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:40:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2024-05-12 11:40:23,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5938375350140056 [2024-05-12 11:40:23,203 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 515 flow. Second operand 7 states and 212 transitions. [2024-05-12 11:40:23,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 136 transitions, 961 flow [2024-05-12 11:40:23,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 136 transitions, 927 flow, removed 17 selfloop flow, removed 0 redundant places. [2024-05-12 11:40:23,213 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 585 flow [2024-05-12 11:40:23,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=585, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2024-05-12 11:40:23,213 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-05-12 11:40:23,214 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 585 flow [2024-05-12 11:40:23,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:23,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:23,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:23,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:40:23,214 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:23,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1159897187, now seen corresponding path program 1 times [2024-05-12 11:40:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:23,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073305445] [2024-05-12 11:40:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:37,459 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:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073305445] [2024-05-12 11:40:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073305445] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:37,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:40:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048019614] [2024-05-12 11:40:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:37,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:40:37,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:37,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:40:37,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:40:37,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:40:37,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 585 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:40:37,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:37,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:40:37,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:40,330 INFO L124 PetriNetUnfolderBase]: 4541/7441 cut-off events. [2024-05-12 11:40:40,331 INFO L125 PetriNetUnfolderBase]: For 16223/16223 co-relation queries the response was YES. [2024-05-12 11:40:40,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22508 conditions, 7441 events. 4541/7441 cut-off events. For 16223/16223 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 48487 event pairs, 1945 based on Foata normal form. 2/7196 useless extension candidates. Maximal degree in co-relation 22477. Up to 6479 conditions per place. [2024-05-12 11:40:40,373 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 76 selfloop transitions, 14 changer transitions 0/101 dead transitions. [2024-05-12 11:40:40,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 101 transitions, 805 flow [2024-05-12 11:40:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:40:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:40:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-05-12 11:40:40,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2024-05-12 11:40:40,375 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 585 flow. Second operand 5 states and 130 transitions. [2024-05-12 11:40:40,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 101 transitions, 805 flow [2024-05-12 11:40:40,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 101 transitions, 715 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 11:40:40,387 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 535 flow [2024-05-12 11:40:40,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=535, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2024-05-12 11:40:40,388 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-05-12 11:40:40,388 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 535 flow [2024-05-12 11:40:40,388 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:40:40,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:40,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:40,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:40:40,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:40:40,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1598111572, now seen corresponding path program 1 times [2024-05-12 11:40:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:40,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669944583] [2024-05-12 11:40:40,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:57,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669944583] [2024-05-12 11:40:57,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669944583] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:57,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:40:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790400394] [2024-05-12 11:40:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:57,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:40:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:57,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:40:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:40:57,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:40:57,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 535 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:40:57,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:57,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:40:57,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:00,985 INFO L124 PetriNetUnfolderBase]: 5329/8699 cut-off events. [2024-05-12 11:41:00,985 INFO L125 PetriNetUnfolderBase]: For 19026/19026 co-relation queries the response was YES. [2024-05-12 11:41:01,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25625 conditions, 8699 events. 5329/8699 cut-off events. For 19026/19026 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 57108 event pairs, 2333 based on Foata normal form. 2/8476 useless extension candidates. Maximal degree in co-relation 25592. Up to 7566 conditions per place. [2024-05-12 11:41:01,032 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 85 selfloop transitions, 17 changer transitions 0/112 dead transitions. [2024-05-12 11:41:01,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 112 transitions, 821 flow [2024-05-12 11:41:01,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:41:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:41:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-05-12 11:41:01,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2024-05-12 11:41:01,034 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 535 flow. Second operand 6 states and 150 transitions. [2024-05-12 11:41:01,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 112 transitions, 821 flow [2024-05-12 11:41:01,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 782 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 11:41:01,046 INFO L231 Difference]: Finished difference. Result has 82 places, 87 transitions, 565 flow [2024-05-12 11:41:01,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=565, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2024-05-12 11:41:01,046 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2024-05-12 11:41:01,046 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 565 flow [2024-05-12 11:41:01,047 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:01,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:01,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:01,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:41:01,047 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:41:01,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1311244487, now seen corresponding path program 1 times [2024-05-12 11:41:01,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:01,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208823692] [2024-05-12 11:41:01,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:14,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:14,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208823692] [2024-05-12 11:41:14,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208823692] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:14,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:14,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:41:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379401555] [2024-05-12 11:41:14,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:14,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:41:14,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:14,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:41:14,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:41:14,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:41:14,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 565 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:14,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:14,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:41:14,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:18,056 INFO L124 PetriNetUnfolderBase]: 5055/8365 cut-off events. [2024-05-12 11:41:18,076 INFO L125 PetriNetUnfolderBase]: For 23021/23027 co-relation queries the response was YES. [2024-05-12 11:41:18,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25988 conditions, 8365 events. 5055/8365 cut-off events. For 23021/23027 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 55380 event pairs, 1888 based on Foata normal form. 10/8116 useless extension candidates. Maximal degree in co-relation 25955. Up to 7103 conditions per place. [2024-05-12 11:41:18,135 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 87 selfloop transitions, 21 changer transitions 0/120 dead transitions. [2024-05-12 11:41:18,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 120 transitions, 919 flow [2024-05-12 11:41:18,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:41:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:41:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-05-12 11:41:18,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5326797385620915 [2024-05-12 11:41:18,136 INFO L175 Difference]: Start difference. First operand has 82 places, 87 transitions, 565 flow. Second operand 6 states and 163 transitions. [2024-05-12 11:41:18,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 120 transitions, 919 flow [2024-05-12 11:41:18,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 120 transitions, 878 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 11:41:18,155 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 610 flow [2024-05-12 11:41:18,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2024-05-12 11:41:18,156 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2024-05-12 11:41:18,156 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 610 flow [2024-05-12 11:41:18,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 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,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:18,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:18,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:41:18,159 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:41:18,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1278776327, now seen corresponding path program 2 times [2024-05-12 11:41:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:18,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870263683] [2024-05-12 11:41:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:18,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:30,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870263683] [2024-05-12 11:41:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870263683] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:30,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:41:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533401123] [2024-05-12 11:41:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:30,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:41:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:30,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:41:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:41:30,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:41:30,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 610 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:30,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:30,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:41:30,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:33,995 INFO L124 PetriNetUnfolderBase]: 5049/8384 cut-off events. [2024-05-12 11:41:33,996 INFO L125 PetriNetUnfolderBase]: For 25554/25554 co-relation queries the response was YES. [2024-05-12 11:41:34,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26375 conditions, 8384 events. 5049/8384 cut-off events. For 25554/25554 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 56241 event pairs, 2133 based on Foata normal form. 2/8150 useless extension candidates. Maximal degree in co-relation 26341. Up to 7205 conditions per place. [2024-05-12 11:41:34,033 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 88 selfloop transitions, 13 changer transitions 0/113 dead transitions. [2024-05-12 11:41:34,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 113 transitions, 870 flow [2024-05-12 11:41:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:41:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:41:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-05-12 11:41:34,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:41:34,035 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 610 flow. Second operand 6 states and 153 transitions. [2024-05-12 11:41:34,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 113 transitions, 870 flow [2024-05-12 11:41:34,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 113 transitions, 837 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 11:41:34,055 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 611 flow [2024-05-12 11:41:34,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2024-05-12 11:41:34,055 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2024-05-12 11:41:34,056 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 611 flow [2024-05-12 11:41:34,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:34,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:34,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:34,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:41:34,056 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:41:34,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:34,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1998149588, now seen corresponding path program 1 times [2024-05-12 11:41:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:34,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514642090] [2024-05-12 11:41:34,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:34,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514642090] [2024-05-12 11:41:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514642090] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:50,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:41:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656716502] [2024-05-12 11:41:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:50,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:41:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:50,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:41:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:41:51,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:41:51,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 611 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:41:51,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:51,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:41:51,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:54,382 INFO L124 PetriNetUnfolderBase]: 5322/8654 cut-off events. [2024-05-12 11:41:54,382 INFO L125 PetriNetUnfolderBase]: For 28247/28247 co-relation queries the response was YES. [2024-05-12 11:41:54,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27421 conditions, 8654 events. 5322/8654 cut-off events. For 28247/28247 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 56513 event pairs, 2229 based on Foata normal form. 4/8430 useless extension candidates. Maximal degree in co-relation 27386. Up to 7518 conditions per place. [2024-05-12 11:41:54,425 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 97 selfloop transitions, 20 changer transitions 0/127 dead transitions. [2024-05-12 11:41:54,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 127 transitions, 955 flow [2024-05-12 11:41:54,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:41:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:41:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-05-12 11:41:54,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2024-05-12 11:41:54,428 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 611 flow. Second operand 7 states and 175 transitions. [2024-05-12 11:41:54,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 127 transitions, 955 flow [2024-05-12 11:41:54,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 127 transitions, 899 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 11:41:54,449 INFO L231 Difference]: Finished difference. Result has 88 places, 93 transitions, 633 flow [2024-05-12 11:41:54,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=633, PETRI_PLACES=88, PETRI_TRANSITIONS=93} [2024-05-12 11:41:54,449 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2024-05-12 11:41:54,450 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 93 transitions, 633 flow [2024-05-12 11:41:54,450 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:41:54,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:54,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:54,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:41:54,450 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:41:54,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1611251656, now seen corresponding path program 1 times [2024-05-12 11:41:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:54,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667621145] [2024-05-12 11:41:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:07,504 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:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:07,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667621145] [2024-05-12 11:42:07,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667621145] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:07,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:07,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:42:07,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943263361] [2024-05-12 11:42:07,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:07,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:42:07,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:42:07,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:42:07,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:42:07,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 93 transitions, 633 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:07,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:07,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:42:07,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:10,934 INFO L124 PetriNetUnfolderBase]: 5378/8755 cut-off events. [2024-05-12 11:42:10,934 INFO L125 PetriNetUnfolderBase]: For 33106/33110 co-relation queries the response was YES. [2024-05-12 11:42:10,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28929 conditions, 8755 events. 5378/8755 cut-off events. For 33106/33110 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 56734 event pairs, 1949 based on Foata normal form. 8/8500 useless extension candidates. Maximal degree in co-relation 28894. Up to 7422 conditions per place. [2024-05-12 11:42:10,988 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 104 selfloop transitions, 29 changer transitions 0/143 dead transitions. [2024-05-12 11:42:10,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 143 transitions, 1122 flow [2024-05-12 11:42:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:42:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:42:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-05-12 11:42:10,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182072829131653 [2024-05-12 11:42:10,990 INFO L175 Difference]: Start difference. First operand has 88 places, 93 transitions, 633 flow. Second operand 7 states and 185 transitions. [2024-05-12 11:42:10,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 143 transitions, 1122 flow [2024-05-12 11:42:11,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 143 transitions, 1065 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-05-12 11:42:11,012 INFO L231 Difference]: Finished difference. Result has 91 places, 104 transitions, 747 flow [2024-05-12 11:42:11,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=747, PETRI_PLACES=91, PETRI_TRANSITIONS=104} [2024-05-12 11:42:11,014 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2024-05-12 11:42:11,015 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 104 transitions, 747 flow [2024-05-12 11:42:11,015 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:11,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:11,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:11,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:42:11,015 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:42:11,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1484478622, now seen corresponding path program 2 times [2024-05-12 11:42:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:11,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627890770] [2024-05-12 11:42:11,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:23,645 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:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:23,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627890770] [2024-05-12 11:42:23,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627890770] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:23,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:23,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:42:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061376230] [2024-05-12 11:42:23,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:23,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:42:23,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:42:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:42:23,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:42:23,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 104 transitions, 747 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:23,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:23,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:42:23,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:27,100 INFO L124 PetriNetUnfolderBase]: 5401/8830 cut-off events. [2024-05-12 11:42:27,100 INFO L125 PetriNetUnfolderBase]: For 40473/40473 co-relation queries the response was YES. [2024-05-12 11:42:27,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31053 conditions, 8830 events. 5401/8830 cut-off events. For 40473/40473 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 58107 event pairs, 2199 based on Foata normal form. 2/8599 useless extension candidates. Maximal degree in co-relation 31016. Up to 7657 conditions per place. [2024-05-12 11:42:27,151 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 109 selfloop transitions, 17 changer transitions 0/136 dead transitions. [2024-05-12 11:42:27,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 136 transitions, 1103 flow [2024-05-12 11:42:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:42:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:42:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-05-12 11:42:27,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789915966386555 [2024-05-12 11:42:27,153 INFO L175 Difference]: Start difference. First operand has 91 places, 104 transitions, 747 flow. Second operand 7 states and 171 transitions. [2024-05-12 11:42:27,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 136 transitions, 1103 flow [2024-05-12 11:42:27,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 136 transitions, 1075 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-05-12 11:42:27,184 INFO L231 Difference]: Finished difference. Result has 96 places, 107 transitions, 797 flow [2024-05-12 11:42:27,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=797, PETRI_PLACES=96, PETRI_TRANSITIONS=107} [2024-05-12 11:42:27,185 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 39 predicate places. [2024-05-12 11:42:27,185 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 107 transitions, 797 flow [2024-05-12 11:42:27,185 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:27,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:27,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:27,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:42:27,186 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:42:27,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1816982536, now seen corresponding path program 3 times [2024-05-12 11:42:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:27,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970504133] [2024-05-12 11:42:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:39,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970504133] [2024-05-12 11:42:39,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970504133] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:39,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:39,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:42:39,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812996791] [2024-05-12 11:42:39,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:39,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:42:39,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:39,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:42:39,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:42:39,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:42:39,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 107 transitions, 797 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:39,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:39,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:42:39,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:43,190 INFO L124 PetriNetUnfolderBase]: 5396/8822 cut-off events. [2024-05-12 11:42:43,190 INFO L125 PetriNetUnfolderBase]: For 45360/45360 co-relation queries the response was YES. [2024-05-12 11:42:43,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31667 conditions, 8822 events. 5396/8822 cut-off events. For 45360/45360 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 58092 event pairs, 2197 based on Foata normal form. 2/8591 useless extension candidates. Maximal degree in co-relation 31627. Up to 7618 conditions per place. [2024-05-12 11:42:43,238 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 109 selfloop transitions, 22 changer transitions 0/141 dead transitions. [2024-05-12 11:42:43,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 141 transitions, 1179 flow [2024-05-12 11:42:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:42:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:42:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-05-12 11:42:43,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48739495798319327 [2024-05-12 11:42:43,240 INFO L175 Difference]: Start difference. First operand has 96 places, 107 transitions, 797 flow. Second operand 7 states and 174 transitions. [2024-05-12 11:42:43,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 141 transitions, 1179 flow [2024-05-12 11:42:43,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 141 transitions, 1117 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 11:42:43,267 INFO L231 Difference]: Finished difference. Result has 98 places, 110 transitions, 829 flow [2024-05-12 11:42:43,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=829, PETRI_PLACES=98, PETRI_TRANSITIONS=110} [2024-05-12 11:42:43,268 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2024-05-12 11:42:43,268 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 110 transitions, 829 flow [2024-05-12 11:42:43,268 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:43,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:43,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:43,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:42:43,269 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:42:43,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:43,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1578205957, now seen corresponding path program 1 times [2024-05-12 11:42:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:43,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707088933] [2024-05-12 11:42:43,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:01,750 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:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:01,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707088933] [2024-05-12 11:43:01,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707088933] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:01,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:01,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:43:01,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571924916] [2024-05-12 11:43:01,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:01,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:43:01,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:01,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:43:01,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:43:01,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:43:01,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 110 transitions, 829 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:01,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:01,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:43:01,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:05,325 INFO L124 PetriNetUnfolderBase]: 5913/9736 cut-off events. [2024-05-12 11:43:05,325 INFO L125 PetriNetUnfolderBase]: For 56729/56741 co-relation queries the response was YES. [2024-05-12 11:43:05,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35150 conditions, 9736 events. 5913/9736 cut-off events. For 56729/56741 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 65279 event pairs, 2501 based on Foata normal form. 1/9487 useless extension candidates. Maximal degree in co-relation 35110. Up to 8400 conditions per place. [2024-05-12 11:43:05,376 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 101 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2024-05-12 11:43:05,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 128 transitions, 1121 flow [2024-05-12 11:43:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:43:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:43:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-05-12 11:43:05,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47843137254901963 [2024-05-12 11:43:05,378 INFO L175 Difference]: Start difference. First operand has 98 places, 110 transitions, 829 flow. Second operand 5 states and 122 transitions. [2024-05-12 11:43:05,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 128 transitions, 1121 flow [2024-05-12 11:43:05,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 128 transitions, 1053 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-05-12 11:43:05,414 INFO L231 Difference]: Finished difference. Result has 98 places, 113 transitions, 824 flow [2024-05-12 11:43:05,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=824, PETRI_PLACES=98, PETRI_TRANSITIONS=113} [2024-05-12 11:43:05,415 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2024-05-12 11:43:05,415 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 113 transitions, 824 flow [2024-05-12 11:43:05,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:05,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:05,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:05,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:43:05,416 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:43:05,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1594620680, now seen corresponding path program 1 times [2024-05-12 11:43:05,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:05,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157465515] [2024-05-12 11:43:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:20,645 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:20,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:20,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157465515] [2024-05-12 11:43:20,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157465515] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:20,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:20,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:43:20,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562498519] [2024-05-12 11:43:20,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:20,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:43:20,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:20,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:43:20,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:43:20,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:43:20,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 113 transitions, 824 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:20,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:20,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:43:20,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:24,257 INFO L124 PetriNetUnfolderBase]: 5130/8492 cut-off events. [2024-05-12 11:43:24,257 INFO L125 PetriNetUnfolderBase]: For 55600/55610 co-relation queries the response was YES. [2024-05-12 11:43:24,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32133 conditions, 8492 events. 5130/8492 cut-off events. For 55600/55610 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 56166 event pairs, 1774 based on Foata normal form. 6/8251 useless extension candidates. Maximal degree in co-relation 32092. Up to 7108 conditions per place. [2024-05-12 11:43:24,301 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 122 selfloop transitions, 28 changer transitions 0/167 dead transitions. [2024-05-12 11:43:24,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 167 transitions, 1306 flow [2024-05-12 11:43:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:43:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:43:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-05-12 11:43:24,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269607843137255 [2024-05-12 11:43:24,303 INFO L175 Difference]: Start difference. First operand has 98 places, 113 transitions, 824 flow. Second operand 8 states and 215 transitions. [2024-05-12 11:43:24,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 167 transitions, 1306 flow [2024-05-12 11:43:24,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 167 transitions, 1269 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-05-12 11:43:24,340 INFO L231 Difference]: Finished difference. Result has 104 places, 120 transitions, 919 flow [2024-05-12 11:43:24,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=919, PETRI_PLACES=104, PETRI_TRANSITIONS=120} [2024-05-12 11:43:24,340 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 47 predicate places. [2024-05-12 11:43:24,341 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 120 transitions, 919 flow [2024-05-12 11:43:24,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:24,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:24,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:24,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:43:24,341 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:43:24,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1590811245, now seen corresponding path program 1 times [2024-05-12 11:43:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452561775] [2024-05-12 11:43:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:38,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:38,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452561775] [2024-05-12 11:43:38,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452561775] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:38,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:38,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:43:38,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036200026] [2024-05-12 11:43:38,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:38,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:43:38,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:38,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:43:38,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:43:38,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:43:38,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 120 transitions, 919 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:38,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:38,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:43:38,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:41,639 INFO L124 PetriNetUnfolderBase]: 5426/8823 cut-off events. [2024-05-12 11:43:41,639 INFO L125 PetriNetUnfolderBase]: For 62740/62746 co-relation queries the response was YES. [2024-05-12 11:43:41,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34803 conditions, 8823 events. 5426/8823 cut-off events. For 62740/62746 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 57086 event pairs, 1910 based on Foata normal form. 8/8580 useless extension candidates. Maximal degree in co-relation 34760. Up to 7468 conditions per place. [2024-05-12 11:43:41,692 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 115 selfloop transitions, 39 changer transitions 0/164 dead transitions. [2024-05-12 11:43:41,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 164 transitions, 1435 flow [2024-05-12 11:43:41,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:43:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:43:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2024-05-12 11:43:41,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266106442577031 [2024-05-12 11:43:41,693 INFO L175 Difference]: Start difference. First operand has 104 places, 120 transitions, 919 flow. Second operand 7 states and 188 transitions. [2024-05-12 11:43:41,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 164 transitions, 1435 flow [2024-05-12 11:43:41,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 164 transitions, 1369 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 11:43:41,808 INFO L231 Difference]: Finished difference. Result has 106 places, 123 transitions, 975 flow [2024-05-12 11:43:41,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=975, PETRI_PLACES=106, PETRI_TRANSITIONS=123} [2024-05-12 11:43:41,809 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 49 predicate places. [2024-05-12 11:43:41,809 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 123 transitions, 975 flow [2024-05-12 11:43:41,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:41,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:41,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:41,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:43:41,809 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:43:41,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1590805665, now seen corresponding path program 2 times [2024-05-12 11:43:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:41,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378843436] [2024-05-12 11:43:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:41,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:54,611 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:54,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:54,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378843436] [2024-05-12 11:43:54,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378843436] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:54,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:54,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:43:54,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953056328] [2024-05-12 11:43:54,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:54,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:43:54,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:54,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:43:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:43:54,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:43:54,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 123 transitions, 975 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:54,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:54,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:43:54,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:57,950 INFO L124 PetriNetUnfolderBase]: 5449/8855 cut-off events. [2024-05-12 11:43:57,951 INFO L125 PetriNetUnfolderBase]: For 68002/68008 co-relation queries the response was YES. [2024-05-12 11:43:57,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35377 conditions, 8855 events. 5449/8855 cut-off events. For 68002/68008 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 57231 event pairs, 1910 based on Foata normal form. 8/8612 useless extension candidates. Maximal degree in co-relation 35333. Up to 7492 conditions per place. [2024-05-12 11:43:58,007 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 115 selfloop transitions, 39 changer transitions 0/164 dead transitions. [2024-05-12 11:43:58,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 164 transitions, 1493 flow [2024-05-12 11:43:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:43:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:43:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-05-12 11:43:58,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154061624649859 [2024-05-12 11:43:58,010 INFO L175 Difference]: Start difference. First operand has 106 places, 123 transitions, 975 flow. Second operand 7 states and 184 transitions. [2024-05-12 11:43:58,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 164 transitions, 1493 flow [2024-05-12 11:43:58,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 164 transitions, 1381 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-05-12 11:43:58,067 INFO L231 Difference]: Finished difference. Result has 108 places, 126 transitions, 992 flow [2024-05-12 11:43:58,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=992, PETRI_PLACES=108, PETRI_TRANSITIONS=126} [2024-05-12 11:43:58,068 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 51 predicate places. [2024-05-12 11:43:58,068 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 126 transitions, 992 flow [2024-05-12 11:43:58,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:58,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:58,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:58,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:43:58,069 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:43:58,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1590805448, now seen corresponding path program 1 times [2024-05-12 11:43:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:58,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166242428] [2024-05-12 11:43:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:11,514 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:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:11,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166242428] [2024-05-12 11:44:11,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166242428] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:11,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:11,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:44:11,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027111799] [2024-05-12 11:44:11,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:11,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:44:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:11,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:44:11,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:44:11,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:44:11,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 126 transitions, 992 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:11,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:11,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:44:11,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:15,292 INFO L124 PetriNetUnfolderBase]: 5607/8772 cut-off events. [2024-05-12 11:44:15,292 INFO L125 PetriNetUnfolderBase]: For 75282/75288 co-relation queries the response was YES. [2024-05-12 11:44:15,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36454 conditions, 8772 events. 5607/8772 cut-off events. For 75282/75288 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 54456 event pairs, 1702 based on Foata normal form. 10/8640 useless extension candidates. Maximal degree in co-relation 36409. Up to 7475 conditions per place. [2024-05-12 11:44:15,346 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 132 selfloop transitions, 44 changer transitions 0/186 dead transitions. [2024-05-12 11:44:15,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 186 transitions, 1644 flow [2024-05-12 11:44:15,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:44:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:44:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions. [2024-05-12 11:44:15,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5245098039215687 [2024-05-12 11:44:15,350 INFO L175 Difference]: Start difference. First operand has 108 places, 126 transitions, 992 flow. Second operand 8 states and 214 transitions. [2024-05-12 11:44:15,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 186 transitions, 1644 flow [2024-05-12 11:44:15,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 186 transitions, 1564 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 11:44:15,410 INFO L231 Difference]: Finished difference. Result has 113 places, 137 transitions, 1127 flow [2024-05-12 11:44:15,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1127, PETRI_PLACES=113, PETRI_TRANSITIONS=137} [2024-05-12 11:44:15,411 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 56 predicate places. [2024-05-12 11:44:15,411 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 137 transitions, 1127 flow [2024-05-12 11:44:15,411 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:15,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:15,412 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:15,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:44:15,412 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:44:15,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1226099482, now seen corresponding path program 2 times [2024-05-12 11:44:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:15,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868286972] [2024-05-12 11:44:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:28,342 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:28,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:28,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868286972] [2024-05-12 11:44:28,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868286972] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:28,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:44:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336873171] [2024-05-12 11:44:28,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:28,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:44:28,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:28,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:44:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:44:28,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:44:28,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 137 transitions, 1127 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:28,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:28,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:44:28,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:32,239 INFO L124 PetriNetUnfolderBase]: 5653/8881 cut-off events. [2024-05-12 11:44:32,239 INFO L125 PetriNetUnfolderBase]: For 87208/87208 co-relation queries the response was YES. [2024-05-12 11:44:32,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39236 conditions, 8881 events. 5653/8881 cut-off events. For 87208/87208 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 55826 event pairs, 2049 based on Foata normal form. 4/8752 useless extension candidates. Maximal degree in co-relation 39189. Up to 7978 conditions per place. [2024-05-12 11:44:32,293 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 145 selfloop transitions, 21 changer transitions 0/176 dead transitions. [2024-05-12 11:44:32,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 176 transitions, 1593 flow [2024-05-12 11:44:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:44:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:44:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:44:32,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47794117647058826 [2024-05-12 11:44:32,295 INFO L175 Difference]: Start difference. First operand has 113 places, 137 transitions, 1127 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:44:32,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 176 transitions, 1593 flow [2024-05-12 11:44:32,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 176 transitions, 1548 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-05-12 11:44:32,368 INFO L231 Difference]: Finished difference. Result has 118 places, 140 transitions, 1178 flow [2024-05-12 11:44:32,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1178, PETRI_PLACES=118, PETRI_TRANSITIONS=140} [2024-05-12 11:44:32,368 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 61 predicate places. [2024-05-12 11:44:32,368 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 140 transitions, 1178 flow [2024-05-12 11:44:32,369 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:32,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:32,369 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:32,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:44:32,369 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:44:32,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash 371091517, now seen corresponding path program 3 times [2024-05-12 11:44:32,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:32,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814279134] [2024-05-12 11:44:32,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:32,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:45,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:45,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814279134] [2024-05-12 11:44:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814279134] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:45,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:45,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:44:45,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058974764] [2024-05-12 11:44:45,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:45,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:44:45,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:45,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:44:45,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:44:45,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:44:45,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 140 transitions, 1178 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:45,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:45,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:44:45,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:48,889 INFO L124 PetriNetUnfolderBase]: 5648/8882 cut-off events. [2024-05-12 11:44:48,890 INFO L125 PetriNetUnfolderBase]: For 94769/94773 co-relation queries the response was YES. [2024-05-12 11:44:48,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39671 conditions, 8882 events. 5648/8882 cut-off events. For 94769/94773 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 55837 event pairs, 2042 based on Foata normal form. 6/8755 useless extension candidates. Maximal degree in co-relation 39621. Up to 7984 conditions per place. [2024-05-12 11:44:48,947 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 142 selfloop transitions, 19 changer transitions 0/171 dead transitions. [2024-05-12 11:44:48,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 171 transitions, 1588 flow [2024-05-12 11:44:48,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:44:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:44:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 11:44:48,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484593837535014 [2024-05-12 11:44:48,949 INFO L175 Difference]: Start difference. First operand has 118 places, 140 transitions, 1178 flow. Second operand 7 states and 173 transitions. [2024-05-12 11:44:48,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 171 transitions, 1588 flow [2024-05-12 11:44:49,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 171 transitions, 1483 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-05-12 11:44:49,038 INFO L231 Difference]: Finished difference. Result has 119 places, 140 transitions, 1119 flow [2024-05-12 11:44:49,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1119, PETRI_PLACES=119, PETRI_TRANSITIONS=140} [2024-05-12 11:44:49,039 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 62 predicate places. [2024-05-12 11:44:49,039 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 140 transitions, 1119 flow [2024-05-12 11:44:49,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:49,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:49,040 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:49,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:44:49,040 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:44:49,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:49,040 INFO L85 PathProgramCache]: Analyzing trace with hash -543178166, now seen corresponding path program 3 times [2024-05-12 11:44:49,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:49,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93997172] [2024-05-12 11:44:49,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:49,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:02,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93997172] [2024-05-12 11:45:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93997172] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:02,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:02,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:45:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60559347] [2024-05-12 11:45:02,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:02,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:45:02,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:02,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:45:02,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:45:02,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:45:02,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 140 transitions, 1119 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:45:02,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:02,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:45:02,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:06,193 INFO L124 PetriNetUnfolderBase]: 5694/8954 cut-off events. [2024-05-12 11:45:06,194 INFO L125 PetriNetUnfolderBase]: For 100609/100609 co-relation queries the response was YES. [2024-05-12 11:45:06,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40139 conditions, 8954 events. 5694/8954 cut-off events. For 100609/100609 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 56271 event pairs, 2038 based on Foata normal form. 4/8825 useless extension candidates. Maximal degree in co-relation 40089. Up to 7986 conditions per place. [2024-05-12 11:45:06,253 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 146 selfloop transitions, 26 changer transitions 0/182 dead transitions. [2024-05-12 11:45:06,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 1619 flow [2024-05-12 11:45:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:45:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:45:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-05-12 11:45:06,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4877450980392157 [2024-05-12 11:45:06,255 INFO L175 Difference]: Start difference. First operand has 119 places, 140 transitions, 1119 flow. Second operand 8 states and 199 transitions. [2024-05-12 11:45:06,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 1619 flow [2024-05-12 11:45:06,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 182 transitions, 1548 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-05-12 11:45:06,342 INFO L231 Difference]: Finished difference. Result has 120 places, 143 transitions, 1160 flow [2024-05-12 11:45:06,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1160, PETRI_PLACES=120, PETRI_TRANSITIONS=143} [2024-05-12 11:45:06,343 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 63 predicate places. [2024-05-12 11:45:06,343 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 143 transitions, 1160 flow [2024-05-12 11:45:06,343 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:45:06,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:06,343 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:06,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:45:06,343 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:45:06,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 362846354, now seen corresponding path program 4 times [2024-05-12 11:45:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:06,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528993479] [2024-05-12 11:45:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:19,643 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:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528993479] [2024-05-12 11:45:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528993479] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:19,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:19,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:45:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639667592] [2024-05-12 11:45:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:19,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:45:19,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:19,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:45:19,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:45:19,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:45:19,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 143 transitions, 1160 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:45:19,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:19,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:45:19,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:23,790 INFO L124 PetriNetUnfolderBase]: 5684/8936 cut-off events. [2024-05-12 11:45:23,790 INFO L125 PetriNetUnfolderBase]: For 108700/108700 co-relation queries the response was YES. [2024-05-12 11:45:23,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40699 conditions, 8936 events. 5684/8936 cut-off events. For 108700/108700 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 56229 event pairs, 2034 based on Foata normal form. 4/8808 useless extension candidates. Maximal degree in co-relation 40648. Up to 7906 conditions per place. [2024-05-12 11:45:23,843 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 144 selfloop transitions, 33 changer transitions 0/187 dead transitions. [2024-05-12 11:45:23,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 187 transitions, 1688 flow [2024-05-12 11:45:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:45:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:45:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-05-12 11:45:23,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950980392156863 [2024-05-12 11:45:23,844 INFO L175 Difference]: Start difference. First operand has 120 places, 143 transitions, 1160 flow. Second operand 8 states and 202 transitions. [2024-05-12 11:45:23,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 187 transitions, 1688 flow [2024-05-12 11:45:23,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 187 transitions, 1604 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 11:45:23,929 INFO L231 Difference]: Finished difference. Result has 122 places, 146 transitions, 1208 flow [2024-05-12 11:45:23,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1208, PETRI_PLACES=122, PETRI_TRANSITIONS=146} [2024-05-12 11:45:23,930 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 65 predicate places. [2024-05-12 11:45:23,930 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 146 transitions, 1208 flow [2024-05-12 11:45:23,930 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:45:23,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:23,930 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:23,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:45:23,931 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:45:23,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1638634086, now seen corresponding path program 1 times [2024-05-12 11:45:23,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:23,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82203012] [2024-05-12 11:45:23,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:44,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:44,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82203012] [2024-05-12 11:45:44,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82203012] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:44,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:44,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:45:44,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357049709] [2024-05-12 11:45:44,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:44,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:45:44,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:44,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:45:44,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:45:44,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:45:44,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 146 transitions, 1208 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:44,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:44,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:45:44,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:48,457 INFO L124 PetriNetUnfolderBase]: 7096/10933 cut-off events. [2024-05-12 11:45:48,458 INFO L125 PetriNetUnfolderBase]: For 151967/151989 co-relation queries the response was YES. [2024-05-12 11:45:48,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50409 conditions, 10933 events. 7096/10933 cut-off events. For 151967/151989 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 68077 event pairs, 2709 based on Foata normal form. 11/10754 useless extension candidates. Maximal degree in co-relation 50357. Up to 10036 conditions per place. [2024-05-12 11:45:48,529 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 138 selfloop transitions, 14 changer transitions 0/169 dead transitions. [2024-05-12 11:45:48,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 169 transitions, 1604 flow [2024-05-12 11:45:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:45:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:45:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-05-12 11:45:48,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2024-05-12 11:45:48,531 INFO L175 Difference]: Start difference. First operand has 122 places, 146 transitions, 1208 flow. Second operand 6 states and 138 transitions. [2024-05-12 11:45:48,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 169 transitions, 1604 flow [2024-05-12 11:45:48,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 169 transitions, 1500 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-05-12 11:45:48,643 INFO L231 Difference]: Finished difference. Result has 122 places, 149 transitions, 1176 flow [2024-05-12 11:45:48,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1176, PETRI_PLACES=122, PETRI_TRANSITIONS=149} [2024-05-12 11:45:48,643 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 65 predicate places. [2024-05-12 11:45:48,644 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 149 transitions, 1176 flow [2024-05-12 11:45:48,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:48,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:48,644 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:45:48,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:45:48,644 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:45:48,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash -88731001, now seen corresponding path program 1 times [2024-05-12 11:45:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:48,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173102592] [2024-05-12 11:45:48,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:03,736 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:03,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:03,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173102592] [2024-05-12 11:46:03,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173102592] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:03,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:03,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:46:03,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206284817] [2024-05-12 11:46:03,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:03,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:46:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:03,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:46:03,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:46:04,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:46:04,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 149 transitions, 1176 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:04,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:04,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:46:04,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:07,814 INFO L124 PetriNetUnfolderBase]: 5566/8538 cut-off events. [2024-05-12 11:46:07,814 INFO L125 PetriNetUnfolderBase]: For 139648/139658 co-relation queries the response was YES. [2024-05-12 11:46:07,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42591 conditions, 8538 events. 5566/8538 cut-off events. For 139648/139658 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 51944 event pairs, 1027 based on Foata normal form. 12/8500 useless extension candidates. Maximal degree in co-relation 42538. Up to 7450 conditions per place. [2024-05-12 11:46:07,875 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 143 selfloop transitions, 46 changer transitions 0/209 dead transitions. [2024-05-12 11:46:07,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 209 transitions, 1902 flow [2024-05-12 11:46:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:46:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:46:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-05-12 11:46:07,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343137254901961 [2024-05-12 11:46:07,880 INFO L175 Difference]: Start difference. First operand has 122 places, 149 transitions, 1176 flow. Second operand 8 states and 218 transitions. [2024-05-12 11:46:07,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 209 transitions, 1902 flow [2024-05-12 11:46:07,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 209 transitions, 1854 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 11:46:08,010 INFO L231 Difference]: Finished difference. Result has 127 places, 156 transitions, 1339 flow [2024-05-12 11:46:08,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1339, PETRI_PLACES=127, PETRI_TRANSITIONS=156} [2024-05-12 11:46:08,011 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 70 predicate places. [2024-05-12 11:46:08,011 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 156 transitions, 1339 flow [2024-05-12 11:46:08,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:08,011 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:46:08,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:46:08,012 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:46:08,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2106367209, now seen corresponding path program 1 times [2024-05-12 11:46:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151356163] [2024-05-12 11:46:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:08,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:22,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:46:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151356163] [2024-05-12 11:46:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151356163] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:46:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260130240] [2024-05-12 11:46:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:22,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:46:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:46:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:46:22,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:46:22,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 156 transitions, 1339 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:22,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:22,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:46:22,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:26,733 INFO L124 PetriNetUnfolderBase]: 5922/8938 cut-off events. [2024-05-12 11:46:26,733 INFO L125 PetriNetUnfolderBase]: For 151192/151196 co-relation queries the response was YES. [2024-05-12 11:46:26,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45727 conditions, 8938 events. 5922/8938 cut-off events. For 151192/151196 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 53140 event pairs, 1458 based on Foata normal form. 6/8891 useless extension candidates. Maximal degree in co-relation 45672. Up to 7891 conditions per place. [2024-05-12 11:46:26,794 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 145 selfloop transitions, 67 changer transitions 0/223 dead transitions. [2024-05-12 11:46:26,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 223 transitions, 2213 flow [2024-05-12 11:46:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:46:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:46:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2024-05-12 11:46:26,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220588235294118 [2024-05-12 11:46:26,796 INFO L175 Difference]: Start difference. First operand has 127 places, 156 transitions, 1339 flow. Second operand 8 states and 213 transitions. [2024-05-12 11:46:26,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 223 transitions, 2213 flow [2024-05-12 11:46:26,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 223 transitions, 2117 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-05-12 11:46:26,941 INFO L231 Difference]: Finished difference. Result has 134 places, 171 transitions, 1613 flow [2024-05-12 11:46:26,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1613, PETRI_PLACES=134, PETRI_TRANSITIONS=171} [2024-05-12 11:46:26,942 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 77 predicate places. [2024-05-12 11:46:26,942 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 171 transitions, 1613 flow [2024-05-12 11:46:26,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:26,943 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:46:26,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:46:26,943 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:46:26,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:26,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2106367085, now seen corresponding path program 2 times [2024-05-12 11:46:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464749744] [2024-05-12 11:46:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:43,151 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,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:43,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464749744] [2024-05-12 11:46:43,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464749744] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:43,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:43,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:46:43,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578564672] [2024-05-12 11:46:43,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:43,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:46:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:46:43,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:46:43,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:46:43,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 171 transitions, 1613 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:43,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:46:43,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:47,359 INFO L124 PetriNetUnfolderBase]: 5663/8675 cut-off events. [2024-05-12 11:46:47,360 INFO L125 PetriNetUnfolderBase]: For 164195/164205 co-relation queries the response was YES. [2024-05-12 11:46:47,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46424 conditions, 8675 events. 5663/8675 cut-off events. For 164195/164205 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 52749 event pairs, 1365 based on Foata normal form. 12/8637 useless extension candidates. Maximal degree in co-relation 46365. Up to 7699 conditions per place. [2024-05-12 11:46:47,439 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 151 selfloop transitions, 49 changer transitions 0/223 dead transitions. [2024-05-12 11:46:47,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 223 transitions, 2201 flow [2024-05-12 11:46:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:46:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:46:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-05-12 11:46:47,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269607843137255 [2024-05-12 11:46:47,441 INFO L175 Difference]: Start difference. First operand has 134 places, 171 transitions, 1613 flow. Second operand 8 states and 215 transitions. [2024-05-12 11:46:47,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 223 transitions, 2201 flow [2024-05-12 11:46:47,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 223 transitions, 2132 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-05-12 11:46:47,603 INFO L231 Difference]: Finished difference. Result has 140 places, 173 transitions, 1678 flow [2024-05-12 11:46:47,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1678, PETRI_PLACES=140, PETRI_TRANSITIONS=173} [2024-05-12 11:46:47,603 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 83 predicate places. [2024-05-12 11:46:47,604 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 173 transitions, 1678 flow [2024-05-12 11:46:47,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:47,604 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:46:47,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:46:47,604 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:46:47,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2109168369, now seen corresponding path program 2 times [2024-05-12 11:46:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:47,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152525010] [2024-05-12 11:46:47,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:04,126 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:04,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:04,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152525010] [2024-05-12 11:47:04,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152525010] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:04,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:04,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:47:04,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136362348] [2024-05-12 11:47:04,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:04,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:47:04,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:04,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:47:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:47:04,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:47:04,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 173 transitions, 1678 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:04,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:04,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:47:04,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:08,444 INFO L124 PetriNetUnfolderBase]: 6009/9372 cut-off events. [2024-05-12 11:47:08,444 INFO L125 PetriNetUnfolderBase]: For 173728/173732 co-relation queries the response was YES. [2024-05-12 11:47:08,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48831 conditions, 9372 events. 6009/9372 cut-off events. For 173728/173732 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 58788 event pairs, 1701 based on Foata normal form. 6/9210 useless extension candidates. Maximal degree in co-relation 48770. Up to 8216 conditions per place. [2024-05-12 11:47:08,513 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 167 selfloop transitions, 42 changer transitions 0/220 dead transitions. [2024-05-12 11:47:08,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 220 transitions, 2266 flow [2024-05-12 11:47:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:47:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:47:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-05-12 11:47:08,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2024-05-12 11:47:08,515 INFO L175 Difference]: Start difference. First operand has 140 places, 173 transitions, 1678 flow. Second operand 8 states and 207 transitions. [2024-05-12 11:47:08,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 220 transitions, 2266 flow [2024-05-12 11:47:08,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 220 transitions, 2140 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-05-12 11:47:08,687 INFO L231 Difference]: Finished difference. Result has 141 places, 176 transitions, 1686 flow [2024-05-12 11:47:08,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1686, PETRI_PLACES=141, PETRI_TRANSITIONS=176} [2024-05-12 11:47:08,687 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 84 predicate places. [2024-05-12 11:47:08,687 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 176 transitions, 1686 flow [2024-05-12 11:47:08,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:08,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:08,688 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:47:08,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:47:08,688 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:47:08,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:08,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2109163719, now seen corresponding path program 3 times [2024-05-12 11:47:08,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:08,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442279681] [2024-05-12 11:47:08,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:08,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:23,205 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:23,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:23,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442279681] [2024-05-12 11:47:23,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442279681] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:23,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:23,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:47:23,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965863931] [2024-05-12 11:47:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:23,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:47:23,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:23,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:47:23,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:47:23,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:47:23,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 176 transitions, 1686 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:23,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:23,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:47:23,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:27,490 INFO L124 PetriNetUnfolderBase]: 6025/9069 cut-off events. [2024-05-12 11:47:27,490 INFO L125 PetriNetUnfolderBase]: For 182029/182033 co-relation queries the response was YES. [2024-05-12 11:47:27,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48981 conditions, 9069 events. 6025/9069 cut-off events. For 182029/182033 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 53743 event pairs, 1450 based on Foata normal form. 6/9026 useless extension candidates. Maximal degree in co-relation 48920. Up to 8145 conditions per place. [2024-05-12 11:47:27,559 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 153 selfloop transitions, 72 changer transitions 0/236 dead transitions. [2024-05-12 11:47:27,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 236 transitions, 2484 flow [2024-05-12 11:47:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:47:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:47:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-05-12 11:47:27,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122549019607843 [2024-05-12 11:47:27,563 INFO L175 Difference]: Start difference. First operand has 141 places, 176 transitions, 1686 flow. Second operand 8 states and 209 transitions. [2024-05-12 11:47:27,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 236 transitions, 2484 flow [2024-05-12 11:47:27,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 236 transitions, 2380 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-05-12 11:47:27,747 INFO L231 Difference]: Finished difference. Result has 145 places, 189 transitions, 1986 flow [2024-05-12 11:47:27,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1986, PETRI_PLACES=145, PETRI_TRANSITIONS=189} [2024-05-12 11:47:27,748 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 88 predicate places. [2024-05-12 11:47:27,748 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 189 transitions, 1986 flow [2024-05-12 11:47:27,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:27,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:27,749 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:47:27,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:47:27,749 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:47:27,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2109163595, now seen corresponding path program 3 times [2024-05-12 11:47:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:27,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313837020] [2024-05-12 11:47:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:47:42,992 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:42,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:47:42,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313837020] [2024-05-12 11:47:42,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313837020] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:47:42,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:47:42,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:47:42,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223287537] [2024-05-12 11:47:42,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:47:42,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:47:42,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:47:42,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:47:42,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:47:43,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-05-12 11:47:43,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 189 transitions, 1986 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:47:43,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-05-12 11:47:43,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:47:47,210 INFO L124 PetriNetUnfolderBase]: 5765/9152 cut-off events. [2024-05-12 11:47:47,210 INFO L125 PetriNetUnfolderBase]: For 196962/196984 co-relation queries the response was YES. [2024-05-12 11:47:47,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49279 conditions, 9152 events. 5765/9152 cut-off events. For 196962/196984 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 58798 event pairs, 1623 based on Foata normal form. 16/8987 useless extension candidates. Maximal degree in co-relation 49215. Up to 7922 conditions per place. [2024-05-12 11:47:47,292 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 183 selfloop transitions, 26 changer transitions 0/236 dead transitions. [2024-05-12 11:47:47,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 236 transitions, 2568 flow [2024-05-12 11:47:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:47:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:47:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-05-12 11:47:47,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171568627450981 [2024-05-12 11:47:47,294 INFO L175 Difference]: Start difference. First operand has 145 places, 189 transitions, 1986 flow. Second operand 8 states and 211 transitions. [2024-05-12 11:47:47,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 236 transitions, 2568 flow [2024-05-12 11:47:47,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 236 transitions, 2392 flow, removed 60 selfloop flow, removed 3 redundant places. [2024-05-12 11:47:47,528 INFO L231 Difference]: Finished difference. Result has 150 places, 191 transitions, 1901 flow [2024-05-12 11:47:47,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1901, PETRI_PLACES=150, PETRI_TRANSITIONS=191} [2024-05-12 11:47:47,529 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 93 predicate places. [2024-05-12 11:47:47,529 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 191 transitions, 1901 flow [2024-05-12 11:47:47,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:47,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:47:47,530 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:47:47,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:47:47,530 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:47:47,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:47:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash -556406807, now seen corresponding path program 4 times [2024-05-12 11:47:47,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:47:47,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289991194] [2024-05-12 11:47:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:47:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:47:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:02,576 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:02,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:02,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289991194] [2024-05-12 11:48:02,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289991194] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:02,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:02,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:48:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410574131] [2024-05-12 11:48:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:02,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:48:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:02,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:48:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:48:02,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:48:02,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 191 transitions, 1901 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:02,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:02,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:48:02,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:48:06,971 INFO L124 PetriNetUnfolderBase]: 6048/9095 cut-off events. [2024-05-12 11:48:06,972 INFO L125 PetriNetUnfolderBase]: For 202107/202111 co-relation queries the response was YES. [2024-05-12 11:48:07,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50438 conditions, 9095 events. 6048/9095 cut-off events. For 202107/202111 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 53847 event pairs, 1446 based on Foata normal form. 6/9052 useless extension candidates. Maximal degree in co-relation 50372. Up to 8132 conditions per place. [2024-05-12 11:48:07,072 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 162 selfloop transitions, 77 changer transitions 0/250 dead transitions. [2024-05-12 11:48:07,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 250 transitions, 2743 flow [2024-05-12 11:48:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:48:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:48:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-05-12 11:48:07,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343137254901961 [2024-05-12 11:48:07,074 INFO L175 Difference]: Start difference. First operand has 150 places, 191 transitions, 1901 flow. Second operand 8 states and 218 transitions. [2024-05-12 11:48:07,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 250 transitions, 2743 flow [2024-05-12 11:48:07,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 250 transitions, 2690 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 11:48:07,311 INFO L231 Difference]: Finished difference. Result has 154 places, 197 transitions, 2146 flow [2024-05-12 11:48:07,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2146, PETRI_PLACES=154, PETRI_TRANSITIONS=197} [2024-05-12 11:48:07,312 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 97 predicate places. [2024-05-12 11:48:07,312 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 197 transitions, 2146 flow [2024-05-12 11:48:07,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:07,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:48:07,313 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:07,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:48:07,313 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:48:07,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:48:07,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2070507757, now seen corresponding path program 5 times [2024-05-12 11:48:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:48:07,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877393694] [2024-05-12 11:48:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:48:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:48:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:22,064 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,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:22,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877393694] [2024-05-12 11:48:22,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877393694] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:22,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:22,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:48:22,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294286855] [2024-05-12 11:48:22,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:22,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:48:22,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:22,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:48:22,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:48:22,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:48:22,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 197 transitions, 2146 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:22,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:48:22,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:48:26,313 INFO L124 PetriNetUnfolderBase]: 6076/9125 cut-off events. [2024-05-12 11:48:26,313 INFO L125 PetriNetUnfolderBase]: For 216060/216064 co-relation queries the response was YES. [2024-05-12 11:48:26,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51868 conditions, 9125 events. 6076/9125 cut-off events. For 216060/216064 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 53926 event pairs, 1455 based on Foata normal form. 6/9082 useless extension candidates. Maximal degree in co-relation 51800. Up to 8255 conditions per place. [2024-05-12 11:48:26,392 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 169 selfloop transitions, 71 changer transitions 0/251 dead transitions. [2024-05-12 11:48:26,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 251 transitions, 2869 flow [2024-05-12 11:48:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:48:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:48:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-05-12 11:48:26,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171568627450981 [2024-05-12 11:48:26,394 INFO L175 Difference]: Start difference. First operand has 154 places, 197 transitions, 2146 flow. Second operand 8 states and 211 transitions. [2024-05-12 11:48:26,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 251 transitions, 2869 flow [2024-05-12 11:48:26,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 251 transitions, 2638 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-05-12 11:48:26,623 INFO L231 Difference]: Finished difference. Result has 157 places, 203 transitions, 2171 flow [2024-05-12 11:48:26,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2171, PETRI_PLACES=157, PETRI_TRANSITIONS=203} [2024-05-12 11:48:26,623 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 100 predicate places. [2024-05-12 11:48:26,623 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 203 transitions, 2171 flow [2024-05-12 11:48:26,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:48:26,624 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,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 11:48:26,624 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:48:26,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:48:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2070328081, now seen corresponding path program 1 times [2024-05-12 11:48:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:48:26,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025874006] [2024-05-12 11:48:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:48:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:48:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:40,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:48:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025874006] [2024-05-12 11:48:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025874006] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:40,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:48:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621018380] [2024-05-12 11:48:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:40,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:48:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:40,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:48:40,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:48:40,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:48:40,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 203 transitions, 2171 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:40,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:48:40,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:48:44,610 INFO L124 PetriNetUnfolderBase]: 6205/9645 cut-off events. [2024-05-12 11:48:44,610 INFO L125 PetriNetUnfolderBase]: For 226665/226669 co-relation queries the response was YES. [2024-05-12 11:48:44,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52591 conditions, 9645 events. 6205/9645 cut-off events. For 226665/226669 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 60352 event pairs, 1626 based on Foata normal form. 5/9484 useless extension candidates. Maximal degree in co-relation 52523. Up to 8139 conditions per place. [2024-05-12 11:48:44,686 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 191 selfloop transitions, 58 changer transitions 0/260 dead transitions. [2024-05-12 11:48:44,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 260 transitions, 3155 flow [2024-05-12 11:48:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:48:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:48:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-05-12 11:48:44,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2024-05-12 11:48:44,688 INFO L175 Difference]: Start difference. First operand has 157 places, 203 transitions, 2171 flow. Second operand 8 states and 216 transitions. [2024-05-12 11:48:44,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 260 transitions, 3155 flow [2024-05-12 11:48:44,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 260 transitions, 2986 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-05-12 11:48:44,963 INFO L231 Difference]: Finished difference. Result has 160 places, 209 transitions, 2219 flow [2024-05-12 11:48:44,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2219, PETRI_PLACES=160, PETRI_TRANSITIONS=209} [2024-05-12 11:48:44,964 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 103 predicate places. [2024-05-12 11:48:44,964 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 209 transitions, 2219 flow [2024-05-12 11:48:44,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:44,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:48:44,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:48:44,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 11:48:44,964 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:48:44,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:48:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2070334591, now seen corresponding path program 2 times [2024-05-12 11:48:44,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:48:44,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286882999] [2024-05-12 11:48:44,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:48:44,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:48:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:48:59,025 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:59,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:48:59,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286882999] [2024-05-12 11:48:59,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286882999] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:48:59,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:48:59,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:48:59,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563155554] [2024-05-12 11:48:59,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:48:59,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:48:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:48:59,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:48:59,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:48:59,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:48:59,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 209 transitions, 2219 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:48:59,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:48:59,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:03,356 INFO L124 PetriNetUnfolderBase]: 6251/9711 cut-off events. [2024-05-12 11:49:03,356 INFO L125 PetriNetUnfolderBase]: For 238777/238781 co-relation queries the response was YES. [2024-05-12 11:49:03,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53472 conditions, 9711 events. 6251/9711 cut-off events. For 238777/238781 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 60791 event pairs, 1635 based on Foata normal form. 5/9550 useless extension candidates. Maximal degree in co-relation 53403. Up to 8178 conditions per place. [2024-05-12 11:49:03,441 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 193 selfloop transitions, 60 changer transitions 0/264 dead transitions. [2024-05-12 11:49:03,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 264 transitions, 3183 flow [2024-05-12 11:49:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:49:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:49:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-05-12 11:49:03,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343137254901961 [2024-05-12 11:49:03,442 INFO L175 Difference]: Start difference. First operand has 160 places, 209 transitions, 2219 flow. Second operand 8 states and 218 transitions. [2024-05-12 11:49:03,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 264 transitions, 3183 flow [2024-05-12 11:49:03,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 264 transitions, 3056 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-05-12 11:49:03,754 INFO L231 Difference]: Finished difference. Result has 164 places, 212 transitions, 2272 flow [2024-05-12 11:49:03,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2272, PETRI_PLACES=164, PETRI_TRANSITIONS=212} [2024-05-12 11:49:03,755 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 107 predicate places. [2024-05-12 11:49:03,755 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 212 transitions, 2272 flow [2024-05-12 11:49:03,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:03,755 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,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 11:49:03,756 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:49:03,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash -556229177, now seen corresponding path program 6 times [2024-05-12 11:49:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:03,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120929855] [2024-05-12 11:49:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:49:18,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:18,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120929855] [2024-05-12 11:49:18,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120929855] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:18,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:18,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:49:18,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455535306] [2024-05-12 11:49:18,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:18,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:49:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:18,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:49:18,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:49:18,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:49:18,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 212 transitions, 2272 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:18,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:49:18,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:22,766 INFO L124 PetriNetUnfolderBase]: 6257/9395 cut-off events. [2024-05-12 11:49:22,766 INFO L125 PetriNetUnfolderBase]: For 248511/248515 co-relation queries the response was YES. [2024-05-12 11:49:22,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53424 conditions, 9395 events. 6257/9395 cut-off events. For 248511/248515 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 55812 event pairs, 1466 based on Foata normal form. 6/9353 useless extension candidates. Maximal degree in co-relation 53354. Up to 8503 conditions per place. [2024-05-12 11:49:22,850 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 184 selfloop transitions, 71 changer transitions 0/266 dead transitions. [2024-05-12 11:49:22,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 266 transitions, 3048 flow [2024-05-12 11:49:22,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:49:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:49:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-05-12 11:49:22,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2024-05-12 11:49:22,853 INFO L175 Difference]: Start difference. First operand has 164 places, 212 transitions, 2272 flow. Second operand 8 states and 207 transitions. [2024-05-12 11:49:22,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 266 transitions, 3048 flow [2024-05-12 11:49:23,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 266 transitions, 2949 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-05-12 11:49:23,199 INFO L231 Difference]: Finished difference. Result has 169 places, 221 transitions, 2487 flow [2024-05-12 11:49:23,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2173, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2487, PETRI_PLACES=169, PETRI_TRANSITIONS=221} [2024-05-12 11:49:23,199 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 112 predicate places. [2024-05-12 11:49:23,199 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 221 transitions, 2487 flow [2024-05-12 11:49:23,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:23,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:23,200 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:23,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 11:49:23,200 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:49:23,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:23,200 INFO L85 PathProgramCache]: Analyzing trace with hash -84139281, now seen corresponding path program 3 times [2024-05-12 11:49:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:23,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708699663] [2024-05-12 11:49:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:23,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:36,821 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:36,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:36,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708699663] [2024-05-12 11:49:36,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708699663] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:36,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:36,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:49:36,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650679216] [2024-05-12 11:49:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:36,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:49:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:36,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:49:36,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:49:37,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:49:37,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 221 transitions, 2487 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:37,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:37,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:49:37,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:49:41,305 INFO L124 PetriNetUnfolderBase]: 6274/9774 cut-off events. [2024-05-12 11:49:41,306 INFO L125 PetriNetUnfolderBase]: For 260334/260338 co-relation queries the response was YES. [2024-05-12 11:49:41,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54050 conditions, 9774 events. 6274/9774 cut-off events. For 260334/260338 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 61535 event pairs, 1630 based on Foata normal form. 5/9602 useless extension candidates. Maximal degree in co-relation 53978. Up to 8216 conditions per place. [2024-05-12 11:49:41,386 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 197 selfloop transitions, 65 changer transitions 0/273 dead transitions. [2024-05-12 11:49:41,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 273 transitions, 3301 flow [2024-05-12 11:49:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:49:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:49:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-05-12 11:49:41,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343137254901961 [2024-05-12 11:49:41,399 INFO L175 Difference]: Start difference. First operand has 169 places, 221 transitions, 2487 flow. Second operand 8 states and 218 transitions. [2024-05-12 11:49:41,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 273 transitions, 3301 flow [2024-05-12 11:49:41,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 273 transitions, 3147 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-05-12 11:49:41,706 INFO L231 Difference]: Finished difference. Result has 174 places, 221 transitions, 2471 flow [2024-05-12 11:49:41,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2333, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2471, PETRI_PLACES=174, PETRI_TRANSITIONS=221} [2024-05-12 11:49:41,707 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 117 predicate places. [2024-05-12 11:49:41,707 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 221 transitions, 2471 flow [2024-05-12 11:49:41,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:41,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:49:41,707 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:41,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 11:49:41,708 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:49:41,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:49:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash -756221473, now seen corresponding path program 1 times [2024-05-12 11:49:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:49:41,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481453892] [2024-05-12 11:49:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:49:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:49:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:49:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:49:59,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:49:59,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481453892] [2024-05-12 11:49:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481453892] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:49:59,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:49:59,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:49:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365981091] [2024-05-12 11:49:59,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:49:59,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:49:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:49:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:49:59,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:49:59,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:49:59,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 221 transitions, 2471 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:49:59,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:49:59,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:49:59,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:03,812 INFO L124 PetriNetUnfolderBase]: 7008/10992 cut-off events. [2024-05-12 11:50:03,812 INFO L125 PetriNetUnfolderBase]: For 308150/308172 co-relation queries the response was YES. [2024-05-12 11:50:03,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60163 conditions, 10992 events. 7008/10992 cut-off events. For 308150/308172 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 70292 event pairs, 2079 based on Foata normal form. 15/10782 useless extension candidates. Maximal degree in co-relation 60090. Up to 9738 conditions per place. [2024-05-12 11:50:03,911 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 208 selfloop transitions, 19 changer transitions 0/260 dead transitions. [2024-05-12 11:50:03,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 260 transitions, 3187 flow [2024-05-12 11:50:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:50:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:50:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-05-12 11:50:03,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-05-12 11:50:03,913 INFO L175 Difference]: Start difference. First operand has 174 places, 221 transitions, 2471 flow. Second operand 7 states and 170 transitions. [2024-05-12 11:50:03,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 260 transitions, 3187 flow [2024-05-12 11:50:04,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 260 transitions, 3008 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 11:50:04,315 INFO L231 Difference]: Finished difference. Result has 174 places, 231 transitions, 2465 flow [2024-05-12 11:50:04,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2465, PETRI_PLACES=174, PETRI_TRANSITIONS=231} [2024-05-12 11:50:04,315 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 117 predicate places. [2024-05-12 11:50:04,315 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 231 transitions, 2465 flow [2024-05-12 11:50:04,316 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:04,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:04,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:04,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 11:50:04,316 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:50:04,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:04,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1381064279, now seen corresponding path program 7 times [2024-05-12 11:50:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:04,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274434579] [2024-05-12 11:50:04,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:04,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:50:18,941 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:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:50:18,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274434579] [2024-05-12 11:50:18,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274434579] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:50:18,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:50:18,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:50:18,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937984968] [2024-05-12 11:50:18,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:50:18,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:50:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:50:18,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:50:18,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:50:19,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:50:19,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 231 transitions, 2465 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:19,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:50:19,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:50:19,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:23,450 INFO L124 PetriNetUnfolderBase]: 6358/9926 cut-off events. [2024-05-12 11:50:23,451 INFO L125 PetriNetUnfolderBase]: For 285710/285714 co-relation queries the response was YES. [2024-05-12 11:50:23,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56026 conditions, 9926 events. 6358/9926 cut-off events. For 285710/285714 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 62962 event pairs, 2007 based on Foata normal form. 6/9765 useless extension candidates. Maximal degree in co-relation 55951. Up to 8882 conditions per place. [2024-05-12 11:50:23,542 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 228 selfloop transitions, 33 changer transitions 0/272 dead transitions. [2024-05-12 11:50:23,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 272 transitions, 3111 flow [2024-05-12 11:50:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:50:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:50:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-05-12 11:50:23,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4877450980392157 [2024-05-12 11:50:23,548 INFO L175 Difference]: Start difference. First operand has 174 places, 231 transitions, 2465 flow. Second operand 8 states and 199 transitions. [2024-05-12 11:50:23,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 272 transitions, 3111 flow [2024-05-12 11:50:23,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 272 transitions, 3036 flow, removed 34 selfloop flow, removed 2 redundant places. [2024-05-12 11:50:23,891 INFO L231 Difference]: Finished difference. Result has 180 places, 231 transitions, 2465 flow [2024-05-12 11:50:23,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2390, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2465, PETRI_PLACES=180, PETRI_TRANSITIONS=231} [2024-05-12 11:50:23,892 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 123 predicate places. [2024-05-12 11:50:23,892 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 231 transitions, 2465 flow [2024-05-12 11:50:23,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:23,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:23,892 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:23,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 11:50:23,893 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:50:23,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:23,893 INFO L85 PathProgramCache]: Analyzing trace with hash -654789111, now seen corresponding path program 4 times [2024-05-12 11:50:23,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:23,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47620781] [2024-05-12 11:50:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:23,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:50:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:50:38,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:50:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47620781] [2024-05-12 11:50:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47620781] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:50:38,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:50:38,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:50:38,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666836288] [2024-05-12 11:50:38,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:50:38,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:50:38,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:50:38,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:50:38,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:50:38,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:50:38,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 231 transitions, 2465 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:38,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:50:38,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:50:38,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:50:42,631 INFO L124 PetriNetUnfolderBase]: 6460/10079 cut-off events. [2024-05-12 11:50:42,631 INFO L125 PetriNetUnfolderBase]: For 304644/304648 co-relation queries the response was YES. [2024-05-12 11:50:42,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57365 conditions, 10079 events. 6460/10079 cut-off events. For 304644/304648 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 64024 event pairs, 2029 based on Foata normal form. 8/9920 useless extension candidates. Maximal degree in co-relation 57288. Up to 8848 conditions per place. [2024-05-12 11:50:42,723 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 237 selfloop transitions, 35 changer transitions 0/283 dead transitions. [2024-05-12 11:50:42,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 283 transitions, 3537 flow [2024-05-12 11:50:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:50:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:50:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-05-12 11:50:42,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2024-05-12 11:50:42,727 INFO L175 Difference]: Start difference. First operand has 180 places, 231 transitions, 2465 flow. Second operand 8 states and 208 transitions. [2024-05-12 11:50:42,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 283 transitions, 3537 flow [2024-05-12 11:50:43,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 283 transitions, 3312 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-05-12 11:50:43,136 INFO L231 Difference]: Finished difference. Result has 179 places, 237 transitions, 2422 flow [2024-05-12 11:50:43,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2422, PETRI_PLACES=179, PETRI_TRANSITIONS=237} [2024-05-12 11:50:43,145 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 122 predicate places. [2024-05-12 11:50:43,145 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 237 transitions, 2422 flow [2024-05-12 11:50:43,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:43,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:50:43,145 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:43,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 11:50:43,146 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:50:43,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:50:43,146 INFO L85 PathProgramCache]: Analyzing trace with hash -645621171, now seen corresponding path program 5 times [2024-05-12 11:50:43,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:50:43,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152372643] [2024-05-12 11:50:43,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:50:43,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:50:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:50:57,420 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:57,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:50:57,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152372643] [2024-05-12 11:50:57,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152372643] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:50:57,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:50:57,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:50:57,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687918819] [2024-05-12 11:50:57,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:50:57,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:50:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:50:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:50:57,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:50:57,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:50:57,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 237 transitions, 2422 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:57,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:50:57,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:50:57,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:51:01,994 INFO L124 PetriNetUnfolderBase]: 6450/10077 cut-off events. [2024-05-12 11:51:01,994 INFO L125 PetriNetUnfolderBase]: For 313979/313983 co-relation queries the response was YES. [2024-05-12 11:51:02,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57214 conditions, 10077 events. 6450/10077 cut-off events. For 313979/313983 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 64132 event pairs, 2037 based on Foata normal form. 8/9914 useless extension candidates. Maximal degree in co-relation 57138. Up to 8989 conditions per place. [2024-05-12 11:51:02,084 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 242 selfloop transitions, 23 changer transitions 0/276 dead transitions. [2024-05-12 11:51:02,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 276 transitions, 3066 flow [2024-05-12 11:51:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:51:02,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:51:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-05-12 11:51:02,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2024-05-12 11:51:02,086 INFO L175 Difference]: Start difference. First operand has 179 places, 237 transitions, 2422 flow. Second operand 8 states and 198 transitions. [2024-05-12 11:51:02,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 276 transitions, 3066 flow [2024-05-12 11:51:02,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 276 transitions, 2894 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-05-12 11:51:02,529 INFO L231 Difference]: Finished difference. Result has 181 places, 237 transitions, 2304 flow [2024-05-12 11:51:02,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2304, PETRI_PLACES=181, PETRI_TRANSITIONS=237} [2024-05-12 11:51:02,529 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 124 predicate places. [2024-05-12 11:51:02,530 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 237 transitions, 2304 flow [2024-05-12 11:51:02,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:02,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:51:02,530 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:02,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 11:51:02,530 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:51:02,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:51:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash -654795621, now seen corresponding path program 6 times [2024-05-12 11:51:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:51:02,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685769699] [2024-05-12 11:51:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:51:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:51:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:51:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:51:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:51:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685769699] [2024-05-12 11:51:15,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685769699] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:51:15,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:51:15,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:51:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576195274] [2024-05-12 11:51:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:51:15,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:51:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:51:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:51:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:51:16,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:51:16,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 237 transitions, 2304 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:16,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:51:16,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:51:16,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:51:20,284 INFO L124 PetriNetUnfolderBase]: 6440/10045 cut-off events. [2024-05-12 11:51:20,285 INFO L125 PetriNetUnfolderBase]: For 319308/319312 co-relation queries the response was YES. [2024-05-12 11:51:20,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56782 conditions, 10045 events. 6440/10045 cut-off events. For 319308/319312 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 63655 event pairs, 2014 based on Foata normal form. 8/9887 useless extension candidates. Maximal degree in co-relation 56705. Up to 8832 conditions per place. [2024-05-12 11:51:20,386 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 232 selfloop transitions, 36 changer transitions 0/279 dead transitions. [2024-05-12 11:51:20,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 279 transitions, 2972 flow [2024-05-12 11:51:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:51:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:51:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:51:20,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49754901960784315 [2024-05-12 11:51:20,388 INFO L175 Difference]: Start difference. First operand has 181 places, 237 transitions, 2304 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:51:20,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 279 transitions, 2972 flow [2024-05-12 11:51:20,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 279 transitions, 2884 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-05-12 11:51:20,875 INFO L231 Difference]: Finished difference. Result has 182 places, 237 transitions, 2296 flow [2024-05-12 11:51:20,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2216, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2296, PETRI_PLACES=182, PETRI_TRANSITIONS=237} [2024-05-12 11:51:20,876 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 125 predicate places. [2024-05-12 11:51:20,876 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 237 transitions, 2296 flow [2024-05-12 11:51:20,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:20,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:51:20,876 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:20,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 11:51:20,876 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:51:20,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:51:20,877 INFO L85 PathProgramCache]: Analyzing trace with hash -741966433, now seen corresponding path program 2 times [2024-05-12 11:51:20,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:51:20,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594407272] [2024-05-12 11:51:20,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:51:20,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:51:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:51:39,430 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:39,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:51:39,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594407272] [2024-05-12 11:51:39,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594407272] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:51:39,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:51:39,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:51:39,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255199586] [2024-05-12 11:51:39,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:51:39,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:51:39,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:51:39,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:51:39,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:51:39,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:51:39,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 237 transitions, 2296 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:51:39,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:51:39,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:51:39,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:51:44,084 INFO L124 PetriNetUnfolderBase]: 7164/11250 cut-off events. [2024-05-12 11:51:44,084 INFO L125 PetriNetUnfolderBase]: For 373389/373419 co-relation queries the response was YES. [2024-05-12 11:51:44,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62658 conditions, 11250 events. 7164/11250 cut-off events. For 373389/373419 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 72483 event pairs, 2442 based on Foata normal form. 15/11057 useless extension candidates. Maximal degree in co-relation 62580. Up to 9997 conditions per place. [2024-05-12 11:51:44,191 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 208 selfloop transitions, 13 changer transitions 0/254 dead transitions. [2024-05-12 11:51:44,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 254 transitions, 2786 flow [2024-05-12 11:51:44,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:51:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:51:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-05-12 11:51:44,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2024-05-12 11:51:44,197 INFO L175 Difference]: Start difference. First operand has 182 places, 237 transitions, 2296 flow. Second operand 6 states and 141 transitions. [2024-05-12 11:51:44,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 254 transitions, 2786 flow [2024-05-12 11:51:44,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 254 transitions, 2649 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-05-12 11:51:44,566 INFO L231 Difference]: Finished difference. Result has 180 places, 237 transitions, 2191 flow [2024-05-12 11:51:44,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2159, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2191, PETRI_PLACES=180, PETRI_TRANSITIONS=237} [2024-05-12 11:51:44,567 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 123 predicate places. [2024-05-12 11:51:44,567 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 237 transitions, 2191 flow [2024-05-12 11:51:44,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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:51:44,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:51:44,567 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:44,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 11:51:44,568 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:51:44,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:51:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash -749578080, now seen corresponding path program 1 times [2024-05-12 11:51:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:51:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006649960] [2024-05-12 11:51:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:51:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:51:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:05,161 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:05,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:05,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006649960] [2024-05-12 11:52:05,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006649960] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:05,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:05,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:52:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183972304] [2024-05-12 11:52:05,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:05,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:52:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:05,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:52:05,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:52:05,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:52:05,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 237 transitions, 2191 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:52:05,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:05,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:52:05,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:09,984 INFO L124 PetriNetUnfolderBase]: 7181/11284 cut-off events. [2024-05-12 11:52:09,984 INFO L125 PetriNetUnfolderBase]: For 386533/386563 co-relation queries the response was YES. [2024-05-12 11:52:10,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62588 conditions, 11284 events. 7181/11284 cut-off events. For 386533/386563 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 72690 event pairs, 2428 based on Foata normal form. 15/11088 useless extension candidates. Maximal degree in co-relation 62509. Up to 9983 conditions per place. [2024-05-12 11:52:10,087 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 210 selfloop transitions, 24 changer transitions 0/267 dead transitions. [2024-05-12 11:52:10,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 267 transitions, 2879 flow [2024-05-12 11:52:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:52:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:52:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-05-12 11:52:10,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869281045751634 [2024-05-12 11:52:10,089 INFO L175 Difference]: Start difference. First operand has 180 places, 237 transitions, 2191 flow. Second operand 6 states and 149 transitions. [2024-05-12 11:52:10,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 267 transitions, 2879 flow [2024-05-12 11:52:10,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 267 transitions, 2841 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 11:52:10,465 INFO L231 Difference]: Finished difference. Result has 181 places, 243 transitions, 2278 flow [2024-05-12 11:52:10,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2153, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2278, PETRI_PLACES=181, PETRI_TRANSITIONS=243} [2024-05-12 11:52:10,466 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 124 predicate places. [2024-05-12 11:52:10,466 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 243 transitions, 2278 flow [2024-05-12 11:52:10,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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:52:10,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:10,467 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:10,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 11:52:10,467 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:10,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1666335676, now seen corresponding path program 1 times [2024-05-12 11:52:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:10,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911297739] [2024-05-12 11:52:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:28,378 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:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:28,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911297739] [2024-05-12 11:52:28,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911297739] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:28,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:28,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:52:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782616423] [2024-05-12 11:52:28,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:28,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:52:28,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:28,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:52:28,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:52:28,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:52:28,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 243 transitions, 2278 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:28,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:28,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:52:28,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:52:33,631 INFO L124 PetriNetUnfolderBase]: 7488/11647 cut-off events. [2024-05-12 11:52:33,631 INFO L125 PetriNetUnfolderBase]: For 405878/405878 co-relation queries the response was YES. [2024-05-12 11:52:33,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65445 conditions, 11647 events. 7488/11647 cut-off events. For 405878/405878 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 74081 event pairs, 2401 based on Foata normal form. 4/11425 useless extension candidates. Maximal degree in co-relation 65365. Up to 10426 conditions per place. [2024-05-12 11:52:33,752 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 251 selfloop transitions, 27 changer transitions 0/288 dead transitions. [2024-05-12 11:52:33,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 288 transitions, 2996 flow [2024-05-12 11:52:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:52:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:52:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-05-12 11:52:33,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730392156862745 [2024-05-12 11:52:33,754 INFO L175 Difference]: Start difference. First operand has 181 places, 243 transitions, 2278 flow. Second operand 8 states and 193 transitions. [2024-05-12 11:52:33,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 288 transitions, 2996 flow [2024-05-12 11:52:34,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 288 transitions, 2953 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-05-12 11:52:34,187 INFO L231 Difference]: Finished difference. Result has 187 places, 245 transitions, 2342 flow [2024-05-12 11:52:34,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2342, PETRI_PLACES=187, PETRI_TRANSITIONS=245} [2024-05-12 11:52:34,188 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 130 predicate places. [2024-05-12 11:52:34,188 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 245 transitions, 2342 flow [2024-05-12 11:52:34,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:34,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:52:34,189 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:34,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 11:52:34,189 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:52:34,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:52:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash 532499460, now seen corresponding path program 2 times [2024-05-12 11:52:34,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:52:34,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334190803] [2024-05-12 11:52:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:52:34,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:52:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:52:56,628 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:56,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:52:56,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334190803] [2024-05-12 11:52:56,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334190803] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:52:56,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:52:56,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:52:56,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936769426] [2024-05-12 11:52:56,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:52:56,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:52:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:52:56,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:52:56,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:52:56,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-05-12 11:52:56,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 245 transitions, 2342 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:52:56,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:52:56,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-05-12 11:52:56,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:01,370 INFO L124 PetriNetUnfolderBase]: 7171/11267 cut-off events. [2024-05-12 11:53:01,371 INFO L125 PetriNetUnfolderBase]: For 418601/418635 co-relation queries the response was YES. [2024-05-12 11:53:01,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64302 conditions, 11267 events. 7171/11267 cut-off events. For 418601/418635 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 72576 event pairs, 2423 based on Foata normal form. 19/11076 useless extension candidates. Maximal degree in co-relation 64220. Up to 9969 conditions per place. [2024-05-12 11:53:01,484 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 208 selfloop transitions, 24 changer transitions 0/265 dead transitions. [2024-05-12 11:53:01,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 265 transitions, 2870 flow [2024-05-12 11:53:01,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:53:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:53:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-05-12 11:53:01,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738562091503268 [2024-05-12 11:53:01,486 INFO L175 Difference]: Start difference. First operand has 187 places, 245 transitions, 2342 flow. Second operand 6 states and 145 transitions. [2024-05-12 11:53:01,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 265 transitions, 2870 flow [2024-05-12 11:53:01,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 265 transitions, 2769 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-05-12 11:53:01,976 INFO L231 Difference]: Finished difference. Result has 187 places, 245 transitions, 2296 flow [2024-05-12 11:53:01,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2296, PETRI_PLACES=187, PETRI_TRANSITIONS=245} [2024-05-12 11:53:01,977 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 130 predicate places. [2024-05-12 11:53:01,977 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 245 transitions, 2296 flow [2024-05-12 11:53:01,977 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:53:01,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:01,978 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:01,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 11:53:01,978 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:01,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash 532509380, now seen corresponding path program 1 times [2024-05-12 11:53:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797043266] [2024-05-12 11:53:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:24,924 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:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797043266] [2024-05-12 11:53:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797043266] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:24,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:53:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483814846] [2024-05-12 11:53:24,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:24,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:53:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:24,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:53:24,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:53:25,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-05-12 11:53:25,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 245 transitions, 2296 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:25,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:25,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-05-12 11:53:25,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:29,843 INFO L124 PetriNetUnfolderBase]: 7699/11797 cut-off events. [2024-05-12 11:53:29,843 INFO L125 PetriNetUnfolderBase]: For 433925/433955 co-relation queries the response was YES. [2024-05-12 11:53:29,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66546 conditions, 11797 events. 7699/11797 cut-off events. For 433925/433955 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 73317 event pairs, 2680 based on Foata normal form. 17/11620 useless extension candidates. Maximal degree in co-relation 66463. Up to 10788 conditions per place. [2024-05-12 11:53:29,962 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 223 selfloop transitions, 20 changer transitions 0/274 dead transitions. [2024-05-12 11:53:29,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 274 transitions, 2898 flow [2024-05-12 11:53:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:53:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:53:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-05-12 11:53:29,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481792717086835 [2024-05-12 11:53:29,964 INFO L175 Difference]: Start difference. First operand has 187 places, 245 transitions, 2296 flow. Second operand 7 states and 160 transitions. [2024-05-12 11:53:29,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 274 transitions, 2898 flow [2024-05-12 11:53:30,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 274 transitions, 2825 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 11:53:30,377 INFO L231 Difference]: Finished difference. Result has 188 places, 248 transitions, 2315 flow [2024-05-12 11:53:30,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2223, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2315, PETRI_PLACES=188, PETRI_TRANSITIONS=248} [2024-05-12 11:53:30,378 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 131 predicate places. [2024-05-12 11:53:30,378 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 248 transitions, 2315 flow [2024-05-12 11:53:30,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:30,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:30,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:53:30,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 11:53:30,379 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:30,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash 563630326, now seen corresponding path program 1 times [2024-05-12 11:53:30,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:30,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660635] [2024-05-12 11:53:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:30,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15