./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix015.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 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/mix015.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix015.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m [2024-06-20 18:30:57,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 18:30:57,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 18:30:57,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 18:30:57,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 18:30:57,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 18:30:57,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 18:30:57,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 18:30:57,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 18:30:57,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 18:30:57,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 18:30:57,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 18:30:57,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 18:30:57,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 18:30:57,763 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 18:30:57,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 18:30:57,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 18:30:57,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 18:30:57,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 18:30:57,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 18:30:57,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 18:30:57,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 18:30:57,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 18:30:57,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 18:30:57,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 18:30:57,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 18:30:57,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 18:30:57,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 18:30:57,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 18:30:57,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 18:30:57,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 18:30:57,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 18:30:57,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:30:57,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 18:30:57,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 18:30:57,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 18:30:57,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 18:30:57,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 18:30:57,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 18:30:57,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 18:30:57,769 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 18:30:57,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 18:30:57,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 18:30:57,770 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-20 18:30:57,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 18:30:58,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 18:30:58,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 18:30:58,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 18:30:58,004 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 18:30:58,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2024-06-20 18:30:58,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 18:30:59,232 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 18:30:59,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2024-06-20 18:30:59,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47043161b/4c53cbff37ef4892b7d3353aed4d2fb7/FLAG772aa6b56 [2024-06-20 18:30:59,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47043161b/4c53cbff37ef4892b7d3353aed4d2fb7 [2024-06-20 18:30:59,260 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 18:30:59,260 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 18:30:59,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix015.oepc.yml/witness.yml [2024-06-20 18:30:59,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 18:30:59,447 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 18:30:59,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 18:30:59,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 18:30:59,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 18:30:59,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:30:59" (1/2) ... [2024-06-20 18:30:59,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a1b6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:30:59, skipping insertion in model container [2024-06-20 18:30:59,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:30:59" (1/2) ... [2024-06-20 18:30:59,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f63d543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:30:59, skipping insertion in model container [2024-06-20 18:30:59,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:30:59" (2/2) ... [2024-06-20 18:30:59,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a1b6f9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:30:59, skipping insertion in model container [2024-06-20 18:30:59,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:30:59" (2/2) ... [2024-06-20 18:30:59,456 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 18:30:59,534 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 18:30:59,535 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((! multithreaded || a$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$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_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$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 )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$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 )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$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 )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0) [2024-06-20 18:30:59,536 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] ((((((((((((((((((((((! multithreaded || a$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$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_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$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 )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$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 )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$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 )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0) [2024-06-20 18:30:59,537 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] ((((((((((((((((((((((! multithreaded || a$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$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_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$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 )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$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 )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$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 )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0) [2024-06-20 18:30:59,538 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 18:30:59,538 INFO L106 edCorrectnessWitness]: ghost_update [L851-L851] multithreaded = 1; [2024-06-20 18:30:59,575 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 18:30:59,823 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:30:59,831 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 18:31:00,223 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:31:00,254 INFO L206 MainTranslator]: Completed translation [2024-06-20 18:31:00,255 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00 WrapperNode [2024-06-20 18:31:00,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 18:31:00,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 18:31:00,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 18:31:00,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 18:31:00,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,484 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2024-06-20 18:31:00,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 18:31:00,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 18:31:00,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 18:31:00,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 18:31:00,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,645 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-20 18:31:00,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 18:31:00,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 18:31:00,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 18:31:00,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 18:31:00,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (1/1) ... [2024-06-20 18:31:00,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:31:00,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:31:00,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-20 18:31:00,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-20 18:31:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 18:31:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 18:31:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 18:31:00,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 18:31:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 18:31:00,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 18:31:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-20 18:31:00,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-20 18:31:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 18:31:00,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 18:31:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 18:31:00,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 18:31:00,805 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 18:31:00,943 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 18:31:00,945 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 18:31:02,284 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 18:31:02,286 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 18:31:02,593 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 18:31:02,594 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 18:31:02,594 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:31:02 BoogieIcfgContainer [2024-06-20 18:31:02,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 18:31:02,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 18:31:02,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 18:31:02,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 18:31:02,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:30:59" (1/4) ... [2024-06-20 18:31:02,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e4a053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:31:02, skipping insertion in model container [2024-06-20 18:31:02,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:30:59" (2/4) ... [2024-06-20 18:31:02,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e4a053 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:31:02, skipping insertion in model container [2024-06-20 18:31:02,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:31:00" (3/4) ... [2024-06-20 18:31:02,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e4a053 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:31:02, skipping insertion in model container [2024-06-20 18:31:02,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:31:02" (4/4) ... [2024-06-20 18:31:02,602 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2024-06-20 18:31:02,615 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 18:31:02,616 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-20 18:31:02,616 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 18:31:02,746 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 18:31:02,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow [2024-06-20 18:31:02,842 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-06-20 18:31:02,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:31:02,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 18:31:02,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow [2024-06-20 18:31:02,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2024-06-20 18:31:02,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 18:31:02,866 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;@706a83eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 18:31:02,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-20 18:31:02,876 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 18:31:02,876 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-20 18:31:02,876 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:31:02,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:02,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 18:31:02,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:31:02,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash 381748823, now seen corresponding path program 1 times [2024-06-20 18:31:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:02,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341980677] [2024-06-20 18:31:02,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:02,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:31:10,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:10,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341980677] [2024-06-20 18:31:10,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341980677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:10,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:10,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 18:31:10,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558831211] [2024-06-20 18:31:10,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:10,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:31:10,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:10,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:31:10,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:31:10,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-20 18:31:10,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:10,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:10,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-20 18:31:10,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:11,824 INFO L124 PetriNetUnfolderBase]: 1363/2133 cut-off events. [2024-06-20 18:31:11,824 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-06-20 18:31:11,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4257 conditions, 2133 events. 1363/2133 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10835 event pairs, 964 based on Foata normal form. 1/2085 useless extension candidates. Maximal degree in co-relation 4245. Up to 2037 conditions per place. [2024-06-20 18:31:11,839 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-20 18:31:11,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 175 flow [2024-06-20 18:31:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:31:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:31:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-06-20 18:31:11,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2024-06-20 18:31:11,851 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 81 transitions. [2024-06-20 18:31:11,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 175 flow [2024-06-20 18:31:11,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-20 18:31:11,856 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow [2024-06-20 18:31:11,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-20 18:31:11,861 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-06-20 18:31:11,861 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow [2024-06-20 18:31:11,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:11,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:11,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:11,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 18:31:11,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:31:11,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1788670246, now seen corresponding path program 1 times [2024-06-20 18:31:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:11,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893701757] [2024-06-20 18:31:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:31:18,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893701757] [2024-06-20 18:31:18,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893701757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:18,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:18,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 18:31:18,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71449748] [2024-06-20 18:31:18,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:18,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:31:18,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:18,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:31:18,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:31:18,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-20 18:31:18,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:18,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:18,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-20 18:31:18,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:19,409 INFO L124 PetriNetUnfolderBase]: 1357/2124 cut-off events. [2024-06-20 18:31:19,409 INFO L125 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2024-06-20 18:31:19,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4791 conditions, 2124 events. 1357/2124 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10768 event pairs, 840 based on Foata normal form. 3/2112 useless extension candidates. Maximal degree in co-relation 4779. Up to 2013 conditions per place. [2024-06-20 18:31:19,419 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 39 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-06-20 18:31:19,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 242 flow [2024-06-20 18:31:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:31:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:31:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-06-20 18:31:19,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2024-06-20 18:31:19,422 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 105 transitions. [2024-06-20 18:31:19,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 242 flow [2024-06-20 18:31:19,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:31:19,424 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow [2024-06-20 18:31:19,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-06-20 18:31:19,425 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2024-06-20 18:31:19,425 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow [2024-06-20 18:31:19,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:19,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:19,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:19,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 18:31:19,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:31:19,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:19,427 INFO L85 PathProgramCache]: Analyzing trace with hash -385795884, now seen corresponding path program 1 times [2024-06-20 18:31:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:19,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344420577] [2024-06-20 18:31:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:19,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:31:25,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:25,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344420577] [2024-06-20 18:31:25,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344420577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:25,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:25,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:31:25,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807484337] [2024-06-20 18:31:25,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:25,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 18:31:25,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:25,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 18:31:25,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 18:31:25,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-20 18:31:25,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:25,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:25,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-20 18:31:25,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:27,103 INFO L124 PetriNetUnfolderBase]: 1598/2489 cut-off events. [2024-06-20 18:31:27,103 INFO L125 PetriNetUnfolderBase]: For 1293/1293 co-relation queries the response was YES. [2024-06-20 18:31:27,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6201 conditions, 2489 events. 1598/2489 cut-off events. For 1293/1293 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12532 event pairs, 915 based on Foata normal form. 3/2478 useless extension candidates. Maximal degree in co-relation 6187. Up to 2350 conditions per place. [2024-06-20 18:31:27,115 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 47 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-20 18:31:27,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 322 flow [2024-06-20 18:31:27,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:31:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:31:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-06-20 18:31:27,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2024-06-20 18:31:27,117 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 125 transitions. [2024-06-20 18:31:27,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 322 flow [2024-06-20 18:31:27,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 308 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-20 18:31:27,119 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 176 flow [2024-06-20 18:31:27,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-06-20 18:31:27,120 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2024-06-20 18:31:27,120 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 176 flow [2024-06-20 18:31:27,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:27,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:27,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:27,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 18:31:27,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:31:27,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash 703585813, now seen corresponding path program 1 times [2024-06-20 18:31:27,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544556308] [2024-06-20 18:31:27,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:31:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544556308] [2024-06-20 18:31:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544556308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:33,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:33,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:31:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139209320] [2024-06-20 18:31:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:33,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:31:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:33,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:31:33,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:31:33,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-20 18:31:33,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:33,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:33,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-20 18:31:33,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:34,795 INFO L124 PetriNetUnfolderBase]: 1592/2479 cut-off events. [2024-06-20 18:31:34,795 INFO L125 PetriNetUnfolderBase]: For 2422/2422 co-relation queries the response was YES. [2024-06-20 18:31:34,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6771 conditions, 2479 events. 1592/2479 cut-off events. For 2422/2422 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12511 event pairs, 791 based on Foata normal form. 3/2474 useless extension candidates. Maximal degree in co-relation 6756. Up to 2326 conditions per place. [2024-06-20 18:31:34,808 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 54 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2024-06-20 18:31:34,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 400 flow [2024-06-20 18:31:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:31:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:31:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-20 18:31:34,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5736434108527132 [2024-06-20 18:31:34,810 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 176 flow. Second operand 6 states and 148 transitions. [2024-06-20 18:31:34,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 400 flow [2024-06-20 18:31:34,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 376 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 18:31:34,812 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 212 flow [2024-06-20 18:31:34,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-20 18:31:34,813 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2024-06-20 18:31:34,813 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 212 flow [2024-06-20 18:31:34,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:34,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:34,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:34,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 18:31:34,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:31:34,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:34,814 INFO L85 PathProgramCache]: Analyzing trace with hash -472018907, now seen corresponding path program 1 times [2024-06-20 18:31:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:34,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541626491] [2024-06-20 18:31:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:34,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:31:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541626491] [2024-06-20 18:31:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541626491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:48,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:48,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:31:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980643240] [2024-06-20 18:31:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:48,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:31:48,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:48,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:31:48,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:31:48,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-20 18:31:48,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:48,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:48,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-20 18:31:48,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:31:50,151 INFO L124 PetriNetUnfolderBase]: 1740/2794 cut-off events. [2024-06-20 18:31:50,152 INFO L125 PetriNetUnfolderBase]: For 4262/4262 co-relation queries the response was YES. [2024-06-20 18:31:50,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8073 conditions, 2794 events. 1740/2794 cut-off events. For 4262/4262 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14479 event pairs, 933 based on Foata normal form. 4/2798 useless extension candidates. Maximal degree in co-relation 8056. Up to 2573 conditions per place. [2024-06-20 18:31:50,164 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 46 selfloop transitions, 8 changer transitions 0/61 dead transitions. [2024-06-20 18:31:50,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 366 flow [2024-06-20 18:31:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:31:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:31:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-06-20 18:31:50,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790697674418605 [2024-06-20 18:31:50,165 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 212 flow. Second operand 5 states and 103 transitions. [2024-06-20 18:31:50,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 366 flow [2024-06-20 18:31:50,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 332 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-20 18:31:50,168 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 224 flow [2024-06-20 18:31:50,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2024-06-20 18:31:50,169 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2024-06-20 18:31:50,169 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 224 flow [2024-06-20 18:31:50,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:50,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:31:50,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:31:50,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 18:31:50,170 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:31:50,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:31:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145652, now seen corresponding path program 1 times [2024-06-20 18:31:50,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:31:50,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356991150] [2024-06-20 18:31:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:31:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:31:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:31:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:31:58,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:31:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356991150] [2024-06-20 18:31:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356991150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:31:58,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:31:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:31:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579688747] [2024-06-20 18:31:58,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:31:58,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:31:58,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:31:58,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:31:58,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:31:59,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-20 18:31:59,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:31:59,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:31:59,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-20 18:31:59,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:00,643 INFO L124 PetriNetUnfolderBase]: 1817/2858 cut-off events. [2024-06-20 18:32:00,644 INFO L125 PetriNetUnfolderBase]: For 5804/5804 co-relation queries the response was YES. [2024-06-20 18:32:00,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8875 conditions, 2858 events. 1817/2858 cut-off events. For 5804/5804 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14491 event pairs, 724 based on Foata normal form. 3/2861 useless extension candidates. Maximal degree in co-relation 8857. Up to 2625 conditions per place. [2024-06-20 18:32:00,657 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 72 selfloop transitions, 19 changer transitions 0/97 dead transitions. [2024-06-20 18:32:00,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 97 transitions, 548 flow [2024-06-20 18:32:00,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:32:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:32:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-06-20 18:32:00,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5436046511627907 [2024-06-20 18:32:00,658 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 224 flow. Second operand 8 states and 187 transitions. [2024-06-20 18:32:00,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 97 transitions, 548 flow [2024-06-20 18:32:00,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 526 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-20 18:32:00,661 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 296 flow [2024-06-20 18:32:00,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=296, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-06-20 18:32:00,662 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2024-06-20 18:32:00,662 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 296 flow [2024-06-20 18:32:00,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:00,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:00,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:00,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 18:32:00,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:32:00,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:00,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1752530566, now seen corresponding path program 1 times [2024-06-20 18:32:00,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:00,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938434745] [2024-06-20 18:32:00,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:32:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:32:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:32:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938434745] [2024-06-20 18:32:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938434745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:32:13,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:32:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:32:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229056802] [2024-06-20 18:32:13,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:32:13,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:32:13,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:32:13,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:32:13,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:32:13,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-20 18:32:13,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:13,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:32:13,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-20 18:32:13,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:14,768 INFO L124 PetriNetUnfolderBase]: 1772/2823 cut-off events. [2024-06-20 18:32:14,769 INFO L125 PetriNetUnfolderBase]: For 8227/8227 co-relation queries the response was YES. [2024-06-20 18:32:14,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9555 conditions, 2823 events. 1772/2823 cut-off events. For 8227/8227 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14556 event pairs, 679 based on Foata normal form. 4/2826 useless extension candidates. Maximal degree in co-relation 9535. Up to 2571 conditions per place. [2024-06-20 18:32:14,782 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 63 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2024-06-20 18:32:14,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 86 transitions, 586 flow [2024-06-20 18:32:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:32:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:32:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-06-20 18:32:14,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-20 18:32:14,784 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 296 flow. Second operand 6 states and 129 transitions. [2024-06-20 18:32:14,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 86 transitions, 586 flow [2024-06-20 18:32:14,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 536 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-20 18:32:14,787 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 358 flow [2024-06-20 18:32:14,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2024-06-20 18:32:14,788 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2024-06-20 18:32:14,788 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 358 flow [2024-06-20 18:32:14,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:14,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:14,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:14,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 18:32:14,789 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:32:14,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1546372782, now seen corresponding path program 1 times [2024-06-20 18:32:14,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:14,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671566645] [2024-06-20 18:32:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:32:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:32:23,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:32:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671566645] [2024-06-20 18:32:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671566645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:32:23,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:32:23,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:32:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916524844] [2024-06-20 18:32:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:32:23,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:32:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:32:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:32:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:32:23,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-20 18:32:23,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 358 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 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-06-20 18:32:23,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:32:23,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-20 18:32:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:25,119 INFO L124 PetriNetUnfolderBase]: 1846/2876 cut-off events. [2024-06-20 18:32:25,119 INFO L125 PetriNetUnfolderBase]: For 10861/10861 co-relation queries the response was YES. [2024-06-20 18:32:25,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10546 conditions, 2876 events. 1846/2876 cut-off events. For 10861/10861 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14486 event pairs, 554 based on Foata normal form. 6/2882 useless extension candidates. Maximal degree in co-relation 10524. Up to 2635 conditions per place. [2024-06-20 18:32:25,131 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 85 selfloop transitions, 21 changer transitions 0/112 dead transitions. [2024-06-20 18:32:25,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 112 transitions, 706 flow [2024-06-20 18:32:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:32:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:32:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2024-06-20 18:32:25,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297157622739018 [2024-06-20 18:32:25,135 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 358 flow. Second operand 9 states and 205 transitions. [2024-06-20 18:32:25,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 112 transitions, 706 flow [2024-06-20 18:32:25,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 112 transitions, 688 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-20 18:32:25,141 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 409 flow [2024-06-20 18:32:25,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=409, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-06-20 18:32:25,141 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2024-06-20 18:32:25,141 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 409 flow [2024-06-20 18:32:25,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 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-06-20 18:32:25,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:25,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:25,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 18:32:25,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:32:25,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:25,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1364107544, now seen corresponding path program 2 times [2024-06-20 18:32:25,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:25,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44262589] [2024-06-20 18:32:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:32:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:32:37,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:32:37,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44262589] [2024-06-20 18:32:37,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44262589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:32:37,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:32:37,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:32:37,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623329823] [2024-06-20 18:32:37,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:32:37,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:32:37,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:32:37,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:32:37,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:32:37,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-20 18:32:37,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 409 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:37,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:32:37,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-20 18:32:37,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:38,849 INFO L124 PetriNetUnfolderBase]: 1753/2779 cut-off events. [2024-06-20 18:32:38,849 INFO L125 PetriNetUnfolderBase]: For 13536/13536 co-relation queries the response was YES. [2024-06-20 18:32:38,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10728 conditions, 2779 events. 1753/2779 cut-off events. For 13536/13536 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14354 event pairs, 655 based on Foata normal form. 4/2783 useless extension candidates. Maximal degree in co-relation 10703. Up to 2581 conditions per place. [2024-06-20 18:32:38,863 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 63 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2024-06-20 18:32:38,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 81 transitions, 599 flow [2024-06-20 18:32:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:32:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:32:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-20 18:32:38,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-20 18:32:38,865 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 409 flow. Second operand 6 states and 120 transitions. [2024-06-20 18:32:38,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 81 transitions, 599 flow [2024-06-20 18:32:38,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 524 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-20 18:32:38,872 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 364 flow [2024-06-20 18:32:38,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-06-20 18:32:38,873 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2024-06-20 18:32:38,873 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 364 flow [2024-06-20 18:32:38,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:32:38,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:38,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:38,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 18:32:38,874 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:32:38,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1505949030, now seen corresponding path program 1 times [2024-06-20 18:32:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:38,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62197164] [2024-06-20 18:32:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:38,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:32:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:32:53,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:32:53,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62197164] [2024-06-20 18:32:53,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62197164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:32:53,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:32:53,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:32:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664410163] [2024-06-20 18:32:53,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:32:53,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:32:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:32:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:32:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:32:53,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:32:53,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 364 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-06-20 18:32:53,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:32:53,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:32:53,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:32:55,167 INFO L124 PetriNetUnfolderBase]: 1874/2906 cut-off events. [2024-06-20 18:32:55,168 INFO L125 PetriNetUnfolderBase]: For 16103/16103 co-relation queries the response was YES. [2024-06-20 18:32:55,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11360 conditions, 2906 events. 1874/2906 cut-off events. For 16103/16103 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14603 event pairs, 619 based on Foata normal form. 4/2909 useless extension candidates. Maximal degree in co-relation 11333. Up to 2649 conditions per place. [2024-06-20 18:32:55,181 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 72 selfloop transitions, 24 changer transitions 0/101 dead transitions. [2024-06-20 18:32:55,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 101 transitions, 728 flow [2024-06-20 18:32:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:32:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:32:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-20 18:32:55,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48172757475083056 [2024-06-20 18:32:55,183 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 364 flow. Second operand 7 states and 145 transitions. [2024-06-20 18:32:55,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 101 transitions, 728 flow [2024-06-20 18:32:55,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 101 transitions, 696 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-20 18:32:55,190 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 450 flow [2024-06-20 18:32:55,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=450, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2024-06-20 18:32:55,191 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2024-06-20 18:32:55,191 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 450 flow [2024-06-20 18:32:55,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-06-20 18:32:55,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:32:55,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:32:55,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 18:32:55,192 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:32:55,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:32:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash -427357762, now seen corresponding path program 2 times [2024-06-20 18:32:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:32:55,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463604860] [2024-06-20 18:32:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:32:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:32:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:33:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:33:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:33:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463604860] [2024-06-20 18:33:08,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463604860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:33:08,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:33:08,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:33:08,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320383991] [2024-06-20 18:33:08,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:33:08,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:33:08,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:33:08,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:33:08,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:33:09,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:33:09,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 450 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-06-20 18:33:09,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:33:09,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:33:09,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:33:10,544 INFO L124 PetriNetUnfolderBase]: 1896/2938 cut-off events. [2024-06-20 18:33:10,545 INFO L125 PetriNetUnfolderBase]: For 19674/19674 co-relation queries the response was YES. [2024-06-20 18:33:10,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12200 conditions, 2938 events. 1896/2938 cut-off events. For 19674/19674 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14767 event pairs, 626 based on Foata normal form. 4/2941 useless extension candidates. Maximal degree in co-relation 12173. Up to 2668 conditions per place. [2024-06-20 18:33:10,559 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 70 selfloop transitions, 26 changer transitions 0/101 dead transitions. [2024-06-20 18:33:10,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 788 flow [2024-06-20 18:33:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:33:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:33:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-20 18:33:10,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750830564784053 [2024-06-20 18:33:10,561 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 450 flow. Second operand 7 states and 143 transitions. [2024-06-20 18:33:10,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 788 flow [2024-06-20 18:33:10,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 101 transitions, 740 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-20 18:33:10,599 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 496 flow [2024-06-20 18:33:10,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=496, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2024-06-20 18:33:10,600 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2024-06-20 18:33:10,600 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 496 flow [2024-06-20 18:33:10,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-06-20 18:33:10,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:33:10,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:33:10,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 18:33:10,601 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:33:10,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:33:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1964504924, now seen corresponding path program 3 times [2024-06-20 18:33:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:33:10,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110758223] [2024-06-20 18:33:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:33:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:33:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:33:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:33:23,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:33:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110758223] [2024-06-20 18:33:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110758223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:33:23,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:33:23,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:33:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035175089] [2024-06-20 18:33:23,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:33:23,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:33:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:33:23,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:33:23,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:33:23,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:33:23,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 496 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-06-20 18:33:23,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:33:23,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:33:23,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:33:25,090 INFO L124 PetriNetUnfolderBase]: 1886/2927 cut-off events. [2024-06-20 18:33:25,091 INFO L125 PetriNetUnfolderBase]: For 22118/22118 co-relation queries the response was YES. [2024-06-20 18:33:25,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12424 conditions, 2927 events. 1886/2927 cut-off events. For 22118/22118 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14700 event pairs, 650 based on Foata normal form. 4/2931 useless extension candidates. Maximal degree in co-relation 12395. Up to 2749 conditions per place. [2024-06-20 18:33:25,105 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 76 selfloop transitions, 14 changer transitions 0/95 dead transitions. [2024-06-20 18:33:25,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 95 transitions, 732 flow [2024-06-20 18:33:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:33:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:33:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-20 18:33:25,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-20 18:33:25,106 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 496 flow. Second operand 7 states and 133 transitions. [2024-06-20 18:33:25,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 95 transitions, 732 flow [2024-06-20 18:33:25,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 95 transitions, 664 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-20 18:33:25,123 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 464 flow [2024-06-20 18:33:25,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=464, PETRI_PLACES=77, PETRI_TRANSITIONS=74} [2024-06-20 18:33:25,123 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2024-06-20 18:33:25,123 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 464 flow [2024-06-20 18:33:25,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-06-20 18:33:25,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:33:25,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:33:25,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 18:33:25,124 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:33:25,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:33:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash -190874572, now seen corresponding path program 1 times [2024-06-20 18:33:25,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:33:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886828116] [2024-06-20 18:33:25,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:33:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:33:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:33:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:33:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:33:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886828116] [2024-06-20 18:33:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886828116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:33:41,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:33:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:33:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126901921] [2024-06-20 18:33:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:33:41,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:33:41,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:33:41,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:33:41,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:33:41,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:33:41,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 464 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:41,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:33:41,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:33:41,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:33:43,399 INFO L124 PetriNetUnfolderBase]: 2196/3376 cut-off events. [2024-06-20 18:33:43,399 INFO L125 PetriNetUnfolderBase]: For 29051/29051 co-relation queries the response was YES. [2024-06-20 18:33:43,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14238 conditions, 3376 events. 2196/3376 cut-off events. For 29051/29051 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16678 event pairs, 806 based on Foata normal form. 4/3380 useless extension candidates. Maximal degree in co-relation 14208. Up to 3176 conditions per place. [2024-06-20 18:33:43,412 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 75 selfloop transitions, 15 changer transitions 0/99 dead transitions. [2024-06-20 18:33:43,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 99 transitions, 743 flow [2024-06-20 18:33:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:33:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:33:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-20 18:33:43,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2024-06-20 18:33:43,413 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 464 flow. Second operand 7 states and 132 transitions. [2024-06-20 18:33:43,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 99 transitions, 743 flow [2024-06-20 18:33:43,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 686 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 18:33:43,424 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 503 flow [2024-06-20 18:33:43,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=503, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2024-06-20 18:33:43,424 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2024-06-20 18:33:43,424 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 503 flow [2024-06-20 18:33:43,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:33:43,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:33:43,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:33:43,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 18:33:43,425 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:33:43,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:33:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1122138237, now seen corresponding path program 1 times [2024-06-20 18:33:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:33:43,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659716429] [2024-06-20 18:33:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:33:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:33:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:34:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:34:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:34:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659716429] [2024-06-20 18:34:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659716429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:34:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:34:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:34:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424346973] [2024-06-20 18:34:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:34:01,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:34:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:34:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:34:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:34:01,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:34:01,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 503 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:34:01,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:34:01,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:34:01,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:34:03,144 INFO L124 PetriNetUnfolderBase]: 2377/3626 cut-off events. [2024-06-20 18:34:03,145 INFO L125 PetriNetUnfolderBase]: For 37859/37859 co-relation queries the response was YES. [2024-06-20 18:34:03,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16285 conditions, 3626 events. 2377/3626 cut-off events. For 37859/37859 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17779 event pairs, 981 based on Foata normal form. 1/3627 useless extension candidates. Maximal degree in co-relation 16253. Up to 3524 conditions per place. [2024-06-20 18:34:03,161 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 72 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2024-06-20 18:34:03,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 707 flow [2024-06-20 18:34:03,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:34:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:34:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-20 18:34:03,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325581395348837 [2024-06-20 18:34:03,162 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 503 flow. Second operand 5 states and 93 transitions. [2024-06-20 18:34:03,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 707 flow [2024-06-20 18:34:03,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 90 transitions, 660 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-20 18:34:03,176 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 508 flow [2024-06-20 18:34:03,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=508, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2024-06-20 18:34:03,176 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2024-06-20 18:34:03,177 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 508 flow [2024-06-20 18:34:03,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:34:03,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:34:03,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:34:03,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 18:34:03,177 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:34:03,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:34:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash -560368807, now seen corresponding path program 1 times [2024-06-20 18:34:03,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:34:03,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864283859] [2024-06-20 18:34:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:34:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:34:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:34:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:34:17,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:34:17,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864283859] [2024-06-20 18:34:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864283859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:34:17,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:34:17,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:34:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572392938] [2024-06-20 18:34:17,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:34:17,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:34:17,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:34:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:34:17,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:34:17,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:34:17,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 508 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-06-20 18:34:17,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:34:17,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:34:17,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:34:19,127 INFO L124 PetriNetUnfolderBase]: 2299/3510 cut-off events. [2024-06-20 18:34:19,127 INFO L125 PetriNetUnfolderBase]: For 41725/41731 co-relation queries the response was YES. [2024-06-20 18:34:19,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16390 conditions, 3510 events. 2299/3510 cut-off events. For 41725/41731 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17865 event pairs, 769 based on Foata normal form. 4/3492 useless extension candidates. Maximal degree in co-relation 16357. Up to 3117 conditions per place. [2024-06-20 18:34:19,144 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 82 selfloop transitions, 37 changer transitions 0/126 dead transitions. [2024-06-20 18:34:19,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 126 transitions, 970 flow [2024-06-20 18:34:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:34:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:34:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-20 18:34:19,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48546511627906974 [2024-06-20 18:34:19,147 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 508 flow. Second operand 8 states and 167 transitions. [2024-06-20 18:34:19,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 126 transitions, 970 flow [2024-06-20 18:34:19,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 126 transitions, 940 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-20 18:34:19,164 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 634 flow [2024-06-20 18:34:19,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=634, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2024-06-20 18:34:19,165 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2024-06-20 18:34:19,166 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 634 flow [2024-06-20 18:34:19,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-06-20 18:34:19,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:34:19,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:34:19,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 18:34:19,166 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:34:19,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:34:19,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1373473251, now seen corresponding path program 2 times [2024-06-20 18:34:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:34:19,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934370389] [2024-06-20 18:34:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:34:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:34:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:34:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:34:33,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:34:33,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934370389] [2024-06-20 18:34:33,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934370389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:34:33,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:34:33,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:34:33,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315256064] [2024-06-20 18:34:33,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:34:33,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:34:33,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:34:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:34:33,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:34:33,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:34:33,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 634 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-06-20 18:34:33,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:34:33,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:34:33,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:34:35,251 INFO L124 PetriNetUnfolderBase]: 2321/3542 cut-off events. [2024-06-20 18:34:35,252 INFO L125 PetriNetUnfolderBase]: For 48028/48034 co-relation queries the response was YES. [2024-06-20 18:34:35,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17434 conditions, 3542 events. 2321/3542 cut-off events. For 48028/48034 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18043 event pairs, 769 based on Foata normal form. 4/3524 useless extension candidates. Maximal degree in co-relation 17400. Up to 3136 conditions per place. [2024-06-20 18:34:35,267 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 81 selfloop transitions, 38 changer transitions 0/126 dead transitions. [2024-06-20 18:34:35,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 126 transitions, 1064 flow [2024-06-20 18:34:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:34:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:34:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-20 18:34:35,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2024-06-20 18:34:35,271 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 634 flow. Second operand 8 states and 165 transitions. [2024-06-20 18:34:35,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 126 transitions, 1064 flow [2024-06-20 18:34:35,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 983 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-20 18:34:35,290 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 677 flow [2024-06-20 18:34:35,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=677, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2024-06-20 18:34:35,291 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2024-06-20 18:34:35,291 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 677 flow [2024-06-20 18:34:35,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-06-20 18:34:35,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:34:35,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:34:35,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 18:34:35,297 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:34:35,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:34:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash -554654887, now seen corresponding path program 3 times [2024-06-20 18:34:35,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:34:35,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540287446] [2024-06-20 18:34:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:34:35,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:34:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:34:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:34:48,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:34:48,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540287446] [2024-06-20 18:34:48,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540287446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:34:48,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:34:48,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:34:48,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358198103] [2024-06-20 18:34:48,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:34:48,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:34:48,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:34:48,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:34:48,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:34:48,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:34:48,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 677 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-06-20 18:34:48,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:34:48,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:34:48,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:34:50,801 INFO L124 PetriNetUnfolderBase]: 2343/3574 cut-off events. [2024-06-20 18:34:50,802 INFO L125 PetriNetUnfolderBase]: For 53298/53304 co-relation queries the response was YES. [2024-06-20 18:34:50,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17882 conditions, 3574 events. 2343/3574 cut-off events. For 53298/53304 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18227 event pairs, 786 based on Foata normal form. 4/3556 useless extension candidates. Maximal degree in co-relation 17846. Up to 3155 conditions per place. [2024-06-20 18:34:50,818 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 79 selfloop transitions, 40 changer transitions 0/126 dead transitions. [2024-06-20 18:34:50,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 126 transitions, 1101 flow [2024-06-20 18:34:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:34:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:34:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-20 18:34:50,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738372093023256 [2024-06-20 18:34:50,821 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 677 flow. Second operand 8 states and 163 transitions. [2024-06-20 18:34:50,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 126 transitions, 1101 flow [2024-06-20 18:34:50,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 126 transitions, 1021 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-20 18:34:50,845 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 723 flow [2024-06-20 18:34:50,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=723, PETRI_PLACES=91, PETRI_TRANSITIONS=94} [2024-06-20 18:34:50,846 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2024-06-20 18:34:50,846 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 94 transitions, 723 flow [2024-06-20 18:34:50,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-06-20 18:34:50,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:34:50,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:34:50,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 18:34:50,847 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:34:50,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:34:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1802121689, now seen corresponding path program 4 times [2024-06-20 18:34:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:34:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691822628] [2024-06-20 18:34:50,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:34:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:34:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:35:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:35:05,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:35:05,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691822628] [2024-06-20 18:35:05,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691822628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:35:05,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:35:05,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:35:05,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221871372] [2024-06-20 18:35:05,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:35:05,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:35:05,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:35:05,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:35:05,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:35:05,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:35:05,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 723 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-06-20 18:35:05,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:35:05,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:35:05,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:35:07,202 INFO L124 PetriNetUnfolderBase]: 2333/3563 cut-off events. [2024-06-20 18:35:07,202 INFO L125 PetriNetUnfolderBase]: For 58237/58243 co-relation queries the response was YES. [2024-06-20 18:35:07,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18094 conditions, 3563 events. 2333/3563 cut-off events. For 58237/58243 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18071 event pairs, 828 based on Foata normal form. 4/3547 useless extension candidates. Maximal degree in co-relation 18057. Up to 3315 conditions per place. [2024-06-20 18:35:07,218 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 94 selfloop transitions, 19 changer transitions 0/120 dead transitions. [2024-06-20 18:35:07,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 120 transitions, 1019 flow [2024-06-20 18:35:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:35:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:35:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-20 18:35:07,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-20 18:35:07,221 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 723 flow. Second operand 8 states and 151 transitions. [2024-06-20 18:35:07,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 120 transitions, 1019 flow [2024-06-20 18:35:07,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 120 transitions, 924 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-20 18:35:07,249 INFO L231 Difference]: Finished difference. Result has 94 places, 94 transitions, 674 flow [2024-06-20 18:35:07,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=674, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2024-06-20 18:35:07,249 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2024-06-20 18:35:07,249 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 674 flow [2024-06-20 18:35:07,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-06-20 18:35:07,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:35:07,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:35:07,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 18:35:07,250 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:35:07,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:35:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 500233785, now seen corresponding path program 1 times [2024-06-20 18:35:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:35:07,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141661637] [2024-06-20 18:35:07,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:35:07,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:35:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:35:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:35:21,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:35:21,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141661637] [2024-06-20 18:35:21,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141661637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:35:21,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:35:21,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:35:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306980317] [2024-06-20 18:35:21,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:35:21,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:35:21,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:35:21,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:35:21,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:35:21,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:35:21,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 674 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-06-20 18:35:21,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:35:21,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:35:21,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:35:23,348 INFO L124 PetriNetUnfolderBase]: 2386/3644 cut-off events. [2024-06-20 18:35:23,348 INFO L125 PetriNetUnfolderBase]: For 65928/65937 co-relation queries the response was YES. [2024-06-20 18:35:23,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18823 conditions, 3644 events. 2386/3644 cut-off events. For 65928/65937 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18141 event pairs, 868 based on Foata normal form. 6/3615 useless extension candidates. Maximal degree in co-relation 18785. Up to 3385 conditions per place. [2024-06-20 18:35:23,364 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 91 selfloop transitions, 19 changer transitions 0/120 dead transitions. [2024-06-20 18:35:23,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 120 transitions, 1016 flow [2024-06-20 18:35:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:35:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:35:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-20 18:35:23,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-20 18:35:23,367 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 674 flow. Second operand 7 states and 133 transitions. [2024-06-20 18:35:23,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 120 transitions, 1016 flow [2024-06-20 18:35:23,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 914 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 18:35:23,393 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 704 flow [2024-06-20 18:35:23,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=704, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2024-06-20 18:35:23,394 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2024-06-20 18:35:23,394 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 704 flow [2024-06-20 18:35:23,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-06-20 18:35:23,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:35:23,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:35:23,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 18:35:23,395 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:35:23,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:35:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash -426545897, now seen corresponding path program 1 times [2024-06-20 18:35:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:35:23,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111943704] [2024-06-20 18:35:23,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:35:23,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:35:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:35:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:35:41,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:35:41,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111943704] [2024-06-20 18:35:41,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111943704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:35:41,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:35:41,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:35:41,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437093522] [2024-06-20 18:35:41,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:35:41,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:35:41,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:35:41,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:35:41,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:35:42,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:35:42,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 704 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-06-20 18:35:42,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:35:42,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:35:42,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:35:43,876 INFO L124 PetriNetUnfolderBase]: 2433/3713 cut-off events. [2024-06-20 18:35:43,876 INFO L125 PetriNetUnfolderBase]: For 71529/71533 co-relation queries the response was YES. [2024-06-20 18:35:43,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19604 conditions, 3713 events. 2433/3713 cut-off events. For 71529/71533 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18203 event pairs, 940 based on Foata normal form. 7/3716 useless extension candidates. Maximal degree in co-relation 19566. Up to 3558 conditions per place. [2024-06-20 18:35:43,896 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 89 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2024-06-20 18:35:43,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 114 transitions, 958 flow [2024-06-20 18:35:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:35:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:35:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-20 18:35:43,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42248062015503873 [2024-06-20 18:35:43,897 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 704 flow. Second operand 6 states and 109 transitions. [2024-06-20 18:35:43,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 114 transitions, 958 flow [2024-06-20 18:35:43,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 114 transitions, 908 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-20 18:35:43,928 INFO L231 Difference]: Finished difference. Result has 92 places, 103 transitions, 716 flow [2024-06-20 18:35:43,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=716, PETRI_PLACES=92, PETRI_TRANSITIONS=103} [2024-06-20 18:35:43,929 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2024-06-20 18:35:43,929 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 103 transitions, 716 flow [2024-06-20 18:35:43,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-06-20 18:35:43,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:35:43,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:35:43,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 18:35:43,929 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:35:43,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:35:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -191682523, now seen corresponding path program 1 times [2024-06-20 18:35:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:35:43,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265668319] [2024-06-20 18:35:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:35:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:35:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:35:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:35:58,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:35:58,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265668319] [2024-06-20 18:35:58,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265668319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:35:58,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:35:58,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:35:58,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095880939] [2024-06-20 18:35:58,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:35:58,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:35:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:35:58,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:35:58,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:35:58,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:35:58,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 103 transitions, 716 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:35:58,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:35:58,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:35:58,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:00,982 INFO L124 PetriNetUnfolderBase]: 2419/3703 cut-off events. [2024-06-20 18:36:00,983 INFO L125 PetriNetUnfolderBase]: For 76401/76403 co-relation queries the response was YES. [2024-06-20 18:36:00,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20094 conditions, 3703 events. 2419/3703 cut-off events. For 76401/76403 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18953 event pairs, 756 based on Foata normal form. 4/3692 useless extension candidates. Maximal degree in co-relation 20055. Up to 3439 conditions per place. [2024-06-20 18:36:01,000 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 119 selfloop transitions, 20 changer transitions 0/146 dead transitions. [2024-06-20 18:36:01,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 146 transitions, 1140 flow [2024-06-20 18:36:01,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:36:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:36:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-20 18:36:01,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599483204134367 [2024-06-20 18:36:01,001 INFO L175 Difference]: Start difference. First operand has 92 places, 103 transitions, 716 flow. Second operand 9 states and 178 transitions. [2024-06-20 18:36:01,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 146 transitions, 1140 flow [2024-06-20 18:36:01,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 146 transitions, 1100 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-20 18:36:01,031 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 772 flow [2024-06-20 18:36:01,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=772, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2024-06-20 18:36:01,031 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2024-06-20 18:36:01,032 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 772 flow [2024-06-20 18:36:01,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:01,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:01,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:01,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 18:36:01,032 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:36:01,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash -191562553, now seen corresponding path program 2 times [2024-06-20 18:36:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:01,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232856084] [2024-06-20 18:36:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:36:16,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232856084] [2024-06-20 18:36:16,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232856084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:16,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:16,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:36:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330443977] [2024-06-20 18:36:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:16,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:36:16,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:16,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:36:16,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:36:16,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:36:16,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 772 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:16,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:16,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:36:16,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:18,663 INFO L124 PetriNetUnfolderBase]: 2464/3764 cut-off events. [2024-06-20 18:36:18,663 INFO L125 PetriNetUnfolderBase]: For 84661/84661 co-relation queries the response was YES. [2024-06-20 18:36:18,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21194 conditions, 3764 events. 2464/3764 cut-off events. For 84661/84661 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19262 event pairs, 647 based on Foata normal form. 4/3759 useless extension candidates. Maximal degree in co-relation 21154. Up to 3164 conditions per place. [2024-06-20 18:36:18,682 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 94 selfloop transitions, 54 changer transitions 0/155 dead transitions. [2024-06-20 18:36:18,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 155 transitions, 1360 flow [2024-06-20 18:36:18,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:36:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:36:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-20 18:36:18,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48320413436692505 [2024-06-20 18:36:18,685 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 772 flow. Second operand 9 states and 187 transitions. [2024-06-20 18:36:18,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 155 transitions, 1360 flow [2024-06-20 18:36:18,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 155 transitions, 1288 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-20 18:36:18,720 INFO L231 Difference]: Finished difference. Result has 99 places, 112 transitions, 918 flow [2024-06-20 18:36:18,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=918, PETRI_PLACES=99, PETRI_TRANSITIONS=112} [2024-06-20 18:36:18,721 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2024-06-20 18:36:18,721 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 112 transitions, 918 flow [2024-06-20 18:36:18,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:18,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:18,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:18,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 18:36:18,722 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:36:18,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:18,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1453601243, now seen corresponding path program 3 times [2024-06-20 18:36:18,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:18,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826506010] [2024-06-20 18:36:18,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:18,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:36:33,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:33,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826506010] [2024-06-20 18:36:33,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826506010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:33,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:33,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:36:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777870483] [2024-06-20 18:36:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:33,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:36:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:36:33,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:36:33,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:36:33,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 112 transitions, 918 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:33,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:33,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:36:33,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:35,448 INFO L124 PetriNetUnfolderBase]: 2486/3796 cut-off events. [2024-06-20 18:36:35,449 INFO L125 PetriNetUnfolderBase]: For 94528/94528 co-relation queries the response was YES. [2024-06-20 18:36:35,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22243 conditions, 3796 events. 2486/3796 cut-off events. For 94528/94528 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19447 event pairs, 669 based on Foata normal form. 4/3791 useless extension candidates. Maximal degree in co-relation 22202. Up to 3183 conditions per place. [2024-06-20 18:36:35,469 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 93 selfloop transitions, 55 changer transitions 0/155 dead transitions. [2024-06-20 18:36:35,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 155 transitions, 1460 flow [2024-06-20 18:36:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:36:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:36:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-20 18:36:35,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780361757105943 [2024-06-20 18:36:35,472 INFO L175 Difference]: Start difference. First operand has 99 places, 112 transitions, 918 flow. Second operand 9 states and 185 transitions. [2024-06-20 18:36:35,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 155 transitions, 1460 flow [2024-06-20 18:36:35,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 155 transitions, 1355 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-20 18:36:35,516 INFO L231 Difference]: Finished difference. Result has 103 places, 115 transitions, 985 flow [2024-06-20 18:36:35,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=985, PETRI_PLACES=103, PETRI_TRANSITIONS=115} [2024-06-20 18:36:35,516 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 59 predicate places. [2024-06-20 18:36:35,516 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 115 transitions, 985 flow [2024-06-20 18:36:35,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:35,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:35,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:35,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 18:36:35,517 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:36:35,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:35,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1595764187, now seen corresponding path program 4 times [2024-06-20 18:36:35,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:35,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443482658] [2024-06-20 18:36:35,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:35,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:36:51,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:51,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443482658] [2024-06-20 18:36:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443482658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:51,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:36:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545088138] [2024-06-20 18:36:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:51,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:36:51,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:36:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:36:51,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:36:51,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 115 transitions, 985 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:51,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:51,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:36:51,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:53,485 INFO L124 PetriNetUnfolderBase]: 2508/3828 cut-off events. [2024-06-20 18:36:53,485 INFO L125 PetriNetUnfolderBase]: For 101683/101683 co-relation queries the response was YES. [2024-06-20 18:36:53,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22883 conditions, 3828 events. 2508/3828 cut-off events. For 101683/101683 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19644 event pairs, 680 based on Foata normal form. 4/3823 useless extension candidates. Maximal degree in co-relation 22840. Up to 3202 conditions per place. [2024-06-20 18:36:53,505 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 92 selfloop transitions, 56 changer transitions 0/155 dead transitions. [2024-06-20 18:36:53,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 155 transitions, 1521 flow [2024-06-20 18:36:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:36:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:36:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2024-06-20 18:36:53,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2024-06-20 18:36:53,508 INFO L175 Difference]: Start difference. First operand has 103 places, 115 transitions, 985 flow. Second operand 9 states and 183 transitions. [2024-06-20 18:36:53,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 155 transitions, 1521 flow [2024-06-20 18:36:53,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 155 transitions, 1400 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-20 18:36:53,576 INFO L231 Difference]: Finished difference. Result has 106 places, 118 transitions, 1036 flow [2024-06-20 18:36:53,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1036, PETRI_PLACES=106, PETRI_TRANSITIONS=118} [2024-06-20 18:36:53,577 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 62 predicate places. [2024-06-20 18:36:53,577 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 118 transitions, 1036 flow [2024-06-20 18:36:53,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:53,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:53,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:53,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 18:36:53,577 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:36:53,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:53,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1626337397, now seen corresponding path program 1 times [2024-06-20 18:36:53,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:53,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497446469] [2024-06-20 18:36:53,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:53,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:37:08,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497446469] [2024-06-20 18:37:08,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497446469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:08,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:08,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:37:08,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117202058] [2024-06-20 18:37:08,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:08,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:37:08,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:08,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:37:08,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:37:08,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:37:08,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 118 transitions, 1036 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:08,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:08,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:37:08,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:10,443 INFO L124 PetriNetUnfolderBase]: 2558/3909 cut-off events. [2024-06-20 18:37:10,444 INFO L125 PetriNetUnfolderBase]: For 113660/113668 co-relation queries the response was YES. [2024-06-20 18:37:10,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23781 conditions, 3909 events. 2558/3909 cut-off events. For 113660/113668 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 19528 event pairs, 830 based on Foata normal form. 12/3907 useless extension candidates. Maximal degree in co-relation 23737. Up to 3560 conditions per place. [2024-06-20 18:37:10,465 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 117 selfloop transitions, 26 changer transitions 0/153 dead transitions. [2024-06-20 18:37:10,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 153 transitions, 1464 flow [2024-06-20 18:37:10,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:37:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:37:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-20 18:37:10,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563953488372093 [2024-06-20 18:37:10,468 INFO L175 Difference]: Start difference. First operand has 106 places, 118 transitions, 1036 flow. Second operand 8 states and 157 transitions. [2024-06-20 18:37:10,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 153 transitions, 1464 flow [2024-06-20 18:37:10,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 153 transitions, 1341 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-20 18:37:10,523 INFO L231 Difference]: Finished difference. Result has 109 places, 123 transitions, 1044 flow [2024-06-20 18:37:10,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1044, PETRI_PLACES=109, PETRI_TRANSITIONS=123} [2024-06-20 18:37:10,523 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 65 predicate places. [2024-06-20 18:37:10,523 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 123 transitions, 1044 flow [2024-06-20 18:37:10,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:10,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:10,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:10,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 18:37:10,524 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:37:10,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1166801434, now seen corresponding path program 1 times [2024-06-20 18:37:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:10,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682283615] [2024-06-20 18:37:10,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:37:27,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682283615] [2024-06-20 18:37:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682283615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:27,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:27,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:37:27,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623923104] [2024-06-20 18:37:27,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:27,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:37:27,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:27,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:37:27,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:37:27,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:37:27,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 123 transitions, 1044 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-06-20 18:37:27,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:27,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:37:27,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:29,565 INFO L124 PetriNetUnfolderBase]: 2547/3874 cut-off events. [2024-06-20 18:37:29,565 INFO L125 PetriNetUnfolderBase]: For 121359/121395 co-relation queries the response was YES. [2024-06-20 18:37:29,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24231 conditions, 3874 events. 2547/3874 cut-off events. For 121359/121395 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 19198 event pairs, 909 based on Foata normal form. 7/3834 useless extension candidates. Maximal degree in co-relation 24185. Up to 3700 conditions per place. [2024-06-20 18:37:29,586 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 115 selfloop transitions, 16 changer transitions 0/145 dead transitions. [2024-06-20 18:37:29,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 145 transitions, 1460 flow [2024-06-20 18:37:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:37:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:37:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-20 18:37:29,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2024-06-20 18:37:29,587 INFO L175 Difference]: Start difference. First operand has 109 places, 123 transitions, 1044 flow. Second operand 6 states and 116 transitions. [2024-06-20 18:37:29,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 145 transitions, 1460 flow [2024-06-20 18:37:29,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 145 transitions, 1377 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-20 18:37:29,645 INFO L231 Difference]: Finished difference. Result has 110 places, 129 transitions, 1069 flow [2024-06-20 18:37:29,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1069, PETRI_PLACES=110, PETRI_TRANSITIONS=129} [2024-06-20 18:37:29,646 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places. [2024-06-20 18:37:29,646 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 129 transitions, 1069 flow [2024-06-20 18:37:29,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-06-20 18:37:29,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:29,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:29,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 18:37:29,647 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:37:29,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:29,647 INFO L85 PathProgramCache]: Analyzing trace with hash 853921945, now seen corresponding path program 5 times [2024-06-20 18:37:29,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:29,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150820312] [2024-06-20 18:37:29,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:29,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:37:43,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:43,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150820312] [2024-06-20 18:37:43,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150820312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:43,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:43,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:37:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362519636] [2024-06-20 18:37:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:43,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:37:43,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:43,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:37:43,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:37:44,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:37:44,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 129 transitions, 1069 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:44,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:44,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:37:44,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:46,286 INFO L124 PetriNetUnfolderBase]: 2511/3835 cut-off events. [2024-06-20 18:37:46,286 INFO L125 PetriNetUnfolderBase]: For 125674/125688 co-relation queries the response was YES. [2024-06-20 18:37:46,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23985 conditions, 3835 events. 2511/3835 cut-off events. For 125674/125688 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 19648 event pairs, 792 based on Foata normal form. 6/3826 useless extension candidates. Maximal degree in co-relation 23938. Up to 3484 conditions per place. [2024-06-20 18:37:46,305 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 125 selfloop transitions, 25 changer transitions 0/160 dead transitions. [2024-06-20 18:37:46,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 160 transitions, 1453 flow [2024-06-20 18:37:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:37:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:37:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-20 18:37:46,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43669250645994834 [2024-06-20 18:37:46,308 INFO L175 Difference]: Start difference. First operand has 110 places, 129 transitions, 1069 flow. Second operand 9 states and 169 transitions. [2024-06-20 18:37:46,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 160 transitions, 1453 flow [2024-06-20 18:37:46,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 160 transitions, 1393 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-20 18:37:46,358 INFO L231 Difference]: Finished difference. Result has 117 places, 129 transitions, 1067 flow [2024-06-20 18:37:46,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1067, PETRI_PLACES=117, PETRI_TRANSITIONS=129} [2024-06-20 18:37:46,359 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 73 predicate places. [2024-06-20 18:37:46,359 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 129 transitions, 1067 flow [2024-06-20 18:37:46,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:46,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:46,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:46,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 18:37:46,359 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:37:46,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash 957591669, now seen corresponding path program 2 times [2024-06-20 18:37:46,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:46,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290136969] [2024-06-20 18:37:46,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:46,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:38:01,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:01,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290136969] [2024-06-20 18:38:01,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290136969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:01,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:38:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570461366] [2024-06-20 18:38:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:01,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:38:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:38:01,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:38:01,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:38:01,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 129 transitions, 1067 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:01,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:01,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:38:01,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:03,509 INFO L124 PetriNetUnfolderBase]: 2568/3918 cut-off events. [2024-06-20 18:38:03,510 INFO L125 PetriNetUnfolderBase]: For 138376/138399 co-relation queries the response was YES. [2024-06-20 18:38:03,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25116 conditions, 3918 events. 2568/3918 cut-off events. For 138376/138399 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19496 event pairs, 847 based on Foata normal form. 10/3906 useless extension candidates. Maximal degree in co-relation 25067. Up to 3614 conditions per place. [2024-06-20 18:38:03,533 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 127 selfloop transitions, 21 changer transitions 0/160 dead transitions. [2024-06-20 18:38:03,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 160 transitions, 1506 flow [2024-06-20 18:38:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:38:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:38:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 18:38:03,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-20 18:38:03,536 INFO L175 Difference]: Start difference. First operand has 117 places, 129 transitions, 1067 flow. Second operand 8 states and 152 transitions. [2024-06-20 18:38:03,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 160 transitions, 1506 flow [2024-06-20 18:38:03,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 160 transitions, 1373 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-20 18:38:03,603 INFO L231 Difference]: Finished difference. Result has 116 places, 134 transitions, 1072 flow [2024-06-20 18:38:03,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1072, PETRI_PLACES=116, PETRI_TRANSITIONS=134} [2024-06-20 18:38:03,603 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2024-06-20 18:38:03,604 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 134 transitions, 1072 flow [2024-06-20 18:38:03,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:03,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:03,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:03,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 18:38:03,604 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:38:03,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:03,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1672610091, now seen corresponding path program 3 times [2024-06-20 18:38:03,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:03,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895553298] [2024-06-20 18:38:03,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:03,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:38:18,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:18,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895553298] [2024-06-20 18:38:18,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895553298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:18,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:18,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:38:18,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132263671] [2024-06-20 18:38:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:18,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:38:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:38:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:38:18,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:38:18,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 134 transitions, 1072 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:18,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:18,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:38:18,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:21,040 INFO L124 PetriNetUnfolderBase]: 2585/3950 cut-off events. [2024-06-20 18:38:21,040 INFO L125 PetriNetUnfolderBase]: For 148980/148998 co-relation queries the response was YES. [2024-06-20 18:38:21,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25924 conditions, 3950 events. 2585/3950 cut-off events. For 148980/148998 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19784 event pairs, 831 based on Foata normal form. 10/3945 useless extension candidates. Maximal degree in co-relation 25873. Up to 3654 conditions per place. [2024-06-20 18:38:21,066 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 132 selfloop transitions, 17 changer transitions 0/161 dead transitions. [2024-06-20 18:38:21,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 161 transitions, 1480 flow [2024-06-20 18:38:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:38:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:38:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 18:38:21,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331395348837209 [2024-06-20 18:38:21,069 INFO L175 Difference]: Start difference. First operand has 116 places, 134 transitions, 1072 flow. Second operand 8 states and 149 transitions. [2024-06-20 18:38:21,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 161 transitions, 1480 flow [2024-06-20 18:38:21,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 161 transitions, 1393 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-20 18:38:21,158 INFO L231 Difference]: Finished difference. Result has 119 places, 136 transitions, 1078 flow [2024-06-20 18:38:21,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1078, PETRI_PLACES=119, PETRI_TRANSITIONS=136} [2024-06-20 18:38:21,159 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 75 predicate places. [2024-06-20 18:38:21,159 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 136 transitions, 1078 flow [2024-06-20 18:38:21,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:21,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:21,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:21,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 18:38:21,160 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:38:21,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash 965923229, now seen corresponding path program 1 times [2024-06-20 18:38:21,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:21,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999018934] [2024-06-20 18:38:21,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:38:34,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:34,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999018934] [2024-06-20 18:38:34,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999018934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:34,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:34,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:38:34,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302122050] [2024-06-20 18:38:34,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:34,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:38:34,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:34,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:38:34,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:38:35,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:38:35,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 136 transitions, 1078 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:35,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:35,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:38:35,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:37,378 INFO L124 PetriNetUnfolderBase]: 2751/4148 cut-off events. [2024-06-20 18:38:37,378 INFO L125 PetriNetUnfolderBase]: For 156189/156189 co-relation queries the response was YES. [2024-06-20 18:38:37,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27071 conditions, 4148 events. 2751/4148 cut-off events. For 156189/156189 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 20257 event pairs, 871 based on Foata normal form. 2/4148 useless extension candidates. Maximal degree in co-relation 27019. Up to 3909 conditions per place. [2024-06-20 18:38:37,404 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 135 selfloop transitions, 25 changer transitions 0/167 dead transitions. [2024-06-20 18:38:37,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 167 transitions, 1543 flow [2024-06-20 18:38:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:38:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:38:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-20 18:38:37,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-20 18:38:37,405 INFO L175 Difference]: Start difference. First operand has 119 places, 136 transitions, 1078 flow. Second operand 8 states and 144 transitions. [2024-06-20 18:38:37,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 167 transitions, 1543 flow [2024-06-20 18:38:37,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 167 transitions, 1468 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-20 18:38:37,502 INFO L231 Difference]: Finished difference. Result has 121 places, 142 transitions, 1156 flow [2024-06-20 18:38:37,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1156, PETRI_PLACES=121, PETRI_TRANSITIONS=142} [2024-06-20 18:38:37,503 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 77 predicate places. [2024-06-20 18:38:37,503 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 142 transitions, 1156 flow [2024-06-20 18:38:37,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:37,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:37,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:37,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 18:38:37,503 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:38:37,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1252810869, now seen corresponding path program 4 times [2024-06-20 18:38:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:37,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907617445] [2024-06-20 18:38:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:52,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-06-20 18:38:52,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:52,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907617445] [2024-06-20 18:38:52,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907617445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:52,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:52,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:38:52,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960740284] [2024-06-20 18:38:52,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:52,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:38:52,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:52,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:38:52,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:38:52,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:38:52,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 142 transitions, 1156 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:52,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:52,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:38:52,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:54,499 INFO L124 PetriNetUnfolderBase]: 2606/3974 cut-off events. [2024-06-20 18:38:54,499 INFO L125 PetriNetUnfolderBase]: For 167062/167084 co-relation queries the response was YES. [2024-06-20 18:38:54,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26769 conditions, 3974 events. 2606/3974 cut-off events. For 167062/167084 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19842 event pairs, 834 based on Foata normal form. 12/3963 useless extension candidates. Maximal degree in co-relation 26716. Up to 3672 conditions per place. [2024-06-20 18:38:54,522 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 134 selfloop transitions, 21 changer transitions 0/169 dead transitions. [2024-06-20 18:38:54,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 169 transitions, 1584 flow [2024-06-20 18:38:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:38:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:38:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-20 18:38:54,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2024-06-20 18:38:54,525 INFO L175 Difference]: Start difference. First operand has 121 places, 142 transitions, 1156 flow. Second operand 8 states and 150 transitions. [2024-06-20 18:38:54,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 169 transitions, 1584 flow [2024-06-20 18:38:54,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 169 transitions, 1504 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-20 18:38:54,597 INFO L231 Difference]: Finished difference. Result has 123 places, 144 transitions, 1184 flow [2024-06-20 18:38:54,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1184, PETRI_PLACES=123, PETRI_TRANSITIONS=144} [2024-06-20 18:38:54,597 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places. [2024-06-20 18:38:54,598 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 144 transitions, 1184 flow [2024-06-20 18:38:54,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:38:54,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:54,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:54,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 18:38:54,598 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:38:54,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash 105254402, now seen corresponding path program 2 times [2024-06-20 18:38:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:54,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505345618] [2024-06-20 18:38:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:54,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:39:11,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:11,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505345618] [2024-06-20 18:39:11,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505345618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:11,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:11,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:39:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737450621] [2024-06-20 18:39:11,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:11,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:39:11,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:11,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:39:11,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:39:11,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:39:11,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 144 transitions, 1184 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-06-20 18:39:11,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:11,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:39:11,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:13,108 INFO L124 PetriNetUnfolderBase]: 2594/3938 cut-off events. [2024-06-20 18:39:13,108 INFO L125 PetriNetUnfolderBase]: For 175614/175655 co-relation queries the response was YES. [2024-06-20 18:39:13,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27160 conditions, 3938 events. 2594/3938 cut-off events. For 175614/175655 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19449 event pairs, 883 based on Foata normal form. 11/3900 useless extension candidates. Maximal degree in co-relation 27106. Up to 3781 conditions per place. [2024-06-20 18:39:13,129 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 126 selfloop transitions, 11 changer transitions 0/153 dead transitions. [2024-06-20 18:39:13,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 153 transitions, 1480 flow [2024-06-20 18:39:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:39:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:39:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-20 18:39:13,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41472868217054265 [2024-06-20 18:39:13,131 INFO L175 Difference]: Start difference. First operand has 123 places, 144 transitions, 1184 flow. Second operand 6 states and 107 transitions. [2024-06-20 18:39:13,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 153 transitions, 1480 flow [2024-06-20 18:39:13,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 153 transitions, 1372 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-20 18:39:13,203 INFO L231 Difference]: Finished difference. Result has 123 places, 144 transitions, 1104 flow [2024-06-20 18:39:13,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1104, PETRI_PLACES=123, PETRI_TRANSITIONS=144} [2024-06-20 18:39:13,204 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places. [2024-06-20 18:39:13,204 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 144 transitions, 1104 flow [2024-06-20 18:39:13,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-06-20 18:39:13,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:13,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:13,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 18:39:13,205 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:39:13,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1428116392, now seen corresponding path program 1 times [2024-06-20 18:39:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:13,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361135217] [2024-06-20 18:39:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:13,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:39:32,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:32,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361135217] [2024-06-20 18:39:32,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361135217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:32,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:32,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:39:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827884700] [2024-06-20 18:39:32,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:32,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:39:32,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:32,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:39:32,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:39:32,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:39:32,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 144 transitions, 1104 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:32,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:32,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:39:32,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:34,987 INFO L124 PetriNetUnfolderBase]: 2794/4172 cut-off events. [2024-06-20 18:39:34,987 INFO L125 PetriNetUnfolderBase]: For 184624/184641 co-relation queries the response was YES. [2024-06-20 18:39:34,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28163 conditions, 4172 events. 2794/4172 cut-off events. For 184624/184641 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 20156 event pairs, 925 based on Foata normal form. 9/4167 useless extension candidates. Maximal degree in co-relation 28108. Up to 4064 conditions per place. [2024-06-20 18:39:35,013 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 137 selfloop transitions, 16 changer transitions 0/163 dead transitions. [2024-06-20 18:39:35,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 163 transitions, 1558 flow [2024-06-20 18:39:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:39:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:39:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-20 18:39:35,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-20 18:39:35,014 INFO L175 Difference]: Start difference. First operand has 123 places, 144 transitions, 1104 flow. Second operand 6 states and 108 transitions. [2024-06-20 18:39:35,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 163 transitions, 1558 flow [2024-06-20 18:39:35,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 163 transitions, 1526 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 18:39:35,109 INFO L231 Difference]: Finished difference. Result has 124 places, 150 transitions, 1168 flow [2024-06-20 18:39:35,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1168, PETRI_PLACES=124, PETRI_TRANSITIONS=150} [2024-06-20 18:39:35,110 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places. [2024-06-20 18:39:35,110 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 150 transitions, 1168 flow [2024-06-20 18:39:35,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:35,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:35,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:35,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 18:39:35,110 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:39:35,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash 120455748, now seen corresponding path program 2 times [2024-06-20 18:39:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:35,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504190230] [2024-06-20 18:39:35,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:39:55,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504190230] [2024-06-20 18:39:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504190230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:55,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:55,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:39:55,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820134174] [2024-06-20 18:39:55,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:55,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:39:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:55,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:39:55,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:39:55,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:39:55,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 150 transitions, 1168 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:55,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:55,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:39:55,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:57,598 INFO L124 PetriNetUnfolderBase]: 2791/4169 cut-off events. [2024-06-20 18:39:57,598 INFO L125 PetriNetUnfolderBase]: For 194781/194798 co-relation queries the response was YES. [2024-06-20 18:39:57,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28863 conditions, 4169 events. 2791/4169 cut-off events. For 194781/194798 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 20149 event pairs, 923 based on Foata normal form. 9/4157 useless extension candidates. Maximal degree in co-relation 28807. Up to 4061 conditions per place. [2024-06-20 18:39:57,624 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 133 selfloop transitions, 16 changer transitions 0/159 dead transitions. [2024-06-20 18:39:57,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 159 transitions, 1488 flow [2024-06-20 18:39:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:39:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:39:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-20 18:39:57,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40310077519379844 [2024-06-20 18:39:57,625 INFO L175 Difference]: Start difference. First operand has 124 places, 150 transitions, 1168 flow. Second operand 6 states and 104 transitions. [2024-06-20 18:39:57,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 159 transitions, 1488 flow [2024-06-20 18:39:57,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 159 transitions, 1442 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-20 18:39:57,713 INFO L231 Difference]: Finished difference. Result has 128 places, 150 transitions, 1160 flow [2024-06-20 18:39:57,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1160, PETRI_PLACES=128, PETRI_TRANSITIONS=150} [2024-06-20 18:39:57,713 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 84 predicate places. [2024-06-20 18:39:57,713 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 150 transitions, 1160 flow [2024-06-20 18:39:57,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:57,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:57,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:57,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 18:39:57,714 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:39:57,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1647279816, now seen corresponding path program 1 times [2024-06-20 18:39:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907187501] [2024-06-20 18:39:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:57,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:40:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:40:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:40:15,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907187501] [2024-06-20 18:40:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907187501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:40:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:40:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:40:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373666630] [2024-06-20 18:40:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:40:15,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:40:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:40:15,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:40:15,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:40:16,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:40:16,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 150 transitions, 1160 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:40:16,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:40:16,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:40:16,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:40:18,915 INFO L124 PetriNetUnfolderBase]: 2658/4059 cut-off events. [2024-06-20 18:40:18,915 INFO L125 PetriNetUnfolderBase]: For 202600/202600 co-relation queries the response was YES. [2024-06-20 18:40:18,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28215 conditions, 4059 events. 2658/4059 cut-off events. For 202600/202600 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 20920 event pairs, 766 based on Foata normal form. 4/4040 useless extension candidates. Maximal degree in co-relation 28157. Up to 3690 conditions per place. [2024-06-20 18:40:18,939 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 167 selfloop transitions, 29 changer transitions 0/211 dead transitions. [2024-06-20 18:40:18,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 211 transitions, 1944 flow [2024-06-20 18:40:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:40:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:40:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-20 18:40:18,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-20 18:40:18,942 INFO L175 Difference]: Start difference. First operand has 128 places, 150 transitions, 1160 flow. Second operand 11 states and 220 transitions. [2024-06-20 18:40:18,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 211 transitions, 1944 flow [2024-06-20 18:40:19,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 211 transitions, 1900 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 18:40:19,021 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 1312 flow [2024-06-20 18:40:19,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1312, PETRI_PLACES=133, PETRI_TRANSITIONS=156} [2024-06-20 18:40:19,022 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places. [2024-06-20 18:40:19,022 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 1312 flow [2024-06-20 18:40:19,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:40:19,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:40:19,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:40:19,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 18:40:19,022 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:40:19,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:40:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1964357284, now seen corresponding path program 2 times [2024-06-20 18:40:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:40:19,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580035353] [2024-06-20 18:40:19,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:40:19,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:40:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:40:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:40:35,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:40:35,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580035353] [2024-06-20 18:40:35,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580035353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:40:35,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:40:35,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:40:35,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042747600] [2024-06-20 18:40:35,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:40:35,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:40:35,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:40:35,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:40:35,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:40:35,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:40:35,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 156 transitions, 1312 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:40:35,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:40:35,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:40:35,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:40:38,266 INFO L124 PetriNetUnfolderBase]: 2651/4048 cut-off events. [2024-06-20 18:40:38,266 INFO L125 PetriNetUnfolderBase]: For 213471/213471 co-relation queries the response was YES. [2024-06-20 18:40:38,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28850 conditions, 4048 events. 2651/4048 cut-off events. For 213471/213471 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 20863 event pairs, 772 based on Foata normal form. 4/4027 useless extension candidates. Maximal degree in co-relation 28792. Up to 3716 conditions per place. [2024-06-20 18:40:38,295 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 163 selfloop transitions, 23 changer transitions 0/201 dead transitions. [2024-06-20 18:40:38,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 201 transitions, 1802 flow [2024-06-20 18:40:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:40:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:40:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-06-20 18:40:38,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558139534883721 [2024-06-20 18:40:38,298 INFO L175 Difference]: Start difference. First operand has 133 places, 156 transitions, 1312 flow. Second operand 10 states and 196 transitions. [2024-06-20 18:40:38,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 201 transitions, 1802 flow [2024-06-20 18:40:38,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 201 transitions, 1668 flow, removed 54 selfloop flow, removed 7 redundant places. [2024-06-20 18:40:38,436 INFO L231 Difference]: Finished difference. Result has 136 places, 156 transitions, 1232 flow [2024-06-20 18:40:38,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1232, PETRI_PLACES=136, PETRI_TRANSITIONS=156} [2024-06-20 18:40:38,437 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 92 predicate places. [2024-06-20 18:40:38,437 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 156 transitions, 1232 flow [2024-06-20 18:40:38,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:40:38,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:40:38,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:40:38,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 18:40:38,437 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:40:38,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:40:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1643470536, now seen corresponding path program 3 times [2024-06-20 18:40:38,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:40:38,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518970440] [2024-06-20 18:40:38,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:40:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:40:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:40:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:40:54,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:40:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518970440] [2024-06-20 18:40:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518970440] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:40:54,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:40:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:40:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971176958] [2024-06-20 18:40:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:40:54,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:40:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:40:54,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:40:54,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:40:55,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:40:55,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 156 transitions, 1232 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:40:55,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:40:55,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:40:55,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:40:57,418 INFO L124 PetriNetUnfolderBase]: 2651/4052 cut-off events. [2024-06-20 18:40:57,419 INFO L125 PetriNetUnfolderBase]: For 224232/224232 co-relation queries the response was YES. [2024-06-20 18:40:57,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29071 conditions, 4052 events. 2651/4052 cut-off events. For 224232/224232 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 20970 event pairs, 655 based on Foata normal form. 4/4034 useless extension candidates. Maximal degree in co-relation 29011. Up to 3295 conditions per place. [2024-06-20 18:40:57,447 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 115 selfloop transitions, 81 changer transitions 0/211 dead transitions. [2024-06-20 18:40:57,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 211 transitions, 2028 flow [2024-06-20 18:40:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:40:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:40:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions. [2024-06-20 18:40:57,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790697674418605 [2024-06-20 18:40:57,451 INFO L175 Difference]: Start difference. First operand has 136 places, 156 transitions, 1232 flow. Second operand 10 states and 206 transitions. [2024-06-20 18:40:57,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 211 transitions, 2028 flow [2024-06-20 18:40:57,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 211 transitions, 1974 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 18:40:57,568 INFO L231 Difference]: Finished difference. Result has 138 places, 162 transitions, 1523 flow [2024-06-20 18:40:57,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1523, PETRI_PLACES=138, PETRI_TRANSITIONS=162} [2024-06-20 18:40:57,568 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 94 predicate places. [2024-06-20 18:40:57,568 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 162 transitions, 1523 flow [2024-06-20 18:40:57,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:40:57,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:40:57,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:40:57,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 18:40:57,569 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:40:57,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:40:57,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2111966884, now seen corresponding path program 4 times [2024-06-20 18:40:57,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:40:57,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036469682] [2024-06-20 18:40:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:40:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:40:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:41:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:41:13,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:41:13,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036469682] [2024-06-20 18:41:13,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036469682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:41:13,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:41:13,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:41:13,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847773379] [2024-06-20 18:41:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:41:13,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:41:13,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:41:13,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:41:13,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:41:13,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:41:13,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 162 transitions, 1523 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:41:13,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:41:13,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:41:13,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:41:16,301 INFO L124 PetriNetUnfolderBase]: 2698/4119 cut-off events. [2024-06-20 18:41:16,301 INFO L125 PetriNetUnfolderBase]: For 239217/239217 co-relation queries the response was YES. [2024-06-20 18:41:16,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30712 conditions, 4119 events. 2698/4119 cut-off events. For 239217/239217 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 21268 event pairs, 644 based on Foata normal form. 4/4101 useless extension candidates. Maximal degree in co-relation 30650. Up to 3331 conditions per place. [2024-06-20 18:41:16,330 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 119 selfloop transitions, 77 changer transitions 0/211 dead transitions. [2024-06-20 18:41:16,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 211 transitions, 2251 flow [2024-06-20 18:41:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:41:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:41:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions. [2024-06-20 18:41:16,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744186046511628 [2024-06-20 18:41:16,333 INFO L175 Difference]: Start difference. First operand has 138 places, 162 transitions, 1523 flow. Second operand 10 states and 204 transitions. [2024-06-20 18:41:16,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 211 transitions, 2251 flow [2024-06-20 18:41:16,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 211 transitions, 2111 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-20 18:41:16,472 INFO L231 Difference]: Finished difference. Result has 142 places, 165 transitions, 1625 flow [2024-06-20 18:41:16,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1625, PETRI_PLACES=142, PETRI_TRANSITIONS=165} [2024-06-20 18:41:16,472 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 98 predicate places. [2024-06-20 18:41:16,472 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 165 transitions, 1625 flow [2024-06-20 18:41:16,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:41:16,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:41:16,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:41:16,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 18:41:16,473 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:41:16,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:41:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1499364525, now seen corresponding path program 1 times [2024-06-20 18:41:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:41:16,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95882280] [2024-06-20 18:41:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:41:16,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:41:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:41:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:41:31,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:41:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95882280] [2024-06-20 18:41:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95882280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:41:31,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:41:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:41:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361927172] [2024-06-20 18:41:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:41:31,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:41:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:41:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:41:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:41:32,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:41:32,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 165 transitions, 1625 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:41:32,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:41:32,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:41:32,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:41:34,469 INFO L124 PetriNetUnfolderBase]: 2919/4384 cut-off events. [2024-06-20 18:41:34,469 INFO L125 PetriNetUnfolderBase]: For 263319/263321 co-relation queries the response was YES. [2024-06-20 18:41:34,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33546 conditions, 4384 events. 2919/4384 cut-off events. For 263319/263321 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 21469 event pairs, 793 based on Foata normal form. 6/4385 useless extension candidates. Maximal degree in co-relation 33482. Up to 3971 conditions per place. [2024-06-20 18:41:34,499 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 155 selfloop transitions, 44 changer transitions 0/208 dead transitions. [2024-06-20 18:41:34,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 208 transitions, 2212 flow [2024-06-20 18:41:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:41:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:41:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-20 18:41:34,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-20 18:41:34,503 INFO L175 Difference]: Start difference. First operand has 142 places, 165 transitions, 1625 flow. Second operand 9 states and 172 transitions. [2024-06-20 18:41:34,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 208 transitions, 2212 flow [2024-06-20 18:41:34,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 208 transitions, 2025 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-20 18:41:34,650 INFO L231 Difference]: Finished difference. Result has 145 places, 170 transitions, 1626 flow [2024-06-20 18:41:34,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1626, PETRI_PLACES=145, PETRI_TRANSITIONS=170} [2024-06-20 18:41:34,650 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 101 predicate places. [2024-06-20 18:41:34,650 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 170 transitions, 1626 flow [2024-06-20 18:41:34,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:41:34,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:41:34,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:41:34,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 18:41:34,651 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:41:34,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:41:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash -990490586, now seen corresponding path program 1 times [2024-06-20 18:41:34,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:41:34,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753338338] [2024-06-20 18:41:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:41:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:41:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:41:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:41:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:41:52,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753338338] [2024-06-20 18:41:52,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753338338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:41:52,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:41:52,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:41:52,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851912989] [2024-06-20 18:41:52,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:41:52,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:41:52,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:41:52,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:41:52,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:41:52,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:41:52,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 170 transitions, 1626 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:41:52,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:41:52,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:41:52,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:41:54,371 INFO L124 PetriNetUnfolderBase]: 2892/4339 cut-off events. [2024-06-20 18:41:54,371 INFO L125 PetriNetUnfolderBase]: For 273369/273373 co-relation queries the response was YES. [2024-06-20 18:41:54,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33943 conditions, 4339 events. 2892/4339 cut-off events. For 273369/273373 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21255 event pairs, 894 based on Foata normal form. 5/4327 useless extension candidates. Maximal degree in co-relation 33877. Up to 4207 conditions per place. [2024-06-20 18:41:54,401 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 166 selfloop transitions, 24 changer transitions 0/199 dead transitions. [2024-06-20 18:41:54,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 199 transitions, 2218 flow [2024-06-20 18:41:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:41:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:41:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-20 18:41:54,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-20 18:41:54,402 INFO L175 Difference]: Start difference. First operand has 145 places, 170 transitions, 1626 flow. Second operand 7 states and 131 transitions. [2024-06-20 18:41:54,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 199 transitions, 2218 flow [2024-06-20 18:41:54,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 199 transitions, 2079 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-20 18:41:54,534 INFO L231 Difference]: Finished difference. Result has 146 places, 176 transitions, 1623 flow [2024-06-20 18:41:54,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1623, PETRI_PLACES=146, PETRI_TRANSITIONS=176} [2024-06-20 18:41:54,534 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 102 predicate places. [2024-06-20 18:41:54,534 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 176 transitions, 1623 flow [2024-06-20 18:41:54,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:41:54,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:41:54,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:41:54,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 18:41:54,535 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:41:54,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:41:54,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1130781118, now seen corresponding path program 5 times [2024-06-20 18:41:54,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:41:54,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555369172] [2024-06-20 18:41:54,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:41:54,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:41:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:42:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:42:10,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:42:10,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555369172] [2024-06-20 18:42:10,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555369172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:42:10,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:42:10,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:42:10,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914796957] [2024-06-20 18:42:10,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:42:10,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:42:10,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:42:10,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:42:10,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:42:10,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:42:10,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 176 transitions, 1623 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:42:10,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:42:10,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:42:10,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:42:13,225 INFO L124 PetriNetUnfolderBase]: 2757/4205 cut-off events. [2024-06-20 18:42:13,226 INFO L125 PetriNetUnfolderBase]: For 280790/280790 co-relation queries the response was YES. [2024-06-20 18:42:13,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32846 conditions, 4205 events. 2757/4205 cut-off events. For 280790/280790 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 21682 event pairs, 661 based on Foata normal form. 4/4190 useless extension candidates. Maximal degree in co-relation 32779. Up to 3415 conditions per place. [2024-06-20 18:42:13,257 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 130 selfloop transitions, 74 changer transitions 0/222 dead transitions. [2024-06-20 18:42:13,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 222 transitions, 2377 flow [2024-06-20 18:42:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:42:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:42:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2024-06-20 18:42:13,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697674418604651 [2024-06-20 18:42:13,260 INFO L175 Difference]: Start difference. First operand has 146 places, 176 transitions, 1623 flow. Second operand 10 states and 202 transitions. [2024-06-20 18:42:13,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 222 transitions, 2377 flow [2024-06-20 18:42:13,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 222 transitions, 2321 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-20 18:42:13,461 INFO L231 Difference]: Finished difference. Result has 153 places, 179 transitions, 1811 flow [2024-06-20 18:42:13,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1811, PETRI_PLACES=153, PETRI_TRANSITIONS=179} [2024-06-20 18:42:13,462 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 109 predicate places. [2024-06-20 18:42:13,462 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 179 transitions, 1811 flow [2024-06-20 18:42:13,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:42:13,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:42:13,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:42:13,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 18:42:13,462 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:42:13,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:42:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1130565637, now seen corresponding path program 2 times [2024-06-20 18:42:13,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:42:13,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137665766] [2024-06-20 18:42:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:42:13,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:42:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:42:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:42:28,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:42:28,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137665766] [2024-06-20 18:42:28,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137665766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:42:28,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:42:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:42:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216363001] [2024-06-20 18:42:28,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:42:28,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:42:28,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:42:28,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:42:28,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:42:28,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:42:28,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 179 transitions, 1811 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:42:28,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:42:28,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:42:28,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:42:30,711 INFO L124 PetriNetUnfolderBase]: 3005/4507 cut-off events. [2024-06-20 18:42:30,711 INFO L125 PetriNetUnfolderBase]: For 307501/307503 co-relation queries the response was YES. [2024-06-20 18:42:30,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36240 conditions, 4507 events. 3005/4507 cut-off events. For 307501/307503 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 22098 event pairs, 781 based on Foata normal form. 6/4511 useless extension candidates. Maximal degree in co-relation 36171. Up to 4077 conditions per place. [2024-06-20 18:42:30,745 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 166 selfloop transitions, 44 changer transitions 0/221 dead transitions. [2024-06-20 18:42:30,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 221 transitions, 2440 flow [2024-06-20 18:42:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:42:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:42:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-20 18:42:30,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-20 18:42:30,748 INFO L175 Difference]: Start difference. First operand has 153 places, 179 transitions, 1811 flow. Second operand 9 states and 172 transitions. [2024-06-20 18:42:30,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 221 transitions, 2440 flow [2024-06-20 18:42:30,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 221 transitions, 2248 flow, removed 38 selfloop flow, removed 7 redundant places. [2024-06-20 18:42:30,982 INFO L231 Difference]: Finished difference. Result has 156 places, 185 transitions, 1831 flow [2024-06-20 18:42:30,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1831, PETRI_PLACES=156, PETRI_TRANSITIONS=185} [2024-06-20 18:42:30,984 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 112 predicate places. [2024-06-20 18:42:30,984 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 185 transitions, 1831 flow [2024-06-20 18:42:30,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:42:30,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:42:30,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:42:30,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 18:42:30,984 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:42:30,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:42:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1123156327, now seen corresponding path program 3 times [2024-06-20 18:42:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:42:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523669507] [2024-06-20 18:42:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:42:30,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:42:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:42:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:42:46,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:42:46,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523669507] [2024-06-20 18:42:46,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523669507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:42:46,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:42:46,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:42:46,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180725572] [2024-06-20 18:42:46,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:42:46,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:42:46,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:42:46,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:42:46,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:42:47,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:42:47,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 185 transitions, 1831 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:42:47,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:42:47,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:42:47,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:42:49,710 INFO L124 PetriNetUnfolderBase]: 3022/4534 cut-off events. [2024-06-20 18:42:49,710 INFO L125 PetriNetUnfolderBase]: For 322977/322979 co-relation queries the response was YES. [2024-06-20 18:42:49,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36819 conditions, 4534 events. 3022/4534 cut-off events. For 322977/322979 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 22262 event pairs, 824 based on Foata normal form. 6/4538 useless extension candidates. Maximal degree in co-relation 36748. Up to 4104 conditions per place. [2024-06-20 18:42:49,739 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 166 selfloop transitions, 47 changer transitions 0/224 dead transitions. [2024-06-20 18:42:49,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 224 transitions, 2449 flow [2024-06-20 18:42:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:42:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:42:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-20 18:42:49,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2024-06-20 18:42:49,743 INFO L175 Difference]: Start difference. First operand has 156 places, 185 transitions, 1831 flow. Second operand 9 states and 170 transitions. [2024-06-20 18:42:49,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 224 transitions, 2449 flow [2024-06-20 18:42:49,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 224 transitions, 2296 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-20 18:42:49,943 INFO L231 Difference]: Finished difference. Result has 159 places, 189 transitions, 1873 flow [2024-06-20 18:42:49,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1873, PETRI_PLACES=159, PETRI_TRANSITIONS=189} [2024-06-20 18:42:49,944 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 115 predicate places. [2024-06-20 18:42:49,944 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 189 transitions, 1873 flow [2024-06-20 18:42:49,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:42:49,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:42:49,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:42:49,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 18:42:49,945 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:42:49,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:42:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -439726621, now seen corresponding path program 4 times [2024-06-20 18:42:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:42:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017409047] [2024-06-20 18:42:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:42:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:42:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:43:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:43:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:43:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017409047] [2024-06-20 18:43:05,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017409047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:43:05,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:43:05,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:43:05,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930980739] [2024-06-20 18:43:05,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:43:05,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:43:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:43:05,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:43:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:43:05,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:43:05,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 189 transitions, 1873 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:05,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:43:05,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:43:05,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:43:07,942 INFO L124 PetriNetUnfolderBase]: 3047/4569 cut-off events. [2024-06-20 18:43:07,942 INFO L125 PetriNetUnfolderBase]: For 340087/340089 co-relation queries the response was YES. [2024-06-20 18:43:07,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37545 conditions, 4569 events. 3047/4569 cut-off events. For 340087/340089 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 22500 event pairs, 800 based on Foata normal form. 6/4563 useless extension candidates. Maximal degree in co-relation 37473. Up to 4066 conditions per place. [2024-06-20 18:43:07,975 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 161 selfloop transitions, 54 changer transitions 0/226 dead transitions. [2024-06-20 18:43:07,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 226 transitions, 2473 flow [2024-06-20 18:43:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:43:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:43:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-20 18:43:07,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2024-06-20 18:43:07,978 INFO L175 Difference]: Start difference. First operand has 159 places, 189 transitions, 1873 flow. Second operand 9 states and 170 transitions. [2024-06-20 18:43:07,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 226 transitions, 2473 flow [2024-06-20 18:43:08,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 226 transitions, 2334 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-20 18:43:08,192 INFO L231 Difference]: Finished difference. Result has 163 places, 191 transitions, 1923 flow [2024-06-20 18:43:08,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1923, PETRI_PLACES=163, PETRI_TRANSITIONS=191} [2024-06-20 18:43:08,192 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 119 predicate places. [2024-06-20 18:43:08,192 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 191 transitions, 1923 flow [2024-06-20 18:43:08,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:08,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:43:08,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:43:08,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 18:43:08,193 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:43:08,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:43:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1045889322, now seen corresponding path program 1 times [2024-06-20 18:43:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:43:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135071886] [2024-06-20 18:43:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:43:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:43:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:43:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:43:26,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:43:26,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135071886] [2024-06-20 18:43:26,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135071886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:43:26,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:43:26,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:43:26,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454425682] [2024-06-20 18:43:26,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:43:26,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:43:26,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:43:26,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:43:26,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:43:26,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:43:26,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 191 transitions, 1923 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:26,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:43:26,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:43:26,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:43:28,696 INFO L124 PetriNetUnfolderBase]: 2903/4407 cut-off events. [2024-06-20 18:43:28,696 INFO L125 PetriNetUnfolderBase]: For 353601/353636 co-relation queries the response was YES. [2024-06-20 18:43:28,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37154 conditions, 4407 events. 2903/4407 cut-off events. For 353601/353636 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 22267 event pairs, 890 based on Foata normal form. 9/4374 useless extension candidates. Maximal degree in co-relation 37081. Up to 4139 conditions per place. [2024-06-20 18:43:28,731 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 173 selfloop transitions, 23 changer transitions 0/221 dead transitions. [2024-06-20 18:43:28,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 221 transitions, 2551 flow [2024-06-20 18:43:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:43:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:43:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-20 18:43:28,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45182724252491696 [2024-06-20 18:43:28,732 INFO L175 Difference]: Start difference. First operand has 163 places, 191 transitions, 1923 flow. Second operand 7 states and 136 transitions. [2024-06-20 18:43:28,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 221 transitions, 2551 flow [2024-06-20 18:43:28,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 221 transitions, 2380 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-20 18:43:28,929 INFO L231 Difference]: Finished difference. Result has 164 places, 200 transitions, 1922 flow [2024-06-20 18:43:28,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1752, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1922, PETRI_PLACES=164, PETRI_TRANSITIONS=200} [2024-06-20 18:43:28,929 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 120 predicate places. [2024-06-20 18:43:28,929 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 200 transitions, 1922 flow [2024-06-20 18:43:28,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:28,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:43:28,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:43:28,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 18:43:28,930 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:43:28,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:43:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1811105438, now seen corresponding path program 2 times [2024-06-20 18:43:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:43:28,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159588545] [2024-06-20 18:43:28,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:43:28,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:43:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:43:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:43:47,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:43:47,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159588545] [2024-06-20 18:43:47,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159588545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:43:47,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:43:47,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:43:47,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740860351] [2024-06-20 18:43:47,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:43:47,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:43:47,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:43:47,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:43:47,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:43:47,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:43:47,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 200 transitions, 1922 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:47,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:43:47,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:43:47,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:43:49,895 INFO L124 PetriNetUnfolderBase]: 3034/4540 cut-off events. [2024-06-20 18:43:49,895 INFO L125 PetriNetUnfolderBase]: For 367566/367572 co-relation queries the response was YES. [2024-06-20 18:43:49,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38701 conditions, 4540 events. 3034/4540 cut-off events. For 367566/367572 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 22329 event pairs, 911 based on Foata normal form. 7/4523 useless extension candidates. Maximal degree in co-relation 38626. Up to 4417 conditions per place. [2024-06-20 18:43:49,930 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 185 selfloop transitions, 26 changer transitions 0/220 dead transitions. [2024-06-20 18:43:49,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 220 transitions, 2514 flow [2024-06-20 18:43:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:43:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:43:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-20 18:43:49,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-20 18:43:49,932 INFO L175 Difference]: Start difference. First operand has 164 places, 200 transitions, 1922 flow. Second operand 7 states and 126 transitions. [2024-06-20 18:43:49,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 220 transitions, 2514 flow [2024-06-20 18:43:50,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 220 transitions, 2470 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-20 18:43:50,149 INFO L231 Difference]: Finished difference. Result has 169 places, 203 transitions, 1974 flow [2024-06-20 18:43:50,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1974, PETRI_PLACES=169, PETRI_TRANSITIONS=203} [2024-06-20 18:43:50,150 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 125 predicate places. [2024-06-20 18:43:50,150 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 203 transitions, 1974 flow [2024-06-20 18:43:50,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:50,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:43:50,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:43:50,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 18:43:50,150 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:43:50,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:43:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash 701993311, now seen corresponding path program 5 times [2024-06-20 18:43:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:43:50,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667256385] [2024-06-20 18:43:50,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:43:50,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:43:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:44:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:44:06,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:44:06,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667256385] [2024-06-20 18:44:06,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667256385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:44:06,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:44:06,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:44:06,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992134845] [2024-06-20 18:44:06,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:44:06,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:44:06,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:44:06,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:44:06,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:44:06,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:44:06,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 203 transitions, 1974 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:06,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:44:06,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:44:06,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:44:09,291 INFO L124 PetriNetUnfolderBase]: 3113/4667 cut-off events. [2024-06-20 18:44:09,292 INFO L125 PetriNetUnfolderBase]: For 383370/383370 co-relation queries the response was YES. [2024-06-20 18:44:09,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39494 conditions, 4667 events. 3113/4667 cut-off events. For 383370/383370 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 22988 event pairs, 869 based on Foata normal form. 4/4669 useless extension candidates. Maximal degree in co-relation 39416. Up to 4358 conditions per place. [2024-06-20 18:44:09,324 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 198 selfloop transitions, 30 changer transitions 0/240 dead transitions. [2024-06-20 18:44:09,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 240 transitions, 2633 flow [2024-06-20 18:44:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:44:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:44:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-20 18:44:09,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42118863049095606 [2024-06-20 18:44:09,327 INFO L175 Difference]: Start difference. First operand has 169 places, 203 transitions, 1974 flow. Second operand 9 states and 163 transitions. [2024-06-20 18:44:09,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 240 transitions, 2633 flow [2024-06-20 18:44:09,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 240 transitions, 2571 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-20 18:44:09,635 INFO L231 Difference]: Finished difference. Result has 175 places, 209 transitions, 2116 flow [2024-06-20 18:44:09,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1912, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2116, PETRI_PLACES=175, PETRI_TRANSITIONS=209} [2024-06-20 18:44:09,635 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 131 predicate places. [2024-06-20 18:44:09,635 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 209 transitions, 2116 flow [2024-06-20 18:44:09,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:09,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:44:09,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:44:09,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 18:44:09,636 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:44:09,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:44:09,636 INFO L85 PathProgramCache]: Analyzing trace with hash 701777830, now seen corresponding path program 6 times [2024-06-20 18:44:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:44:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166093361] [2024-06-20 18:44:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:44:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:44:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:44:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:44:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:44:24,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166093361] [2024-06-20 18:44:24,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166093361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:44:24,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:44:24,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:44:24,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104746830] [2024-06-20 18:44:24,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:44:24,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:44:24,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:44:24,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:44:24,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:44:25,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-20 18:44:25,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 209 transitions, 2116 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:25,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:44:25,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-20 18:44:25,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:44:27,651 INFO L124 PetriNetUnfolderBase]: 2868/4379 cut-off events. [2024-06-20 18:44:27,651 INFO L125 PetriNetUnfolderBase]: For 381366/381366 co-relation queries the response was YES. [2024-06-20 18:44:27,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37521 conditions, 4379 events. 2868/4379 cut-off events. For 381366/381366 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 22653 event pairs, 749 based on Foata normal form. 4/4361 useless extension candidates. Maximal degree in co-relation 37441. Up to 3858 conditions per place. [2024-06-20 18:44:27,685 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 184 selfloop transitions, 50 changer transitions 0/255 dead transitions. [2024-06-20 18:44:27,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 255 transitions, 3194 flow [2024-06-20 18:44:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:44:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:44:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-20 18:44:27,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44651162790697674 [2024-06-20 18:44:27,688 INFO L175 Difference]: Start difference. First operand has 175 places, 209 transitions, 2116 flow. Second operand 10 states and 192 transitions. [2024-06-20 18:44:27,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 255 transitions, 3194 flow [2024-06-20 18:44:28,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 255 transitions, 3053 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-20 18:44:28,029 INFO L231 Difference]: Finished difference. Result has 180 places, 215 transitions, 2266 flow [2024-06-20 18:44:28,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2266, PETRI_PLACES=180, PETRI_TRANSITIONS=215} [2024-06-20 18:44:28,029 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 136 predicate places. [2024-06-20 18:44:28,029 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 215 transitions, 2266 flow [2024-06-20 18:44:28,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:28,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:44:28,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:44:28,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 18:44:28,030 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:44:28,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:44:28,030 INFO L85 PathProgramCache]: Analyzing trace with hash -569918451, now seen corresponding path program 6 times [2024-06-20 18:44:28,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:44:28,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573427344] [2024-06-20 18:44:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:44:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:44:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:44:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:44:43,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:44:43,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573427344] [2024-06-20 18:44:43,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573427344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:44:43,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:44:43,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:44:43,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214405310] [2024-06-20 18:44:43,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:44:43,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:44:43,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:44:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:44:43,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:44:43,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-20 18:44:43,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 215 transitions, 2266 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:43,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:44:43,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-20 18:44:43,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:44:45,975 INFO L124 PetriNetUnfolderBase]: 3119/4679 cut-off events. [2024-06-20 18:44:45,976 INFO L125 PetriNetUnfolderBase]: For 414954/414954 co-relation queries the response was YES. [2024-06-20 18:44:45,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40988 conditions, 4679 events. 3119/4679 cut-off events. For 414954/414954 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 23073 event pairs, 860 based on Foata normal form. 4/4681 useless extension candidates. Maximal degree in co-relation 40906. Up to 4370 conditions per place. [2024-06-20 18:44:46,015 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 207 selfloop transitions, 31 changer transitions 0/250 dead transitions. [2024-06-20 18:44:46,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 250 transitions, 2934 flow [2024-06-20 18:44:46,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:44:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:44:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-20 18:44:46,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42377260981912146 [2024-06-20 18:44:46,018 INFO L175 Difference]: Start difference. First operand has 180 places, 215 transitions, 2266 flow. Second operand 9 states and 164 transitions. [2024-06-20 18:44:46,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 250 transitions, 2934 flow [2024-06-20 18:44:46,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 250 transitions, 2634 flow, removed 51 selfloop flow, removed 9 redundant places. [2024-06-20 18:44:46,315 INFO L231 Difference]: Finished difference. Result has 180 places, 219 transitions, 2149 flow [2024-06-20 18:44:46,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1972, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2149, PETRI_PLACES=180, PETRI_TRANSITIONS=219} [2024-06-20 18:44:46,316 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 136 predicate places. [2024-06-20 18:44:46,316 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 219 transitions, 2149 flow [2024-06-20 18:44:46,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:46,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:44:46,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:44:46,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 18:44:46,317 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:44:46,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:44:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash 182432493, now seen corresponding path program 7 times [2024-06-20 18:44:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:44:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038319864] [2024-06-20 18:44:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:44:46,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:44:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15